| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Harold S. Connamacher, Michael Molloy |
The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Michael Molloy |
The freezing threshold for k-colourings of a random graph. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Giovanna Thron |
The adaptable choosability number grows with the choosability number. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Michael Molloy |
The solution space geometry of random linear equations |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Brendan Lucier, Michael Molloy |
The Glauber Dynamics for Colorings of Bounded Degree Trees. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
Asymptotically optimal frugal colouring. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce Reed |
Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246]. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hamed Hatami, Michael Molloy |
The Scaling Window for a Random Graph with a Given Degree Sequence. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Babak Farzad, Michael Molloy |
On the edge-density of 4-critical graphs. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
Asymptotically optimal frugal colouring. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan Lucier, Michael Molloy, Yuval Peres |
The Glauber Dynamics for Colourings of Bounded Degree Trees. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hamed Hatami, Michael Molloy |
Sharp thresholds for constraint satisfaction problems and homomorphisms. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy |
When does the giant component bring unsatisfiability? |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Siu On Chan, Michael Molloy |
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Mohammad R. Salavatipour |
The Resolution Complexity of Random Constraint Satisfaction Problems. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Molloy |
The satisfiability threshold for randomly generated binary constraint satisfaction problems. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Greiner, Ryan Hayward, Magdalena Jankowska, Michael Molloy |
Finding optimal satisficing strategies for and-or trees. |
Artif. Intell. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lap Chi Lau, Michael Molloy |
Randomly Colouring Graphs with Girth Five and Large Maximum Degree. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Mohammad R. Salavatipour |
A bound on the chromatic number of the square of a planar graph. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy |
Cores in random hypergraphs and Boolean formulas. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Babak Farzad, Michael S. O. Molloy, Bruce A. Reed |
(Delta-k)-critical graphs. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy |
The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy |
The pure literal rule threshold and cores in random hypergraphs. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Paul Beame, Michael Molloy |
Exponential bounds for DPLL below the satisfiability threshold. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Harold S. Connamacher, Michael Molloy |
The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy |
A sharp threshold in proof complexity yields lower bounds for satisfiability search. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel |
Sampling Grid Colorings with Fewer Colors. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Goerdt, Michael Molloy |
Analysis of edge deletion processes on faulty random regular graphs. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze, Michael Molloy |
A probabilistic analysis of randomly generated binary constraint satisfaction problems. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy |
Models for Random Constraint Satisfaction Problems. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Molloy |
The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Mohammad R. Salavatipour |
The Resolution Complexity of Random Constraint Satisfaction Problems. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Laura Sedgwick |
Isomorphism certificates for undirected graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Mohammad R. Salavatipour |
Frequency Channel Assignment on Planar Networks. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy |
The Glauber dynamics on colourings of a graph with high girth and maximum degree. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
rapidly mixing, Markov chain |
| 1 | Michael Molloy |
Models and thresholds for random constraint satisfaction problems. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
sharp thresholds |
| 1 | Russell Greiner, Ryan Hayward, Michael Molloy |
Optimal Depth-First Strategies for And-Or Trees. |
AAAI/IAAI |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael Molloy |
Very rapidly mixing Markov chains for 2-colorings and for independent sets in a graph with maximum degree 4. |
Random Struct. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
Colouring graphs when the number of colours is nearly the maximum degree. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
graph colouring, probabilistic methods |
| 1 | Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, Danny Krizanc |
Random Constraint Satisfaction: A More Accurate Picture. |
Constraints |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy |
A sharp threshold in proof complexity. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
k-Colouring when k is close to Delta. |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
Near-optimal list colorings. |
Random Struct. Algorithms |
2000 |
DBLP BibTeX RDF |
|
| 1 | Andreas Goerdt, Michael Molloy |
Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. |
LATIN |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
Critical Subgraphs of a Random Graph. |
Electr. J. Comb. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Michael Molloy |
Almost all graphs with 2.522 n edges are not 3-colorable. |
Electr. J. Comb. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Molloy |
Splitting an Expander Graph. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
The Size of the Giant Component of a Random Graph with a Given Degree Sequence. |
Combinatorics, Probability & Computing |
1998 |
DBLP BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
A Bound on the Total Chromatic Number. |
Combinatorica |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C15 |
| 1 | Hugh Hind, Michael Molloy, Bruce A. Reed |
Total Coloring With Delta + (log Delta) Colors. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. |
LATIN |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
Further Algorithmic Aspects of the Local Lemma. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy |
The existence of uniquely -G colourable graphs. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hugh Hind, Michael Molloy, Bruce A. Reed |
Colouring a Graph Frugally. |
Combinatorica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael S. O. Molloy, Bruce A. Reed |
A Bound on the Strong Chromatic Index of a Graph, . |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael S. O. Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald |
1-Factorizations of random regular graphs. |
Random Struct. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Michael S. O. Molloy |
The Analysis of a List-Coloring Algorithm on a Random Graph. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
list-coloring algorithm, k-coloring algorithm, tight asymptotic analysis, performance, Markov chains, random graph, differential equations, graph colouring |
| 1 | Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou |
Random Constraint Satisfaction: A More Accurate Picture. |
CP |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy |
A gap between the appearances of a k-core and a (k+1)-chromatic graph. |
Random Struct. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed |
Perfect Matchings in Random r-regular, s-uniform Hypergraphs. |
Combinatorics, Probability & Computing |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald |
Generating and Counting Hamilton Cycles in Random Regular Graphs. |
J. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
A Critical Point for Random Graphs with a Given Degree Sequence. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
The Dominating Number of Random Cubic Graph. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Alan M. Frieze, Michael Molloy |
Hamilton Cycles in Random Regular Digraphs. |
Combinatorics, Probability & Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Molloy |
Broadcasting in Random Graphs. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")