| Improved bounds for randomly sampling colorings via linear programming S Chen, M Delcourt, A Moitra, G Perarnau, L Postle Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 65 | 2019 |
| Locating a robber on a graph via distance queries J Carraher, I Choi, M Delcourt, LH Erickson, DB West Theoretical Computer Science 463, 54-61, 2012 | 42 | 2012 |
| Reducing linear Hadwiger's conjecture to coloring small graphs M Delcourt, L Postle arXiv preprint arXiv:2108.01633, 2021 | 39 | 2021 |
| Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings M Delcourt, L Postle arXiv preprint arXiv:2204.08981, 2022 | 27 | 2022 |
| Intersecting families of discrete structures are typically trivial J Balogh, S Das, M Delcourt, H Liu, M Sharifzadeh Journal of Combinatorial Theory, Series A 132, 224-245, 2015 | 27 | 2015 |
| Progress towards Nash-Williams' conjecture on triangle decompositions M Delcourt, L Postle Journal of Combinatorial Theory, Series B 146, 382-416, 2021 | 22 | 2021 |
| The typical structure of intersecting families of discrete structures J Balogh, S Das, M Delcourt, H Liu, M Sharifzadeh J. Combin. Theory Ser. A 132, 224-245, 2015 | 18 | 2015 |
| On the list coloring version of Reed's Conjecture M Delcourt, L Postle Electronic Notes in Discrete Mathematics 61, 343-349, 2017 | 12 | 2017 |
| The limit in the (𝑘+ 2, 𝑘)-problem of Brown, Erdős and Sós exists for all 𝑘≥ 2 M Delcourt, L Postle Proceedings of the American Mathematical Society 152 (05), 1881-1891, 2024 | 10 | 2024 |
| Edge-colouring graphs with local list sizes M Bonamy, M Delcourt, R Lang, L Postle arXiv preprint arXiv:2007.14944, 2020 | 8 | 2020 |
| Rapid mixing of Glauber dynamics for colorings below Vigoda's threshold M Delcourt, G Perarnau, L Postle arXiv preprint arXiv:1804.04025, 2018 | 8 | 2018 |
| A combinatorial method for connecting BHV spaces representing different numbers of taxa Y Ren, S Zha, J Bi, JA Sanchez, C Monical, M Delcourt, RK Guzman, ... arXiv preprint arXiv:1708.02626, 2017 | 7 | 2017 |
| The Glauber dynamics for edge‐colorings of trees M Delcourt, M Heinrich, G Perarnau Random Structures & Algorithms 57 (4), 1050-1076, 2020 | 6 | 2020 |
| A short nonalgorithmic proof of the containers theorem for hypergraphs A Bernshteyn, M Delcourt, H Towsner, A Tserunyan Proceedings of the American Mathematical Society 147 (4), 1739-1749, 2019 | 6 | 2019 |
| Taking the Convoluted Out of Bernoulli Convolutions: A Discrete Approach. NJ Calkin, J Davis, M Delcourt, Z Engberg, J Jacob, K James Integers 13, A19, 2013 | 5 | 2013 |
| Discrete Bernoulli convolutions: an algorithmic approach toward bound improvement N Calkin, J Davis, M Delcourt, Z Engberg, J Jacob, K James Proceedings of the American Mathematical Society 139 (5), 1579-1584, 2011 | 5 | 2011 |
| Clique Decompositions in Random Graphs via Refined Absorption M Delcourt, T Kelly, L Postle arXiv preprint arXiv:2402.17857, 2024 | 4 | 2024 |
| On generalized Ramsey numbers in the sublinear regime P Bennett, M Delcourt, L Li, L Postle arXiv preprint arXiv:2212.10542, 2022 | 4 | 2022 |
| Random 4-regular graphs have 3-star decompositions asymptotically almost surely M Delcourt, L Postle European Journal of Combinatorics 72, 97-111, 2018 | 4 | 2018 |
| On a conjecture of Thomassen M Delcourt, A Ferber arXiv preprint arXiv:1410.4902, 2014 | 4 | 2014 |
Shagnik DasAssistant Professor, National Taiwan UniversityVerified email at ntu.edu.tw
