Michael Molloy

92 papers A* 13A 1B 3Journal 72Unranked 3

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