default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Molloy 0001
Michael S. O. Molloy – Mike Molloy 0001
Person information
- affiliation: University of Toronto, Canada
Other persons with the same name
- Mike Molloy 0002 — Microsoft Research, Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j67]Adam Logan, Michael Molloy
, Pawel Pralat:
A variant of the Erdős-Rényi random graph process. J. Graph Theory 102(2): 322-345 (2023)- [j66]Jurgen Aliaj, Michael Molloy:
Adaptable and conflict colouring multigraphs with no cycles of length three or four. J. Graph Theory 104(1): 188-219 (2023) - 2022
- [j65]John Gimbel, André Kündgen, Michael Molloy:
Fractional Cocoloring of Graphs. Graphs Comb. 38(3): 64 (2022) - [j64]Michael Molloy, Luke Postle:
Asymptotically good edge correspondence colourings. J. Graph Theory 100(3): 559-577 (2022) - [i9]Michael Molloy, Erlang Surya, Lutz Warnke:
The degree-restricted random process is far from uniform. CoRR abs/2211.00835 (2022) - 2021
- [i8]Jurgen Aliaj, Michael Molloy:
Adaptable and conflict colouring multigraphs with no cycles of length three or four. CoRR abs/2107.04253 (2021) - 2020
- [j63]Dieter Mitsche, Michael Molloy, Pawel Pralat:
k-regular subgraphs near the k-core threshold of a random graph. J. Comb. Theory B 142: 106-143 (2020)
2010 – 2019
- 2019
- [j62]Michael Molloy:
The list chromatic number of graphs with small clique number. J. Comb. Theory B 134: 264-284 (2019) - 2018
- [j61]Michael Molloy:
The Freezing Threshold for k-Colourings of a Random Graph. J. ACM 65(2): 7:1-7:62 (2018) - [j60]Pu Gao, Michael Molloy:
Inside the clustering window for random linear equations. Random Struct. Algorithms 52(2): 197-218 (2018) - [j59]Pu Gao, Michael Molloy:
The stripping process can be slow: Part I. Random Struct. Algorithms 53(1): 76-139 (2018) - 2017
- [j58]Michael Molloy:
A Note on the Rainbow Connection of Random Regular Graphs. Electron. J. Comb. 24(3): 3 (2017) - [j57]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. Inf. Comput. 255: 165-176 (2017) - [j56]Michael Molloy:
The Adaptable Chromatic Number and the Chromatic Number. J. Graph Theory 84(1): 53-56 (2017) - 2016
- [j55]Babak Farzad, Arnoosh Golestanian, Michael Molloy:
Backbone colourings of graphs. Discret. Math. 339(11): 2721-2722 (2016) - 2015
- [j54]Dimitris Achlioptas, Michael Molloy:
The solution space geometry of random linear equations. Random Struct. Algorithms 46(2): 197-231 (2015) - [i7]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. CoRR abs/1503.01613 (2015) - [i6]Pu Gao, Michael Molloy:
Inside the clustering window for random linear equations. CoRR abs/1512.06657 (2015) - 2014
- [j53]Michael Molloy, Bruce A. Reed:
Colouring graphs when the number of colours is almost the maximum degree. J. Comb. Theory B 109: 134-195 (2014) - [j52]Michael Molloy:
Sets that are connected in two random graphs. Random Struct. Algorithms 45(3): 498-512 (2014) - 2013
- [j51]Milan Bradonjic, Michael Molloy, Guanhua Yan:
Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments. Internet Math. 9(4): 406-433 (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) - [c25]Michael Molloy, Ricardo Restrepo:
Frozen variables in random boolean constraint satisfaction problems. SODA 2013: 1306-1318 - [i5]Pu Gao, Michael Molloy:
Inside the clustering threshold for random linear equations. CoRR abs/1309.6651 (2013) - [i4]Milan Bradonjic, Michael Molloy, Guanhua Yan:
Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments. CoRR abs/1310.1942 (2013) - 2012
- [j49]Siu On Chan, Michael Molloy:
(k+1)-Cores Have k-Factors. Comb. Probab. Comput. 21(6): 882-896 (2012) - [j48]Michael Molloy, Giovanna Thron:
An asymptotically tight bound on the adaptable chromatic number. J. 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. Discret. Math. 26(2): 768-800 (2012) - [c24]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. Discret. Math. 311(20): 2268-2271 (2011) - [j44]Brendan Lucier, Michael Molloy:
The Glauber Dynamics for Colorings of Bounded Degree Trees. SIAM J. Discret. 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 B 100(2): 226-246 (2010) - [j42]Michael Molloy, Bruce A. Reed:
Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246]. J. Comb. Theory B 100(2): 247-249 (2010) - [c23]Hamed Hatami, Michael Molloy:
The Scaling Window for a Random Graph with a Given Degree Sequence. SODA 2010: 1403-1411
2000 – 2009
- 2009
- [j41]Babak Farzad, Michael Molloy:
On the edge-density of 4-critical graphs. Comb. 29(6): 665-689 (2009) - [c22]Brendan Lucier, Michael Molloy, Yuval Peres:
The Glauber Dynamics for Colourings of Bounded Degree Trees. APPROX-RANDOM 2009: 631-645 - [c21]Michael Molloy, Bruce A. Reed:
Asymptotically optimal frugal colouring. SODA 2009: 106-114 - 2008
- [j40]Michael Molloy:
When does the giant component bring unsatisfiability? Comb. 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) - [c20]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) - [c19]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 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 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) - [c18]Harold S. Connamacher, Michael Molloy:
The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem. FOCS 2004: 590-599 - [c17]Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel:
Sampling Grid Colorings with Fewer Colors. LATIN 2004: 80-89 - [c16]Dimitris Achlioptas, Paul Beame, Michael Molloy:
Exponential bounds for DPLL below the satisfiability threshold. SODA 2004: 139-140 - [c15]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) - [c14]Michael Molloy, Mohammad R. Salavatipour:
The Resolution Complexity of Random Constraint Satisfaction Problems. FOCS 2003: 330-339 - [c13]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. Discret. Math. 256(1-2): 349-359 (2002) - [j26]André Kündgen, Michael Molloy:
Extremal problems for chromatic neighborhood sets. J. 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. J. 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) - [c12]Russell Greiner, Ryan Hayward, Michael Molloy:
Optimal Depth-First Strategies for And-Or Trees. AAAI/IAAI 2002: 725-730 - [c11]Michael Molloy, Mohammad R. Salavatipour:
Frequency Channel Assignment on Planar Networks. ESA 2002: 736-747 - [c10]Michael Molloy:
The Glauber dynamics on colourings of a graph with high girth and maximum degree. STOC 2002: 91-98 - [c9]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 An Int. J. 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) - [c8]Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy:
A sharp threshold in proof complexity. STOC 2001: 337-346 - [c7]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. Electron. Notes Discret. Math. 5: 235-238 (2000) - [j20]Michael Molloy, Bruce A. Reed:
Near-optimal list colorings. Random Struct. Algorithms 17(3-4): 376-402 (2000) - [c6]Andreas Goerdt, Michael Molloy:
Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. LATIN 2000: 38-47
1990 – 1999
- 1999
- [j19]Dimitris Achlioptas, Michael Molloy:
Almost all graphs with 2.522 n edges are not 3-colorable. Electron. J. Comb. 6 (1999) - [j18]Michael Molloy, Bruce A. Reed:
Critical Subgraphs of a Random Graph. Electron. 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. J. Graph Theory 31(4): 303-311 (1999) - 1998
- [j15]Michael Molloy, Bruce A. Reed:
A Bound on the Total Chromatic Number. Comb. 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. Comb. Probab. Comput. 7(3): 295-305 (1998) - [j13]Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael Molloy:
The existence of uniquely -G colourable graphs. Discret. Math. 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) - [c5]Michael Molloy, Bruce A. Reed:
Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. LATIN 1998: 216-225 - [c4]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. Comb. 17(4): 469-482 (1997) - [j10]Michael Molloy, Bruce A. Reed:
A Bound on the Strong Chromatic Index of a Graph, . J. Comb. Theory B 69(2): 103-109 (1997) - [j9]Michael Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald:
1-Factorizations of random regular graphs. Random Struct. Algorithms 10(3): 305-321 (1997) - [c3]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 - [c2]Michael S. O. Molloy, Bruce A. Reed, William Steiger:
On the mixing rate of the triangulation walk. Randomization Methods in Algorithm Design 1997: 179-190 - [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. Comb. Probab. Comput. 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. J. 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. Comb. Probab. Comput. 3: 39-49 (1994) - [j1]Alan M. Frieze, Michael Molloy:
Broadcasting in Random Graphs. Discret. Appl. Math. 54(1): 77-79 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
