Michael Molloy
- Statistical and Nonlinear Physics top 0.5%
- Computational Theory and Mathematics top 0.2%
- Computer Networks and Communications top 2%
- Discrete Mathematics and Combinatorics top 0.5%
- Mathematical Physics top 2%
- Co-authors
- Bruce ReedMohammad R. SalavatipourDimitris AchlioptasAlan FriezePaul BeameHamed HatamiColin CooperRobert W. Robinson
- Topics
- Advanced Graph Theory Research (49 papers)Limits and Structures in Graph Theory (37 papers)Constraint Satisfaction and Optimization (21 papers)
- Cited by
- Discrete Mathematics and CombinatoricsStatistical and Nonlinear PhysicsComputational Theory and Mathematics
- Partner nations
- CanadaUnited StatesFrance
In The Last Decade
Michael Molloy
75 papers receiving 3.1k citations
Hit Papers
Peers
Comparison fields: 5 of 109
- Statistical and Nonlinear Physics 1.5k
- Computational Theory and Mathematics 1.2k
- Computer Networks and Communications 686
- Discrete Mathematics and Combinatorics 626
- Mathematical Physics 485
Countries citing papers authored by Michael Molloy
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 18 | |
| 4 | 6 | |
| 5 | 2 | |
| 6 | 8 | |
| 7 | 132 | |
| 8 | 37 | |
| 9 | 10 | |
| 10 | 17 | |
| 11 | 6 | |
| 12 | 15 | |
| 13 | 25 | |
| 14 | 5 | |
| 15 | 1 | |
| 16 | 7 | |
| 17 | 6 | |
| 18 | 53 | |
| 19 | 97 | |
| 20 | The Analysis of a List-Coloring Algorithm on a Random Graph (Extended Abstract) | 0 |
About Michael Molloy
Michael Molloy is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 77 papers that have together received 3.3k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (49 papers), Limits and Structures in Graph Theory (37 papers) and Constraint Satisfaction and Optimization (21 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (626 citations), Statistical and Nonlinear Physics (1.5k citations) and Computational Theory and Mathematics (1.2k citations). Michael Molloy has collaborated with scholars based in Canada, United States and France. Frequent 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. Their work appears in journals such as Artificial Intelligence, Journal of the ACM and SIAM Journal on Computing.
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.