Michael Molloy

Cited by

	All	Since 2019
Citations	8301	2141
h-index	35	18
i10-index	64	30

440

220

110

330

199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202430 46 57 69 106 144 176 210 280 316 386 391 351 319 370 415 370 397 372 409 388 431 433 376 326 382 354 270

Public access

View all

9 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Bruce ReedMcGill UniversityVerified email at cs.mcgill.ca
Alan FriezeCarnegie Mellon UniversityVerified email at random.math.cmu.edu
Mohammad SalavatipourProfessor of Computer Science, University of AlbertaVerified email at cs.ualberta.ca
Evangelos KranakisChancellor's Professor, School of Computer Science, Carleton UniversityVerified email at scs.carleton.ca
Lefteris KirousisProfessor, Department of Mathematics, National & Kapodistrian University of AthensVerified email at math.uoa.gr
Paul BeameProfessor of Computer Science and Engineering, University of WashingtonVerified email at cs.washington.edu
Yannis StamatiouUniversity of PatrasVerified email at ceid.upatras.gr
Russ GreinerProfessor of Computing Science, University of Alberta; CIFAR AI ChairVerified email at ualberta.ca
Ryan B HaywardProfessor of Computing Science, University of AlbertaVerified email at ualberta.ca
Brendan LucierMicrosoft ResearchVerified email at microsoft.com
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Cristopher MooreSanta Fe InstituteVerified email at santafe.edu
Jason BrownProfessor of Mathematics and Statistisc, Dalhousie UniversityVerified email at mathstat.dal.ca
Catherine GreenhillSchool of Mathematics and Statistics, UNSW SydneyVerified email at unsw.edu.au
Yuval Peresyuvalperes.comVerified email at yuvalperes.com
Ricardo Restrepo LopezGoogleVerified email at google.com
Lap Chi LauUniversity of WaterlooVerified email at cs.uwaterloo.ca
Paul ErdősMathematics
Guanhua YanDepartment of Computer Science, Binghamton University, State University of New YorkVerified email at binghamton.edu

Michael Molloy

University of Toronto

Verified email at cs.toronto.edu - Homepage


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
A critical point for random graphs with a given degree sequence M Molloy, B Reed Random Structures & Algorithms 6 (2‐3), 161-180, 1995	2979	1995
The size of the giant component of a random graph with a given degree sequence M Molloy, B Reed Combinatorics probability and computing 7 (3), 295-305, 1998	1076	1998
Graph colouring and the probabilistic method M Molloy, B Reed Springer Science & Business Media, 2002	656	2002
Further algorithmic aspects of the local lemma M Molloy, B Reed Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998	275	1998
A bound on the chromatic number of the square of a planar graph M Molloy, MR Salavatipour Journal of Combinatorial Theory, Series B 94 (2), 189-213, 2005	255	2005
A bound on the chromatic number of the square of a planar graph M Molloy, MR Salavatipour J. Combin. Theory Ser. B, 2001	255*	2001
Random constraint satisfaction: A more accurate picture D Achlioptas, LM Kirousis, E Kranakis, D Krizanc, MSO Molloy, ... Principles and Practice of Constraint Programming-CP97: Third International …, 1997	230*	1997
A bound on the strong chromatic index of a graph M Molloy, B Reed Journal of Combinatorial Theory, Series B 69 (2), 103-109, 1997	210	1997
Cores in random hypergraphs and Boolean formulas M Molloy Random Structures & Algorithms 27 (1), 124-135, 2005	175	2005
Random constraint satisfaction: a more accurate picture D Achlioptas, LM Kirousis, E Kranakis, D Krizanc, MSO Molloy, ... Random structures and algorithms 12, 253-269, 1998	158	1998
Random constraint satisfaction: A more accurate picture D Achlioptas, L Kirousis, E Kranakis, D Krizanc, M Molloy, Y Stamatiou Principles and Practice of Constraint Programming-CP97, 107-120, 1997	158	1997
A bound on the total chromatic number M Molloy, B Reed Combinatorica 18 (2), 241-280, 1998	145	1998
The list chromatic number of graphs with small clique number M Molloy Journal of Combinatorial Theory, Series B 134, 264-284, 2019	107	2019
The analysis of a list-coloring algorithm on a random graph D Achlioptas, M Molloy Proceedings 38th Annual Symposium on Foundations of Computer Science, 204-212, 1997	106	1997
Colouring a graph frugally H Hind, M Molloy, B Reed Combinatorica 17 (4), 469-482, 1997	91	1997
Models and thresholds for random constraint satisfaction problems M Molloy Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	83	2002
Models and thresholds for random constraint satisfaction problems M Molloy Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	83	2002
Frequency channel assignment on planar networks M Molloy, MR Salavatipour Algorithms—ESA 2002: 10th Annual European Symposium Rome, Italy, September …, 2002	83	2002
The Glauber dynamics on colourings of a graph with high girth and maximum degree M Molloy Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	78	2002
Generating and counting Hamilton cycles in random regular graphs A Frieze, M Jerrum, M Molloy, R Robinson, N Wormald Journal of Algorithms 21 (1), 176-198, 1996	78	1996

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors