- Home
- Best Scientists - Computer Science
- Michael Molloy

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
30
Citations
6,901
141
World Ranking
10035
National Ranking
411

2000 - Fellow of Alfred P. Sloan Foundation

- Combinatorics
- Discrete mathematics
- Mathematical analysis

Combinatorics, Discrete mathematics, Random graph, Random regular graph and Almost surely are his primary areas of study. His research on Combinatorics frequently connects to adjacent areas such as Upper and lower bounds. His work in Discrete mathematics addresses subjects such as Degree, which are connected to disciplines such as Algorithm.

While the research belongs to areas of Random graph, he spends his time largely on the problem of Hypergraph, intersecting his research to questions surrounding Space. His studies deal with areas such as Tree, Sequence, Cavity method and Linear number as well as Random regular graph. The Almost surely study combines topics in areas such as Modular decomposition, Trapezoid graph, Pathwidth and Indifference graph.

- A critical point for random graphs with a given degree sequence (1954 citations)
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence (700 citations)
- Further algorithmic aspects of the local lemma (173 citations)

His main research concerns Combinatorics, Discrete mathematics, Random graph, Graph and Constraint satisfaction problem. His work in Degree, Chromatic scale, Random regular graph, Vertex and Hypergraph is related to Combinatorics. Michael Molloy works mostly in the field of Discrete mathematics, limiting it down to concerns involving Almost surely and, occasionally, Algorithm.

His work on Giant component as part of his general Random graph study is frequently connected to High probability, thereby bridging the divide between different branches of science. His study in Graph is interdisciplinary in nature, drawing from both Upper and lower bounds and Conjecture. His Constraint satisfaction problem study combines topics in areas such as Constraint satisfaction and Constraint logic programming.

- Combinatorics (80.00%)
- Discrete mathematics (56.67%)
- Random graph (18.00%)

- Combinatorics (80.00%)
- Discrete mathematics (56.67%)
- Random graph (18.00%)

Michael Molloy mainly focuses on Combinatorics, Discrete mathematics, Random graph, Cluster analysis and Chromatic scale. His Combinatorics study frequently draws parallels with other fields, such as Upper and lower bounds. His study in the field of Multigraph also crosses realms of Constraint satisfaction problem.

He has researched Random graph in several fields, including Random regular graph and Linear number. The various areas that Michael Molloy examines in his Linear number study include Almost surely, Satisfiability, Cavity method and Exponential function. His work carried out in the field of Chromatic scale brings together such families of science as Time complexity, Complete coloring and Corollary.

- The freezing threshold for k-colourings of a random graph (58 citations)
- The list chromatic number of graphs with small clique number (35 citations)
- The scaling window for a random graph with a given degree sequence (34 citations)

- Combinatorics
- Mathematical analysis
- Discrete mathematics

His primary areas of investigation include Combinatorics, Discrete mathematics, Sequence, Hypergraph and Random graph. The study of Combinatorics is intertwined with the study of Constant in a number of ways. His studies in Discrete mathematics integrate themes in fields like Almost surely and Exponential function.

His biological study spans a wide range of topics, including Binary logarithm and Degree. His Random graph research integrates issues from Window and Linear number. His Linear number research incorporates elements of Tree, Random regular graph, Satisfiability and Cavity method.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

A critical point for random graphs with a given degree sequence

Michael Molloy;Bruce Reed.

Random Structures and Algorithms **(1995)**

2662 Citations

The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Michael Molloy;Bruce Reed.

Combinatorics, Probability & Computing **(1998)**

1011 Citations

Further algorithmic aspects of the local lemma

Michael Molloy;Bruce Reed.

symposium on the theory of computing **(1998)**

261 Citations

A bound on the chromatic number of the square of a planar graph

Michael Molloy;Mohammad R. Salavatipour.

Journal of Combinatorial Theory, Series B **(2005)**

222 Citations

A Bound on the Strong Chromatic Index of a Graph

Michael Molloy;Bruce Reed.

Journal of Combinatorial Theory, Series B **(1997)**

181 Citations

Random constraint satisfaction: a more accurate picture

Dimitris Achlioptas;Lefteris M. Kirousis;Evangelos Kranakis;Danny Krizanc.

principles and practice of constraint programming **(1997)**

164 Citations

Cores in random hypergraphs and Boolean formulas

Michael Molloy.

Random Structures and Algorithms **(2005)**

140 Citations

A Bound on the Total Chromatic Number

Michael Molloy;Bruce A. Reed.

Combinatorica **(1998)**

128 Citations

The analysis of a list-coloring algorithm on a random graph

D. Achlioptas;M. Molloy.

foundations of computer science **(1997)**

100 Citations

The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree

Michael Molloy.

SIAM Journal on Computing **(2004)**

89 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

McGill University

National and Kapodistrian University of Athens

Carnegie Mellon University

Tel Aviv University

Santa Fe Institute

Carleton University

University of Washington

Microsoft (United States)

Monash University

Microsoft (United States)

Centre national de la recherche scientifique, CNRS

Florida State University

Zhejiang University of Technology

University of Lorraine

Pacific Northwest National Laboratory

Nara Institute of Science and Technology

University of Granada

University of Münster

Northwestern University

Naval Postgraduate School

The Aerospace Corporation

Max Planck Society

Indiana University

Indiana University

University of Milan

University of Auckland

Something went wrong. Please try again later.