Michael Molloy

Michael S. O. Molloy

	2013
j50		Siu On Chan, Michael Molloy: A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. SIAM J. Comput. 42(1): 27-60 (2013)
c24		Michael Molloy, Ricardo Restrepo: Frozen variables in random boolean constraint satisfaction problems. SODA 2013: 1306-1318
	2012
j49		Siu On Chan, Michael Molloy: (k+1)-Cores Have k-Factors. Combinatorics, Probability & Computing 21(6): 882-896 (2012)
j48		Michael Molloy, Giovanna Thron: An asymptotically tight bound on the adaptable chromatic number. Journal of Graph Theory 71(3): 331-351 (2012)
j47		Hamed Hatami, Michael Molloy: The scaling window for a random graph with a given degree sequence. Random Struct. Algorithms 41(1): 99-123 (2012)
j46		Harold S. Connamacher, Michael Molloy: The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem. SIAM J. Discrete Math. 26(2): 768-800 (2012)
c23		Michael Molloy: The freezing threshold for k-colourings of a random graph. STOC 2012: 921-930
i3		Harold S. Connamacher, Michael Molloy: The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem. CoRR abs/1202.0042 (2012)
i2		Michael Molloy, Ricardo Restrepo: Frozen variables in random boolean constraint satisfaction problems. CoRR abs/1209.4829 (2012)
	2011
j45		Michael Molloy, Giovanna Thron: The adaptable choosability number grows with the choosability number. Discrete Mathematics 311(20): 2268-2271 (2011)
j44		Brendan Lucier, Michael Molloy: The Glauber Dynamics for Colorings of Bounded Degree Trees. SIAM J. Discrete Math. 25(2): 827-853 (2011)
i1		Dimitris Achlioptas, Michael Molloy: The solution space geometry of random linear equations. CoRR abs/1107.5550 (2011)
	2010
j43		Michael Molloy, Bruce A. Reed: Asymptotically optimal frugal colouring. J. Comb. Theory, Ser. B 100(2): 226-246 (2010)
j42		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 100(2): 247-249 (2010)
c22		Hamed Hatami, Michael Molloy: The Scaling Window for a Random Graph with a Given Degree Sequence. SODA 2010: 1403-1411
	2009
j41		Babak Farzad, Michael Molloy: On the edge-density of 4-critical graphs. Combinatorica 29(6): 665-689 (2009)
c21		Brendan Lucier, Michael Molloy, Yuval Peres: The Glauber Dynamics for Colourings of Bounded Degree Trees. APPROX-RANDOM 2009: 631-645
c20		Michael Molloy, Bruce A. Reed: Asymptotically optimal frugal colouring. SODA 2009: 106-114
	2008
j40		Michael Molloy: When does the giant component bring unsatisfiability? Combinatorica 28(6): 693-734 (2008)
j39		Hamed Hatami, Michael Molloy: Sharp thresholds for constraint satisfaction problems and homomorphisms. Random Struct. Algorithms 33(3): 310-332 (2008)
c19		Siu On Chan, Michael Molloy: A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. FOCS 2008: 634-643
	2007
j38		Michael Molloy, Mohammad R. Salavatipour: The Resolution Complexity of Random Constraint Satisfaction Problems. SIAM J. Comput. 37(3): 895-922 (2007)
	2006
j37		Russell Greiner, Ryan Hayward, Magdalena Jankowska, Michael Molloy: Finding optimal satisficing strategies for and-or trees. Artif. Intell. 170(1): 19-58 (2006)
j36		Alan M. Frieze, Michael Molloy: The satisfiability threshold for randomly generated binary constraint satisfaction problems. Random Struct. Algorithms 28(3): 323-339 (2006)
c18		Lap Chi Lau, Michael Molloy: Randomly Colouring Graphs with Girth Five and Large Maximum Degree. LATIN 2006: 665-676
	2005
j35		Babak Farzad, Michael S. O. Molloy, Bruce A. Reed: (Delta-k)-critical graphs. J. Comb. Theory, Ser. B 93(2): 173-185 (2005)
j34		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): 189-213 (2005)
j33		Michael Molloy: Cores in random hypergraphs and Boolean formulas. Random Struct. Algorithms 27(1): 124-135 (2005)
	2004
j32		Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy: A sharp threshold in proof complexity yields lower bounds for satisfiability search. J. Comput. Syst. Sci. 68(2): 238-268 (2004)
j31		Michael Molloy: The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree. SIAM J. Comput. 33(3): 721-737 (2004)
c17		Harold S. Connamacher, Michael Molloy: The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem. FOCS 2004: 590-599
c16		Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel: Sampling Grid Colorings with Fewer Colors. LATIN 2004: 80-89
c15		Dimitris Achlioptas, Paul Beame, Michael Molloy: Exponential bounds for DPLL below the satisfiability threshold. SODA 2004: 139-140
c14		Michael Molloy: The pure literal rule threshold and cores in random hypergraphs. SODA 2004: 672-681
	2003
j30		Michael Molloy: Models for Random Constraint Satisfaction Problems. SIAM J. Comput. 32(4): 935-949 (2003)
j29		Martin E. Dyer, Alan M. Frieze, Michael Molloy: A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theor. Comput. Sci. 290(3): 1815-1828 (2003)
j28		Andreas Goerdt, Michael Molloy: Analysis of edge deletion processes on faulty random regular graphs. Theor. Comput. Sci. 297(1-3): 241-260 (2003)
c13		Michael Molloy, Mohammad R. Salavatipour: The Resolution Complexity of Random Constraint Satisfaction Problems. FOCS 2003: 330-339
c12		Alan M. Frieze, Michael Molloy: The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems. RANDOM-APPROX 2003: 275-289
	2002
j27		Michael Molloy, Laura Sedgwick: Isomorphism certificates for undirected graphs. Discrete Mathematics 256(1-2): 349-359 (2002)
j26		André Kündgen, Michael Molloy: Extremal problems for chromatic neighborhood sets. Journal of Graph Theory 40(1): 68-74 (2002)
j25		Noga Alon, Paul Erdös, David S. Gunderson, Michael Molloy: A Ramsey-type problem and the Turán numbers. Journal of Graph Theory 40(2): 120-129 (2002)
j24		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): 98-114 (2002)
c11		Russell Greiner, Ryan Hayward, Michael Molloy: Optimal Depth-First Strategies for And-Or Trees. AAAI/IAAI 2002: 725-730
c10		Michael Molloy, Mohammad R. Salavatipour: Frequency Channel Assignment on Planar Networks. ESA 2002: 736-747
c9		Michael Molloy: The Glauber dynamics on colourings of a graph with high girth and maximum degree. STOC 2002: 91-98
c8		Michael Molloy: Models and thresholds for random constraint satisfaction problems. STOC 2002: 209-217
	2001
j23		Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, Danny Krizanc: Random Constraint Satisfaction: A More Accurate Picture. Constraints 6(4): 329-344 (2001)
j22		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): 101-115 (2001)
c7		Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy: A sharp threshold in proof complexity. STOC 2001: 337-346
c6		Michael Molloy, Bruce A. Reed: Colouring graphs when the number of colours is nearly the maximum degree. STOC 2001: 462-470
	2000
j21		Michael Molloy, Bruce A. Reed: k-Colouring when k is close to Delta. Electronic Notes in Discrete Mathematics 5: 235-238 (2000)
j20		Michael Molloy, Bruce A. Reed: Near-optimal list colorings. Random Struct. Algorithms 17(3-4): 376-402 (2000)
c5		Andreas Goerdt, Michael Molloy: Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. LATIN 2000: 38-47
	1999
j19		Dimitris Achlioptas, Michael Molloy: Almost all graphs with 2.522 n edges are not 3-colorable. Electr. J. Comb. 6 (1999)
j18		Michael Molloy, Bruce A. Reed: Critical Subgraphs of a Random Graph. Electr. J. Comb. 6 (1999)
j17		Alan M. Frieze, Michael Molloy: Splitting an Expander Graph. J. Algorithms 33(1): 166-172 (1999)
j16		Michael Molloy: Chromatic neighborhood sets. Journal of Graph Theory 31(4): 303-311 (1999)
	1998
j15		Michael Molloy, Bruce A. Reed: A Bound on the Total Chromatic Number. Combinatorica 18(2): 241-280 (1998)
j14		Michael Molloy, Bruce A. Reed: The Size of the Giant Component of a Random Graph with a Given Degree Sequence. Combinatorics, Probability & Computing 7(3): 295-305 (1998)
j13		Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy: The existence of uniquely -G colourable graphs. Discrete Mathematics 179(1-3): 1-11 (1998)
j12		Hugh Hind, Michael Molloy, Bruce A. Reed: Total Coloring With Delta + (log Delta) Colors. SIAM J. Comput. 28(3): 816-821 (1998)
c4		Michael Molloy, Bruce A. Reed: Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. LATIN 1998: 216-225
c3		Michael Molloy, Bruce A. Reed: Further Algorithmic Aspects of the Local Lemma. STOC 1998: 524-529
	1997
j11		Hugh Hind, Michael Molloy, Bruce A. Reed: Colouring a Graph Frugally. Combinatorica 17(4): 469-482 (1997)
j10		Michael S. O. Molloy, Bruce A. Reed: A Bound on the Strong Chromatic Index of a Graph, . J. Comb. Theory, Ser. B 69(2): 103-109 (1997)
j9		Michael S. O. Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald: 1-Factorizations of random regular graphs. Random Struct. Algorithms 10(3): 305-321 (1997)
c2		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: 107-120
c1		Dimitris Achlioptas, Michael S. O. Molloy: The Analysis of a List-Coloring Algorithm on a Random Graph. FOCS 1997: 204-212
	1996
j8		Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed: Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Combinatorics, Probability & Computing 5: 1-14 (1996)
j7		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): 176-198 (1996)
j6		Noga Alon, Colin McDiarmid, Michael Molloy: Edge-disjoint cycles in regular directed graphs. Journal of Graph Theory 22(3): 231-237 (1996)
j5		Michael Molloy: A gap between the appearances of a k-core and a (k+1)-chromatic graph. Random Struct. Algorithms 8(2): 159-160 (1996)
	1995
j4		Michael Molloy, Bruce A. Reed: A Critical Point for Random Graphs with a Given Degree Sequence. Random Struct. Algorithms 6(2/3): 161-180 (1995)
j3		Michael Molloy, Bruce A. Reed: The Dominating Number of Random Cubic Graph. Random Struct. Algorithms 7(3): 209-222 (1995)
	1994
j2		Colin Cooper, Alan M. Frieze, Michael Molloy: Hamilton Cycles in Random Regular Digraphs. Combinatorics, Probability & Computing 3: 39-49 (1994)
j1		Alan M. Frieze, Michael Molloy: Broadcasting in Random Graphs. Discrete Applied Mathematics 54(1): 77-79 (1994)

Coauthor Index

Last update Fri May 24 01:59:19 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page