Jeannette Janssen
Jeannette Janssen
Professor of Mathematics, Dalhousie University, Nova Scotia, Canada
Dirección de correo verificada de dal.ca
Título
Citado por
Citado por
Año
New bounds on the list-chromatic index of the complete graph and other simple graphs
R Häggkvist, J Janssen
Combinatorics, Probability and Computing 6 (03), 295-313, 1997
1011997
A spatial web graph model with local influence regions
W Aiello, A Bonato, C Cooper, J Janssen, P Prałat
Internet Mathematics 5 (1-2), 175-196, 2008
992008
Characterizing and mining the citation graph of the computer science literature
Y An, J Janssen, EE Milios
Knowledge and Information Systems 6 (6), 664-678, 2004
932004
Using HMM to learn user browsing patterns for focused web crawling
H Liu, J Janssen, E Milios
Data & Knowledge Engineering 59 (2), 270-291, 2006
832006
Node similarity in the citation graph
W Lu, J Janssen, E Milios, N Japkowicz, Y Zhang
Knowledge and Information Systems 11 (1), 105-129, 2007
762007
Probabilistic models for focused web crawling
H Liu, E Milios
Computational Intelligence 28 (3), 289-328, 2012
722012
Distributed online frequency assignment in cellular networks
J Janssen, D Krizanc, L Narayanan, S Shende
Journal of Algorithms 36 (2), 119-151, 2000
722000
Model selection for social networks using graphlets
J Janssen, M Hurshman, N Kalyaniwalla
Internet Mathematics 8 (4), 338363, 2012
532012
Node similarity in networked information spaces.
W Lu, JCM Janssen, EE Milios, N Japkowicz
CASCON, 11, 2001
472001
Geometric protean graphs
A Bonato, J Janssen, P Prałat
Internet Mathematics 8 (1-2), 2-28, 2012
46*2012
On even and odd latin squares
JCM Janssen
Journal of Combinatorial Theory, Series A 69 (1), 173-181, 1995
411995
Characterization of graphs using degree cores
J Healy, J Janssen, E Milios, W Aiello
International Workshop on Algorithms and Models for the Web-Graph, 137-148, 2006
402006
Focused crawling by learning HMM from user's topic-specific browsing
H Liu, E Milios, J Janssen
IEEE/WIC/ACM International Conference on Web Intelligence (WI'04), 732-732, 2004
402004
The Dinitz problem solved for rectangles
J Janssen
Bulletin of the American Mathematical Society 29 (2), 243-249, 1993
371993
Infinite limits of copying models of the web graph
A Bonato, J Janssen
Internet Mathematics 1 (2), 193-213, 2004
352004
How to burn a graph
A Bonato, J Janssen, E Roshanbin
Internet Mathematics 12 (1-2), 85-100, 2016
322016
A geometric model for on-line social networks
A Bonato, J Janssen, P Prałat
Proceedings of the International Workshop on Modeling Social Media, 1-2, 2010
322010
Polyhedral analysis of channel assignment problems:(I) Tours
J Janssen, K Kilakos
Proc. 1996 IEEE Int. Conf. Communications, 1996
321996
An optimal solution to the" Philadelphia" channel assignment problem
JCM Janssen, K Kilakos
IEEE Transactions on Vehicular Technology 48 (3), 1012-1014, 1999
281999
There is no (46, 6, 1) block design
SK Houghten, LH Thiel, J Janssen, CWH Lam
Journal of Combinatorial Designs 9 (1), 60-71, 2001
272001
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20