Jeannette Janssen
Jeannette Janssen
Professor of Mathematics, Dalhousie University, Nova Scotia, Canada
Verified email at dal.ca
Title
Cited by
Cited by
Year
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
1101997
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
1002008
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
972004
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
842006
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
782007
Probabilistic models for focused web crawling
H Liu, E Milios
Computational Intelligence 28 (3), 289-328, 2012
762012
Distributed online frequency assignment in cellular networks
J Janssen, D Krizanc, L Narayanan, S Shende
Journal of Algorithms 36 (2), 119-151, 2000
732000
Model selection for social networks using graphlets
J Janssen, M Hurshman, N Kalyaniwalla
Internet Mathematics 8 (4), 338363, 2012
582012
Geometric protean graphs
A Bonato, J Janssen, P Prałat
Internet Mathematics 8 (1-2), 2-28, 2012
51*2012
Node Similarity in Networked Information Space
W Lu, JCM Janssen, EE Milios, N Japkowicz
Dalhousie University, 2001
492001
On even and odd latin squares
JCM Janssen
Journal of Combinatorial Theory, Series A 69 (1), 173-181, 1995
451995
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
422006
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
412004
How to burn a graph
A Bonato, J Janssen, E Roshanbin
Internet Mathematics 12 (1-2), 85-100, 2016
372016
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
Bounds on the burning number
S Bessy, A Bonato, J Janssen, D Rautenbach, E Roshanbin
Discrete Applied Mathematics 235, 16-22, 2018
33*2018
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
332010
Burning a graph is hard
S Bessy, A Bonato, J Janssen, D Rautenbach, E Roshanbin
Discrete Applied Mathematics 232, 73-87, 2017
322017
Burning a graph as a model of social contagion
A Bonato, J Janssen, E Roshanbin
International Workshop on Algorithms and Models for the Web-Graph, 13-22, 2014
312014
The system can't perform the operation now. Try again later.
Articles 1–20