A critical point for random graphs with a given degree sequence M Molloy, B Reed Random structures & algorithms 6 (2‐3), 161-180, 1995 | 2963 | 1995 |
The size of the giant component of a random graph with a given degree sequence M Molloy, B Reed Combinatorics, probability and computing 7 (3), 295-305, 1998 | 1067 | 1998 |
Graph colouring and the probabilistic method M Molloy, B Reed Springer Science & Business Media, 2002 | 651 | 2002 |
Mick gets some (the odds are on his side)(satisfiability) V Chvátal, B Reed Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 620-627, 1992 | 476 | 1992 |
Finding odd cycle transversals B Reed, K Smith, A Vetta Operations Research Letters 32 (4), 299-301, 2004 | 455 | 2004 |
Acyclic coloring of graphs N Alon, C McDiarmid, B Reed Random Structures & Algorithms 2 (3), 277-288, 1991 | 337 | 1991 |
Tree width and tangles: a new connectivity measure and some applications B Reed Surveys in combinatorics 241, 87-162, 1997 | 311 | 1997 |
Finding approximate separators and computing tree width quickly BA Reed Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992 | 284 | 1992 |
Further algorithmic aspects of the local lemma M Molloy, B Reed Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 274 | 1998 |
The disjoint paths problem in quadratic time K Kawarabayashi, Y Kobayashi, B Reed Journal of Combinatorial Theory, Series B 102 (2), 424-435, 2012 | 246 | 2012 |
Paths, stars and the number three B Reed Combinatorics, Probability and Computing 5 (3), 277-295, 1996 | 242 | 1996 |
A bound on the strong chromatic index of a graph M Molloy, B Reed Journal of Combinatorial Theory, Series B 69 (2), 103-109, 1997 | 208 | 1997 |
Perfect graphs JL Ramírez-Alfonsín, BA Reed (No Title), 2001 | 191 | 2001 |
ω, Δ, and χ B Reed Journal of Graph Theory 27 (4), 177-212, 1998 | 190 | 1998 |
Star coloring of graphs G Fertin, A Raspaud, B Reed Journal of graph theory 47 (3), 163-182, 2004 | 183 | 2004 |
Minima in branching random walks L Addario-Berry, B Reed | 177 | 2009 |
Channel assignment and weighted coloring C McDiarmid, B Reed Networks: An International Journal 36 (2), 114-117, 2000 | 168 | 2000 |
Degree constrained subgraphs L Addario-Berry, K Dalal, BA Reed Discrete Applied Mathematics 156 (7), 1168-1174, 2008 | 163 | 2008 |
The height of a random binary search tree B Reed Journal of the ACM (JACM) 50 (3), 306-332, 2003 | 156 | 2003 |
Vertex colouring edge partitions L Addario-Berry, REL Aldred, K Dalal, BA Reed Journal of Combinatorial Theory, Series B 94 (2), 237-244, 2005 | 153 | 2005 |