Michael Molloy

Publication Activity (10 Years)

Years Active: 1994-2021
Publications (10 Years): 11

Top Topics

Forward Checking

Constraint Satisfaction

Linear Equations

Top Venues

Random Struct. Algorithms

J. Comb. Theory, Ser. B

J. Graph Theory

Publications

Jurgen Aliaj, Michael Molloy
Adaptable and conflict colouring multigraphs with no cycles of length three or four. CoRR (2021)
Dieter Mitsche, Michael Molloy, Pawel Pralat
-core threshold of a random graph. J. Comb. Theory, Ser. B 142 (2020)
Michael Molloy
The list chromatic number of graphs with small clique number. J. Comb. Theory, Ser. B 134 (2019)
Michael Molloy
-Colourings of a Random Graph. J. ACM 65 (2) (2018)
Pu Gao, Michael Molloy
The stripping process can be slow: Part I. Random Struct. Algorithms 53 (1) (2018)
Pu Gao, Michael Molloy
Inside the clustering window for random linear equations. Random Struct. Algorithms 52 (2) (2018)
Michael Molloy
A Note on the Rainbow Connection of Random Regular Graphs. Electron. J. Comb. 24 (3) (2017)
Michael Molloy
The Adaptable Chromatic Number and the Chromatic Number. J. Graph Theory 84 (1) (2017)
Babak Farzad, Arnoosh Golestanian, Michael Molloy
Backbone colourings of graphs. Discret. Math. 339 (11) (2016)
Dimitris Achlioptas, Michael Molloy
The solution space geometry of random linear equations. Random Struct. Algorithms 46 (2) (2015)
Pu Gao, Michael Molloy
Inside the clustering window for random linear equations. CoRR (2015)
Michael Molloy, Bruce A. Reed
Colouring graphs when the number of colours is almost the maximum degree. J. Comb. Theory, Ser. B 109 (2014)
Michael Molloy
Sets that are connected in two random graphs. Random Struct. Algorithms 45 (3) (2014)
Pu Gao, Michael Molloy
Inside the clustering threshold for random linear equations. CoRR (2013)
Michael Molloy, Ricardo Restrepo
Frozen variables in random boolean constraint satisfaction problems. SODA (2013)
Milan Bradonjic, Michael Molloy, Guanhua Yan
Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments. Internet Math. 9 (4) (2013)
Siu On Chan, Michael Molloy
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. SIAM J. Comput. 42 (1) (2013)
Milan Bradonjic, Michael Molloy, Guanhua Yan
Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments. CoRR (2013)
Harold S. Connamacher, Michael Molloy
The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem. SIAM J. Discret. Math. 26 (2) (2012)
Michael Molloy, Giovanna Thron
An asymptotically tight bound on the adaptable chromatic number. J. Graph Theory 71 (3) (2012)
Siu On Chan, Michael Molloy
-Factors. Comb. Probab. Comput. 21 (6) (2012)
Michael Molloy, Ricardo Restrepo
Frozen variables in random boolean constraint satisfaction problems CoRR (2012)
Harold S. Connamacher, Michael Molloy
The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem CoRR (2012)
Michael Molloy
The freezing threshold for k-colourings of a random graph. STOC (2012)
Hamed Hatami, Michael Molloy
The scaling window for a random graph with a given degree sequence. Random Struct. Algorithms 41 (1) (2012)
Brendan Lucier, Michael Molloy
The Glauber Dynamics for Colorings of Bounded Degree Trees. SIAM J. Discret. Math. 25 (2) (2011)
Michael Molloy, Giovanna Thron
The adaptable choosability number grows with the choosability number. Discret. Math. 311 (20) (2011)
Dimitris Achlioptas, Michael Molloy
The solution space geometry of random linear equations CoRR (2011)
Michael Molloy, Bruce A. Reed
Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246]. J. Comb. Theory, Ser. B 100 (2) (2010)
Michael Molloy, Bruce A. Reed
Asymptotically optimal frugal colouring. J. Comb. Theory, Ser. B 100 (2) (2010)
Hamed Hatami, Michael Molloy
The Scaling Window for a Random Graph with a Given Degree Sequence. SODA (2010)
Brendan Lucier, Michael Molloy, Yuval Peres
The Glauber Dynamics for Colourings of Bounded Degree Trees. APPROX-RANDOM (2009)
Babak Farzad, Michael Molloy
On the edge-density of 4-critical graphs. Comb. 29 (6) (2009)
Michael Molloy, Bruce A. Reed
Asymptotically optimal frugal colouring. SODA (2009)
Michael Molloy
When does the giant component bring unsatisfiability? Comb. 28 (6) (2008)
Siu On Chan, Michael Molloy
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. FOCS (2008)
Hamed Hatami, Michael Molloy
Sharp thresholds for constraint satisfaction problems and homomorphisms. Random Struct. Algorithms 33 (3) (2008)
Michael Molloy, Mohammad R. Salavatipour
The Resolution Complexity of Random Constraint Satisfaction Problems. SIAM J. Comput. 37 (3) (2007)
Alan M. Frieze, Michael Molloy
The satisfiability threshold for randomly generated binary constraint satisfaction problems. Random Struct. Algorithms 28 (3) (2006)
Lap Chi Lau, Michael Molloy
Randomly Colouring Graphs with Girth Five and Large Maximum Degree. LATIN (2006)
Russell Greiner, Ryan Hayward, Magdalena Jankowska, Michael Molloy
Finding optimal satisficing strategies for and-or trees. Artif. Intell. 170 (1) (2006)
Michael Molloy
Cores in random hypergraphs and Boolean formulas. Random Struct. Algorithms 27 (1) (2005)
Michael Molloy, Mohammad R. Salavatipour
A bound on the chromatic number of the square of a planar graph. J. Comb. Theory, Ser. B 94 (2) (2005)
Dimitris Achlioptas, Paul Beame, Michael Molloy
Exponential bounds for DPLL below the satisfiability threshold. SODA (2004)
Michael Molloy
The pure literal rule threshold and cores in random hypergraphs. SODA (2004)
Harold S. Connamacher, Michael Molloy
The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem. FOCS (2004)
Michael Molloy
The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree. SIAM J. Comput. 33 (3) (2004)
Michael Molloy, Mohammad R. Salavatipour
The Resolution Complexity of Random Constraint Satisfaction Problems. FOCS (2003)
Michael Molloy
Models for Random Constraint Satisfaction Problems. SIAM J. Comput. 32 (4) (2003)
Andreas Goerdt, Michael Molloy
Analysis of edge deletion processes on faulty random regular graphs. Theor. Comput. Sci. 297 (1-3) (2003)
Alan M. Frieze, Michael Molloy
The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems. RANDOM-APPROX (2003)
Martin E. Dyer, Alan M. Frieze, Michael Molloy
A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theor. Comput. Sci. 290 (3) (2003)
Russell Greiner, Ryan Hayward, Michael Molloy
Optimal Depth-First Strategies for And-Or Trees. AAAI/IAAI (2002)
Martin E. Dyer, Catherine S. Greenhill, Michael Molloy
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. Random Struct. Algorithms 20 (1) (2002)
Michael Molloy, Laura Sedgwick
Isomorphism certificates for undirected graphs. Discret. Math. 256 (1-2) (2002)
Michael Molloy
The Glauber dynamics on colourings of a graph with high girth and maximum degree. STOC (2002)
André Kündgen, Michael Molloy
Extremal problems for chromatic neighborhood sets. J. Graph Theory 40 (1) (2002)
Noga Alon, Paul Erdös, David S. Gunderson, Michael Molloy
A Ramsey-type problem and the Turán numbers. J. Graph Theory 40 (2) (2002)
Michael Molloy
Models and thresholds for random constraint satisfaction problems. STOC (2002)
Michael Molloy, Mohammad R. Salavatipour
Frequency Channel Assignment on Planar Networks. ESA (2002)
Michael Molloy, Bruce A. Reed
Colouring graphs when the number of colours is nearly the maximum degree. STOC (2001)
Michael Molloy
Very rapidly mixing Markov chains for 2-colorings and for independent sets in a graph with maximum degree 4. Random Struct. Algorithms 18 (2) (2001)
Michael Molloy, Bruce A. Reed
k-Colouring when k is close to Delta. Electron. Notes Discret. Math. 5 (2000)
Michael Molloy, Bruce A. Reed
Near-optimal list colorings. Random Struct. Algorithms 17 (3-4) (2000)
Andreas Goerdt, Michael Molloy
Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. LATIN (2000)
Alan M. Frieze, Michael Molloy
Splitting an Expander Graph. J. Algorithms 33 (1) (1999)
Michael Molloy, Bruce A. Reed
Critical Subgraphs of a Random Graph. Electron. J. Comb. 6 (1999)
Michael Molloy
Chromatic neighborhood sets. J. Graph Theory 31 (4) (1999)
Dimitris Achlioptas, Michael Molloy
Almost all graphs with 2.522 n edges are not 3-colorable. Electron. J. Comb. 6 (1999)
Michael Molloy, Bruce A. Reed
A Bound on the Total Chromatic Number. Comb. 18 (2) (1998)
Michael Molloy, Bruce A. Reed
Further Algorithmic Aspects of the Local Lemma. STOC (1998)
Michael Molloy, Bruce A. Reed
Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. LATIN (1998)
Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael Molloy
The existence of uniquely -G colourable graphs. Discret. Math. 179 (1-3) (1998)
Michael Molloy, Bruce A. Reed
The Size of the Giant Component of a Random Graph with a Given Degree Sequence. Comb. Probab. Comput. 7 (3) (1998)
Hugh Hind, Michael Molloy, Bruce A. Reed
Total Coloring With Delta + (log Delta) Colors. SIAM J. Comput. 28 (3) (1998)
Michael Molloy, Bruce A. Reed
. J. Comb. Theory, Ser. B 69 (2) (1997)
Hugh Hind, Michael Molloy, Bruce A. Reed
Colouring a Graph Frugally. Comb. 17 (4) (1997)
Michael Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald
1-Factorizations of random regular graphs. Random Struct. Algorithms 10 (3) (1997)
Noga Alon, Colin McDiarmid, Michael Molloy
Edge-disjoint cycles in regular directed graphs. J. Graph Theory 22 (3) (1996)
Michael Molloy
A gap between the appearances of a k-core and a (k+1)-chromatic graph. Random Struct. Algorithms 8 (2) (1996)
Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed
Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Comb. Probab. Comput. 5 (1996)
Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald
Generating and Counting Hamilton Cycles in Random Regular Graphs. J. Algorithms 21 (1) (1996)
Michael Molloy, Bruce A. Reed
The Dominating Number of Random Cubic Graph. Random Struct. Algorithms 7 (3) (1995)
Michael Molloy, Bruce A. Reed
A Critical Point for Random Graphs with a Given Degree Sequence. Random Struct. Algorithms 6 (2/3) (1995)
Colin Cooper, Alan M. Frieze, Michael Molloy
Hamilton Cycles in Random Regular Digraphs. Comb. Probab. Comput. 3 (1994)
Alan M. Frieze, Michael Molloy
Broadcasting in Random Graphs. Discret. Appl. Math. 54 (1) (1994)