default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Michael Molloy 0001
aka: Michael S. O. Molloy, Mike Molloy 0001
University of Toronto, Canada - Mike Molloy 0002
Microsoft Research, Cambridge, UK
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 106 matches
- 2023
- 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) - 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) - 2022
- John Gimbel, André Kündgen, Michael Molloy:
Fractional Cocoloring of Graphs. Graphs Comb. 38(3): 64 (2022) - Michael Molloy, Luke Postle:
Asymptotically good edge correspondence colourings. J. Graph Theory 100(3): 559-577 (2022) - Michael Molloy, Erlang Surya, Lutz Warnke:
The degree-restricted random process is far from uniform. CoRR abs/2211.00835 (2022) - 2021
- Jurgen Aliaj, Michael Molloy:
Adaptable and conflict colouring multigraphs with no cycles of length three or four. CoRR abs/2107.04253 (2021) - 2020
- 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) - 2019
- Michael Molloy:
The list chromatic number of graphs with small clique number. J. Comb. Theory B 134: 264-284 (2019) - 2018
- Michael Molloy:
The Freezing Threshold for k-Colourings of a Random Graph. J. ACM 65(2): 7:1-7:62 (2018) - Pu Gao, Michael Molloy:
Inside the clustering window for random linear equations. Random Struct. Algorithms 52(2): 197-218 (2018) - Pu Gao, Michael Molloy:
The stripping process can be slow: Part I. Random Struct. Algorithms 53(1): 76-139 (2018) - 2017
- Michael Molloy:
A Note on the Rainbow Connection of Random Regular Graphs. Electron. J. Comb. 24(3): 3 (2017) - 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) - Michael Molloy:
The Adaptable Chromatic Number and the Chromatic Number. J. Graph Theory 84(1): 53-56 (2017) - 2016
- Babak Farzad, Arnoosh Golestanian, Michael Molloy:
Backbone colourings of graphs. Discret. Math. 339(11): 2721-2722 (2016) - 2015
- Dimitris Achlioptas, Michael Molloy:
The solution space geometry of random linear equations. Random Struct. Algorithms 46(2): 197-231 (2015) - Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. CoRR abs/1503.01613 (2015) - Pu Gao, Michael Molloy:
Inside the clustering window for random linear equations. CoRR abs/1512.06657 (2015) - 2014
- 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) - Michael Molloy:
Sets that are connected in two random graphs. Random Struct. Algorithms 45(3): 498-512 (2014) - 2013
- Milan Bradonjic, Michael Molloy, Guanhua Yan:
Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments. Internet Math. 9(4): 406-433 (2013) - 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) - Michael Molloy, Ricardo Restrepo:
Frozen variables in random boolean constraint satisfaction problems. SODA 2013: 1306-1318 - Larissa Pschetz, Richard Banks, Mike Molloy:
Movement crafter. TEI 2013: 393-394 - Milan Bradonjic, Michael Molloy, Guanhua Yan:
Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments. CoRR abs/1310.1942 (2013) - Pu Gao, Michael Molloy:
Inside the clustering threshold for random linear equations. CoRR abs/1309.6651 (2013) - 2012
- Siu On Chan, Michael Molloy:
(k+1)-Cores Have k-Factors. Comb. Probab. Comput. 21(6): 882-896 (2012) - Michael Molloy, Giovanna Thron:
An asymptotically tight bound on the adaptable chromatic number. J. Graph Theory 71(3): 331-351 (2012) - Hamed Hatami, Michael Molloy:
The scaling window for a random graph with a given degree sequence. Random Struct. Algorithms 41(1): 99-123 (2012) - 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)
skipping 76 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-08 22:18 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint