Molloy, Mike - Department of Computer Science, University of Toronto at Scarborough

• Sharp thresholds for constraint satisfaction problems and homomorphisms
• Broadcasting in Random Graphs. Alan Frieze Michael Molloy y
• A CRITICAL POINT FOR RANDOM GRAPHS WITH A GIVEN DEGREE
• A sharp threshold in proof complexity yields lower bounds for satisfiability search
• Chromatic Neighbourhood Sets Michael Molloy
• Colouring a Graph Frugally Hugh Hind y Michael Molloy z Bruce Reed x
• Colouring Graphs When the Number of Colours is Almost the Maximum Degree
• The satis ability threshold for randomly generated binary constraint satisfaction problems
• Cores in random hypergraphs and boolean formulas Michael Molloy
• Very rapidly mixing Markov Chains for 2 -colourings and for independent sets in a
• 1-factorisations of Random Regular Graphs M. S. O. Molloy
• NearOptimal List Colourings Michael Molloy \Lambda
• The Analysis of a List-Coloring Algorithm on a Random Graph (extended abstract)
• Random Constraint Satisfaction: A More Accurate Picture
• Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree
• A probabilistic analysis of randomly generated binary constraint satisfaction problems
• The Glauber dynamics on colourings of a graph with high girth and maximum degree
• Almost all graphs with 2:522n edges are not 3-colorable Dimitris Achlioptas
• On the edge-density of 4-critical graphs Mathematics Subject Classification (2000): 05C15
• The scaling window for a random graph with a given degree Hamed Hatami and Michael Molloy
• (k + 1)-cores have k-factors Siu On Chan
• A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
• The Glauber dynamics for colourings of bounded degree trees April 12, 2009
• The Resolution Complexity of Random Constraint Satisfaction Michael Molloy
• Further Algorithmic Aspects of the Local Lemma Michael Molloy
• The Glauber dynamics on colourings of a graph with high girth and maximum degree
• The pure literal rule threshold and cores in random hypergraphs.
• Exponential Bounds for DPLL Below the Satis ability Threshold Dimitris Achlioptas Paul Beame y Michael Molloy z
• Colouring graphs when the number of colours is nearly the maximum degree
• The Resolution Complexity of Random Constraint Satisfaction Problems Michael Molloy
• A Gap Between the Appearances of a k-core and a (k + 1)-chromatic Graph.
• THE DOMINATING NUMBER OF A RANDOM CUBIC GRAPH
• ( k)-critical graphs 1 Babak Farzad 2
• Models for random Constraint Satisfaction Michael Molloy
• An asymptotically tight bound on the adaptable chromatic number
• Sampling Grid Colourings with Fewer Colours Dimitris Achlioptas Mike Molloy y Cristopher Moore z Frank Van Bussel x
• Generating and counting Hamilton cycles in random regular graphs
• Splitting an expander graph Alan M. Frieze \Lambda Michael Molloy y
• A sharp threshold in proof complexity Dimitris Achlioptas
• On a Ramsey-type problem N. Alon P. Erd}os y D. S. Gunderson z M. Molloy x{
• A Bound on the Strong Chromatic Index Michael Molloy
• Isomorphism Certi cates for Undirected Michael Molloy and Laura Sedgwick 1
• Optimal DepthFirst Strategies for AndOr Trees Russell Greiner Ryan Hayward
• Asymptotically optimal frugal colouring Michael Molloy
• The Glauber dynamics for colourings of bounded degree trees August 1, 2010
• Analysis of edge deletion processes on faulty random regular graphs
• A bound on the chromatic number of the square of a planar graph Michael Molloy
• The Existence of Uniquely G Colourable Graphs D. Achlioptas J.I. Brown y D.G. Corneil M.S.O. Molloy
• THE SIZE OF THE GIANT COMPONENT OF A RANDOM GRAPH WITH A GIVEN
• Randomly Colouring Graphs with Girth Five and Large Maximum Degree
• Critical subgraphs of a random graph Michael Molloy
• Edge-Disjoint Cycles in Regular Directed Noga Alon Colin McDiarmid y Michael Molloy z
• The adaptable choosability number grows with the choosability number
• When does the giant component bring unsatis ability? Michael Molloy
• Analysis of Edge Deletion Processes on Faulty Random Regular Graphs
• Models and thresholds for random Constraint Satisfaction Problems. Michael Molloy
• Extremal problems for chromatic neighborhood sets
• Total Colouring With +poly(log ) Hugh Hind y Michael Molloy z Bruce Reed x
• A Bound on the Total Chromatic Number Michael Molloy \Lambda
• The satis ability threshold for randomly generated binary constraint satisfaction
• Perfect matchings in random r regular, s uniform hypergraphs.
• On the Mixing Rate of the Triangulation Walk \Lambda Michael S.O'B. Molloy
• Very rapid mixing of the Glauber dynamics for proper colourings on bounded-degree graphs
• Sets that are connected in two random graphs Michael Molloy
• Colouring Graphs When the Number of Colours is Almost the Maximum Degree
• Sets that are connected in two random graphs Michael Molloy
• The solution space geometry of random linear equations Dimitris Achlioptas
• The freezing threshold for k-colourings of a random graph Michael Molloy