Michael Molloy

Michael S. O. Molloy

2009
55	EE	Michael Molloy, Bruce A. Reed: Asymptotically optimal frugal colouring. SODA 2009: 106-114
2008
54	EE	Siu On Chan, Michael Molloy: A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. FOCS 2008: 634-643
53	EE	Hamed Hatami, Michael Molloy: Sharp thresholds for constraint satisfaction problems and homomorphisms. Random Struct. Algorithms 33(3): 310-332 (2008)
2007
52	EE	Michael Molloy, Mohammad R. Salavatipour: The Resolution Complexity of Random Constraint Satisfaction Problems. SIAM J. Comput. 37(3): 895-922 (2007)
2006
51	EE	Lap Chi Lau, Michael Molloy: Randomly Colouring Graphs with Girth Five and Large Maximum Degree. LATIN 2006: 665-676
50	EE	Russell Greiner, Ryan Hayward, Magdalena Jankowska, Michael Molloy: Finding optimal satisficing strategies for and-or trees. Artif. Intell. 170(1): 19-58 (2006)
49	EE	Alan M. Frieze, Michael Molloy: The satisfiability threshold for randomly generated binary constraint satisfaction problems. Random Struct. Algorithms 28(3): 323-339 (2006)
2005
48	EE	Babak Farzad, Michael S. O. Molloy, Bruce A. Reed: (Delta-k)-critical graphs. J. Comb. Theory, Ser. B 93(2): 173-185 (2005)
47	EE	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)
46	EE	Michael Molloy: Cores in random hypergraphs and Boolean formulas. Random Struct. Algorithms 27(1): 124-135 (2005)
2004
45	EE	Harold S. Connamacher, Michael Molloy: The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem. FOCS 2004: 590-599
44	EE	Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel: Sampling Grid Colorings with Fewer Colors. LATIN 2004: 80-89
43	EE	Dimitris Achlioptas, Paul Beame, Michael Molloy: Exponential bounds for DPLL below the satisfiability threshold. SODA 2004: 139-140
42	EE	Michael Molloy: The pure literal rule threshold and cores in random hypergraphs. SODA 2004: 672-681
41	EE	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)
40	EE	Michael Molloy: The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree. SIAM J. Comput. 33(3): 721-737 (2004)
2003
39	EE	Michael Molloy, Mohammad R. Salavatipour: The Resolution Complexity of Random Constraint Satisfaction Problems. FOCS 2003: 330-339
38	EE	Alan M. Frieze, Michael Molloy: The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems. RANDOM-APPROX 2003: 275-289
37	EE	Michael Molloy: Models for Random Constraint Satisfaction Problems. SIAM J. Comput. 32(4): 935-949 (2003)
36		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)
35	EE	Andreas Goerdt, Michael Molloy: Analysis of edge deletion processes on faulty random regular graphs. Theor. Comput. Sci. 297(1-3): 241-260 (2003)
2002
34		Russell Greiner, Ryan Hayward, Michael Molloy: Optimal Depth-First Strategies for And-Or Trees. AAAI/IAAI 2002: 725-730
33	EE	Michael Molloy, Mohammad R. Salavatipour: Frequency Channel Assignment on Planar Networks. ESA 2002: 736-747
32	EE	Michael Molloy: Models and thresholds for random constraint satisfaction problems. STOC 2002: 209-217
31	EE	Michael Molloy: The Glauber dynamics on colourings of a graph with high girth and maximum degree. STOC 2002: 91-98
30	EE	Michael Molloy, Laura Sedgwick: Isomorphism certificates for undirected graphs. Discrete Mathematics 256(1-2): 349-359 (2002)
29		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)
2001
28	EE	Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy: A sharp threshold in proof complexity. STOC 2001: 337-346
27	EE	Michael Molloy, Bruce A. Reed: Colouring graphs when the number of colours is nearly the maximum degree. STOC 2001: 462-470
26		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)
25		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)
2000
24		Andreas Goerdt, Michael Molloy: Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. LATIN 2000: 38-47
23	EE	Michael Molloy, Bruce A. Reed: k-Colouring when k is close to Delta. Electronic Notes in Discrete Mathematics 5: 235-238 (2000)
22		Michael Molloy, Bruce A. Reed: Near-optimal list colorings. Random Struct. Algorithms 17(3-4): 376-402 (2000)
1999
21	EE	Dimitris Achlioptas, Michael Molloy: Almost all graphs with 2.522 n edges are not 3-colorable. Electr. J. Comb. 6: (1999)
20	EE	Michael Molloy, Bruce A. Reed: Critical Subgraphs of a Random Graph. Electr. J. Comb. 6: (1999)
19		Alan M. Frieze, Michael Molloy: Splitting an Expander Graph. J. Algorithms 33(1): 166-172 (1999)
1998
18	EE	Michael Molloy, Bruce A. Reed: Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. LATIN 1998: 216-225
17	EE	Michael Molloy, Bruce A. Reed: Further Algorithmic Aspects of the Local Lemma. STOC 1998: 524-529
16	EE	Michael Molloy, Bruce A. Reed: A Bound on the Total Chromatic Number. Combinatorica 18(2): 241-280 (1998)
15		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)
14	EE	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)
13		Hugh Hind, Michael Molloy, Bruce A. Reed: Total Coloring With Delta + (log Delta) Colors. SIAM J. Comput. 28(3): 816-821 (1998)
1997
12		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
11	EE	Dimitris Achlioptas, Michael S. O. Molloy: The Analysis of a List-Coloring Algorithm on a Random Graph. FOCS 1997: 204-212
10		Hugh Hind, Michael Molloy, Bruce A. Reed: Colouring a Graph Frugally. Combinatorica 17(4): 469-482 (1997)
9	EE	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)
8		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)
1996
7		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)
6		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)
5		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
4		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)
3		Michael Molloy, Bruce A. Reed: The Dominating Number of Random Cubic Graph. Random Struct. Algorithms 7(3): 209-222 (1995)
1994
2		Colin Cooper, Alan M. Frieze, Michael Molloy: Hamilton Cycles in Random Regular Digraphs. Combinatorics, Probability & Computing 3: 39-49 (1994)
1	EE	Alan M. Frieze, Michael Molloy: Broadcasting in Random Graphs. Discrete Applied Mathematics 54(1): 77-79 (1994)

Coauthor Index

1	Dimitris Achlioptas	[11] [12] [14] [21] [26] [28] [41] [43] [44]
2	Paul Beame	[28] [41] [43]
3	Jason I. Brown	[14]
4	Frank Van Bussel	[44]
5	Siu On Chan	[54]
6	Harold S. Connamacher	[45]
7	Colin Cooper	[2] [7]
8	Derek G. Corneil	[14]
9	Martin E. Dyer	[29] [36]
10	Babak Farzad	[48]
11	Alan M. Frieze	[1] [2] [6] [7] [19] [36] [38] [49]
12	Andreas Goerdt	[24] [35]
13	Catherine S. Greenhill	[29]
14	Russell Greiner	[34] [50]
15	Hamed Hatami	[53]
16	Ryan B. Hayward (Ryan Hayward)	[34] [50]
17	Hugh Hind	[10] [13]
18	Magdalena Jankowska	[50]
19	Mark Jerrum	[6]
20	Lefteris M. Kirousis	[12] [26]
21	Evangelos Kranakis	[12] [26]
22	Danny Krizanc	[12] [26]
23	Lap Chi Lau	[51]
24	Cristopher Moore	[44]
25	Bruce A. Reed	[3] [4] [7] [9] [10] [13] [15] [16] [17] [18] [20] [22] [23] [27] [48] [55]
26	Hanna D. Robalewska	[8]
27	Robert W. Robinson	[6] [8]
28	Mohammad R. Salavatipour	[33] [39] [47] [52]
29	Laura Sedgwick	[30]
30	Yannis C. Stamatiou	[12] [26]
31	Nicholas C. Wormald	[6] [8]

Colors in the list of coauthors