default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichelle Delcourt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle
:
Edge-colouring graphs with local list sizes. J. Comb. Theory B 165: 68-96 (2024)- [i5]József Balogh, Anton Bernshteyn, Michelle Delcourt, Asaf Ferber, Huy Tuan Pham:
Sunflowers in set systems with small VC-dimension. CoRR abs/2408.04165 (2024) - 2022
- [j11]József Balogh, Michelle Delcourt, Emily Heath, Lina Li:
Generalized rainbow Turán numbers of odd cycles. Discret. Math. 345(2): 112663 (2022) - 2021
- [j10]Michelle Delcourt, Luke Postle:
Progress towards Nash-Williams' conjecture on triangle decompositions. J. Comb. Theory B 146: 382-416 (2021) - [i4]Michelle Delcourt, Luke Postle:
Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs. CoRR abs/2108.01633 (2021) - 2020
- [j9]Michelle Delcourt, Marc Heinrich, Guillem Perarnau:
The Glauber dynamics for edge-colorings of trees. Random Struct. Algorithms 57(4): 1050-1076 (2020)
2010 – 2019
- 2019
- [c1]Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle:
Improved Bounds for Randomly Sampling Colorings via Linear Programming. SODA 2019: 2216-2234 - 2018
- [j8]Michelle Delcourt, Luke Postle:
Random 4-regular graphs have 3-star decompositions asymptotically almost surely. Eur. J. Comb. 72: 97-111 (2018) - [i3]Michelle Delcourt, Guillem Perarnau, Luke Postle:
Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold. CoRR abs/1804.04025 (2018) - [i2]Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle:
Improved Bounds for Randomly Sampling Colorings via Linear Programming. CoRR abs/1810.12980 (2018) - [i1]Michelle Delcourt, Marc Heinrich, Guillem Perarnau:
The Glauber dynamics for edges colourings of trees. CoRR abs/1812.05577 (2018) - 2017
- [j7]Michelle Delcourt, Luke Postle:
On Star Decompositions of Random Regular Graphs. Electron. Notes Discret. Math. 61: 339-342 (2017) - [j6]Michelle Delcourt, Luke Postle:
On the List Coloring Version of Reed's Conjecture. Electron. Notes Discret. Math. 61: 343-349 (2017) - 2016
- [j5]József Balogh, Michelle Delcourt, Bernard Lidický, Cory Palmer:
Rainbow copies of C4 in edge-colored hypercubes. Discret. Appl. Math. 210: 35-37 (2016) - 2015
- [j4]Michelle Delcourt, Asaf Ferber:
On a Conjecture of Thomassen. Electron. J. Comb. 22(3): 3 (2015) - [j3]József Balogh, Shagnik Das, Michelle Delcourt, Hong Liu, Maryam Sharifzadeh:
Intersecting families of discrete structures are typically trivial. J. Comb. Theory A 132: 224-245 (2015) - 2013
- [j2]Neil J. Calkin, Julia Davis, Michelle Delcourt, Zebediah Engberg, Jobby Jacob, Kevin James:
Taking the Convoluted Out of Bernoulli Convolutions: A Discrete Approach. Integers 13: A19 (2013) - 2012
- [j1]James M. Carraher, Ilkyoo Choi, Michelle Delcourt, Lawrence H. Erickson, Douglas B. West:
Locating a robber on a graph via distance queries. Theor. Comput. Sci. 463: 54-61 (2012)
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 2024-10-07 22:09 CEST 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:
