| Minima in branching random walks L Addario-Berry, B Reed The Annals of Probability 37 (3), 1044-1079, 2009 | 197 | 2009 |
| The continuum limit of critical random graphs L Addario-Berry, N Broutin, C Goldschmidt Probability Theory and Related Fields 152 (3), 367-406, 2012 | 193 | 2012 |
| Degree constrained subgraphs L Addario-Berry, K Dalal, BA Reed Discrete Applied Mathematics 156 (7), 1168-1174, 2008 | 173 | 2008 |
| Vertex colouring edge partitions L Addario-Berry, REL Aldred, K Dalal, BA Reed Journal of Combinatorial Theory, Series B 94 (2), 237-244, 2005 | 165 | 2005 |
| On combinatorial testing problems L Addario-Berry, N Broutin, L Devroye, G Lugosi The Annals of Statistics 38 (5), 3063-3092, 2010 | 161 | 2010 |
| Vertex-colouring edge-weightings L Addario-Berry, K Dalal, C McDiarmid, BA Reed, A Thomason Combinatorica 27 (1), 1-12, 2007 | 161 | 2007 |
| The scaling limit of the minimum spanning tree of the complete graph L Addario-Berry, N Broutin, C Goldschmidt, G Miermont The Annals of Probability 45 (5), 3075-3144, 2017 | 129 | 2017 |
| The scaling limit of random simple triangulations and random simple quadrangulations L Addario-Berry, M Albenque The Annals of Probability 45 (5), 2767-2825, 2017 | 113* | 2017 |
| Sub-Gaussian tail bounds for the width and height of conditioned Galton–Watson trees L Addario-Berry, L Devroye, S Janson The Annals of Probability 41 (2), 1072-1087, 2013 | 86 | 2013 |
| Critical random graphs: limiting constructions and distributional properties L Addario-Berry, N Broutin, C Goldschmidt Electron. J. Probab 15 (25), 741-775, 2010 | 78 | 2010 |
| Bisimplicial vertices in even-hole-free graphs L Addario-Berry, M Chudnovsky, F Havet, B Reed, P Seymour Journal of Combinatorial Theory, Series B 98 (6), 1119-1164, 2008 | 76 | 2008 |
| Ballot theorems, old and new L Addario-Berry, BA Reed Horizons of Combinatorics, 9-35, 2008 | 74 | 2008 |
| Towards identifying lateral gene transfer events L Addario-Berry, M Hallett, J Lagergren Proc. 8th Pacific Symp. on Biocomputing (PSB03), 279-290, 2003 | 66 | 2003 |
| Oriented trees in digraphs L Addario-Berry, F Havet, CL Sales, B Reed, S Thomassé Discrete Mathematics 313 (8), 967-974, 2013 | 60 | 2013 |
| Cutting down trees with a Markov chainsaw L Addario-Berry, N Broutin, C Holmgren The Annals of Applied Probability 24 (6), 2297-2339, 2014 | 53 | 2014 |
| Ancestral maximum likelihood of evolutionary trees is hard L Addario-Berry, B Chor, M Hallett, J Lagergren, A Panconesi, T Wareham Journal of Bioinformatics and Computational Biology 2 (02), 257-271, 2004 | 50 | 2004 |
| Paths with two blocks in n-chromatic digraphs L Addario-Berry, F Havet, S Thomassé Journal of Combinatorial Theory, Series B 97 (4), 620-626, 2007 | 47 | 2007 |
| Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph L Addario-Berry, WS Kennedy, AD King, Z Li, B Reed Discrete Applied Mathematics 158 (7), 765-770, 2010 | 35 | 2010 |
| The algorithmic hardness threshold for continuous random energy models L Addario-Berry, P Maillard Mathematical Statistics and Learning 2 (1), 77-101, 2020 | 32 | 2020 |
| Critical random graphs and the structure of a minimum spanning tree L Addario‐Berry, N Broutin, B Reed Random Structures & Algorithms 35 (3), 323-347, 2009 | 31 | 2009 |
Bruce ReedMcGill UniversityVerified email at cs.mcgill.ca
