Concepedia

Michael Molloy

MM

54

Publications

5.4K

Citations

27

H-Index

1994

Active since

Affiliations

University of Toronto(Current)

Carnegie Mellon University

Sorbonne Université

Centre National de la Recherche Scientifique

Microsoft (United States)

Michael Molloy is an author at University of Toronto specializing in discrete mathematics, graph theory, and engineering.

Top concepts

Discrete MathematicsGraph TheoryEngineeringComputer ScienceCombinatorial OptimizationComputational ComplexityProbabilityMathematical ProgrammingAutomated ReasoningSatisfiability

Publications per year

1994–2018

54

Publications

54

A critical point for random graphs with a given degree sequence

Michael Molloy, Bruce Reed · Random Structures and Algorithms · 1995 · 2.3K citations

Graph Sparsity, Engineering, Network Analysis +16

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

Michael Molloy, Bruce Reed · Combinatorics Probability Computing · 1998 · 829 citations · Full text

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 · 193 citations

Geometric Graph Theory, Graph Theory, Algebraic Graph Theory +5

Further algorithmic aspects of the local lemma

Michael Molloy, Bruce Reed · 1998 · 188 citations

Mathematical Programming, Theory Of Computing, Computational Science +13

A Bound on the Strong Chromatic Index of a Graph

Michael Molloy, Bruce Reed · Journal of Combinatorial Theory Series B · 1997 · 172 citations

Graph Theory, Strong Chromatic Index, Structural Graph Theory +5

Rows per page

1–5 of 54