Michael Molloy

6.2k total citations · 2 hit papers
77 papers, 3.3k citations indexed

About

Michael Molloy is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, Michael Molloy has authored 77 papers receiving a total of 3.3k indexed citations (citations by other indexed papers that have themselves been cited), including 56 papers in Computational Theory and Mathematics, 37 papers in Discrete Mathematics and Combinatorics and 24 papers in Computer Networks and Communications. Recurrent topics in Michael Molloy's work include Advanced Graph Theory Research (49 papers), Limits and Structures in Graph Theory (37 papers) and Constraint Satisfaction and Optimization (21 papers). Michael Molloy is often cited by papers focused on Advanced Graph Theory Research (49 papers), Limits and Structures in Graph Theory (37 papers) and Constraint Satisfaction and Optimization (21 papers). Michael Molloy collaborates with scholars based in Canada, United States and France. Michael Molloy's co-authors include Bruce Reed, Mohammad R. Salavatipour, Dimitris Achlioptas, Alan Frieze, Paul Beame, Hamed Hatami, Colin Cooper, Robert W. Robinson, Ryan Hayward and Russell Greiner and has published in prestigious journals such as Artificial Intelligence, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Michael Molloy

75 papers receiving 3.1k citations

Hit Papers

A critical point for random graphs with a given degree se... 1995 2026 2005 2015 1995 1998 400 800 1.2k
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. A critical point for random graphs with a given degree sequence
    1995 1.4k citations Michael Molloy, Bruce Reed Random Structures and Algorithms profile →
  2. The Size of the Giant Component of a Random Graph with a Given Degree Sequence
    1998 492 citations Michael Molloy, Bruce Reed profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Michael Molloy Canada 22 1.5k 1.2k 686 626 485 77 3.3k
Linyuan Lü United States 24 2.4k 1.6× 889 0.7× 970 1.4× 393 0.6× 613 1.3× 90 4.2k
Oliver Riordan United Kingdom 23 1.6k 1.0× 635 0.5× 403 0.6× 467 0.7× 994 2.0× 70 2.9k
Boris Pittel United States 27 583 0.4× 669 0.6× 470 0.7× 609 1.0× 992 2.0× 119 2.7k
Nicholas Wormald Australia 29 449 0.3× 1.4k 1.2× 472 0.7× 1.2k 1.9× 744 1.5× 145 3.0k
Colin Cooper United Kingdom 23 614 0.4× 455 0.4× 574 0.8× 239 0.4× 404 0.8× 119 1.7k
Prasad Tetali United States 25 302 0.2× 733 0.6× 466 0.7× 391 0.6× 556 1.1× 104 2.3k
Elchanan Mossel United States 34 807 0.5× 1.3k 1.1× 627 0.9× 167 0.3× 468 1.0× 169 4.1k
Mathew D. Penrose United Kingdom 25 542 0.4× 576 0.5× 1.5k 2.1× 134 0.2× 1.1k 2.2× 91 3.8k
Dimitris Achlioptas United States 29 549 0.4× 1.0k 0.9× 1.3k 1.9× 179 0.3× 242 0.5× 66 3.7k
Dominic Welsh United Kingdom 25 225 0.1× 1.4k 1.1× 453 0.7× 743 1.2× 501 1.0× 80 3.2k

Countries citing papers authored by Michael Molloy

Since Specialization
Citations

This map shows the geographic impact of Michael Molloy's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Molloy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Molloy more than expected).

Fields of papers citing papers by Michael Molloy

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Molloy. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Molloy. The network helps show where Michael Molloy may publish in the future.

Co-authorship network of co-authors of Michael Molloy

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Molloy. A scholar is included among the top collaborators of Michael Molloy based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Molloy. Michael Molloy is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Molloy, Michael, et al.. (2025). The degree-restricted random process is far from uniform. Journal of Combinatorial Theory Series B. 176. 111–162.
2.
Molloy, Michael, Paweł Prałat, & Gregory B. Sorkin. (2025). Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model. Random Structures and Algorithms. 66(2). 1 indexed citations
3.
Molloy, Michael & Bruce Reed. (2014). Colouring graphs when the number of colours is almost the maximum degree. Journal of Combinatorial Theory Series B. 109. 134–195. 18 indexed citations
4.
Molloy, Michael, et al.. (2013). Frozen variables in random boolean constraint satisfaction problems. Symposium on Discrete Algorithms. 1306–1318. 6 indexed citations
5.
Molloy, Michael & Bruce Reed. (2009). Asymptotically optimal frugal colouring. Symposium on Discrete Algorithms. 106–114. 2 indexed citations
6.
Molloy, Michael & Bruce Reed. (2009). Asymptotically optimal frugal colouring. Journal of Combinatorial Theory Series B. 100(2). 226–246. 8 indexed citations
7.
Molloy, Michael & Mohammad R. Salavatipour. (2005). A bound on the chromatic number of the square of a planar graph. Journal of Combinatorial Theory Series B. 94(2). 189–213. 132 indexed citations
8.
Greiner, Russell, et al.. (2005). Finding optimal satisficing strategies for and-or trees. Artificial Intelligence. 170(1). 19–58. 37 indexed citations
9.
Achlioptas, Dimitris, Paul Beame, & Michael Molloy. (2004). Exponential bounds for DPLL below the satisfiability threshold. Symposium on Discrete Algorithms. 139–140. 10 indexed citations
10.
Molloy, Michael. (2004). The pure literal rule threshold and cores in random hypergraphs. Symposium on Discrete Algorithms. 672–681. 17 indexed citations
11.
Molloy, Michael, et al.. (2004). (Δ-k)-critical graphs. Journal of Combinatorial Theory Series B. 93(2). 173–185. 6 indexed citations
12.
Dyer, Martin, Alan Frieze, & Michael Molloy. (2003). A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theoretical Computer Science. 290(3). 1815–1828. 15 indexed citations
13.
Achlioptas, Dimitris, Paul Beame, & Michael Molloy. (2003). A sharp threshold in proof complexity yields lower bounds for satisfiability search. Journal of Computer and System Sciences. 68(2). 238–268. 25 indexed citations
14.
Greiner, Russell, Ryan Hayward, & Michael Molloy. (2002). Optimal depth-first strategies for and-or trees. National Conference on Artificial Intelligence. 725–730. 5 indexed citations
15.
16.
Molloy, Michael. (2001). Very rapidly mixing Markov chains for 2?-colorings and for independent sets in a graph with maximum degree 4. Random Structures and Algorithms. 18(2). 101–115. 7 indexed citations
17.
Molloy, Michael & Bruce Reed. (1999). Critical Subgraphs of a Random Graph. The Electronic Journal of Combinatorics. 6(1). 6 indexed citations
18.
Molloy, Michael & Bruce Reed. (1998). A Bound on the Total Chromatic Number. COMBINATORICA. 18(2). 241–280. 53 indexed citations
19.
Molloy, Michael & Bruce Reed. (1997). A Bound on the Strong Chromatic Index of a Graph. Journal of Combinatorial Theory Series B. 69(2). 103–109. 97 indexed citations
20.
Achlioptas, Dimitris & Michael Molloy. (1997). The Analysis of a List-Coloring Algorithm on a Random Graph (Extended Abstract).

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Linyuan Lü Breakdown of academic impact, for papers by Oliver Riordan Breakdown of academic impact, for papers by Boris Pittel Breakdown of academic impact, for papers by Nicholas Wormald Breakdown of academic impact, for papers by Colin Cooper Breakdown of academic impact, for papers by Prasad Tetali Breakdown of academic impact, for papers by Elchanan Mossel Breakdown of academic impact, for papers by Mathew D. Penrose Breakdown of academic impact, for papers by Dimitris Achlioptas Breakdown of academic impact, for papers by Dominic Welsh
Rankless by CCL
2026