[To appear] 

 L. AddarioBerry, W.S. Kennedy, A.D. King, Z.
Li, and B. Reed. Finding
the maximumweight induced kpartite subgraph of an itriangulated graph.
Discrete Applied Mathematics. To appear.
 L. AddarioBerry and B. Reed. Minima
in branching random walks. Annals of Probability.
To appear.
 K. Kawarabayashi and B. Reed. Highly Parity
Linked Graphs. Combinatorica. To appear.

[2008] 

 L. AddarioBerry, M. Chudnovsky, F. Havet, B. Reed,
and P. Seymour. Bisimplicial vertices in evenholefree graphs. Journal
of Combinatorial Theory Ser. B, 98(6):11191164, 2008.
 L. AddarioBerry, K. Dalal, and B. Reed. DegreeConstrained
Subgraphs. Discrete Applied Mathematics, 156:11681174, 2008.
 AddarioBerry and B. Reed. Ballot Theorems, Old and New. Bolyai
Society Mathematical Studies (Series 17), pp 935, 2008.
 M. Cerioli, L. Faria, T. Ferreira, C. Martinhon, F.
Protti, and B. Reed. Partition into cliques for cubic graphs: Planar case,
complexity and approximation. Discrete Applied Mathematics, 156:22702278,
2008.
 S. Fiorini, N. Hardy, B. Reed, and A. Vetta. Planar
graph bipartization in linear time. Discrete Applied Mathematics,
156:11751180, 2008.
 N. Fountoulakis and B. Reed. The evolution of the
mixing rate of a simple random walk on the giant component of a random graph.
Random Structures and Algorithms, 33:6886, 2008.
 K. Kawarabayashi, O. Lee, B. Reed, and P. Wollan.
A weaker version of Lovasz' path removable conjecture. Journal
of Combinatorial Theory (Series B), 98:972979, 2008.
 K. Kawarabayashi and B. Reed. Fractional coloring
and the odd Hadwiger's conjecture. European Journal of Combinatorics,
29(2):411417, 2008.
 C. LinharesSales, F. Maffray, and B. Reed. On Planar
QuasiParity Graphs. SIAM Journal of Discrete Mathematics, 22:329347,
2008.
 C. McDiarmid and B. Reed. On the maximum degree
of a random planar graph. Combinatorics, Probability and Computing,
17:591601, 2008.
 C. Meagher and B. Reed. Fractionally total
colouring G_{n,p}. Discrete Applied Mathematics, 156:11121124,
2008.
 B. Reed. Skew Partitions in Perfect Graphs.
Discrete Applied Mathematics, 156:11501156, 2008.

[2007] 

 L. AddarioBerry, K. Dalal, C. McDiarmid, B. Reed,
and A. Thomason. Vertex Colouring Edge Weightings. Combinatorica,
27:112, 2007.
 E. Birmele, J. A. Bondy, and B. Reed. The ErdosPosa
property for long circuits. Combinatorica, 27:135145, 2007.
 S. Fiorini, N. Hardy, B. Reed, and A. Vetta. Approximate
minmax relations for odd cycles in planar graphs. Mathematical Programming
Ser. B, 110(1):7191, 2007.
 N. Fountoulakis and B. Reed. Faster Mixing and
Small Bottlenecks. Probability Theory and Related Fields, 137:475486,
2007.

[2006] 

 J. BangJensen, B. Reed, M. Schacht, R. Sámal
B. Toft, and U. Wagner. Topics in Discrete Mathematics, Dedicated to Jarik
Nesetril on the Occasion of his 60th birthday, volume 26 of Algorithms
and Combinatorics, chapter On six problems posed by Jarik Nesetril, pages
613627. Springer, Berlin, M. Klazar, J. Kratochvil, M. Loebl, J. Matousek,
R. Thomas and P. Valtr edition, 2006.
 C. McDiarmid and B. Reed. Concentration for selfbounding
functions and an inequality of talagrand. Random Structures and Algorithms,
29:549557, 2006.

[2005] 

 L. AddarioBerry, R. E. L. Aldred, K. Dalal, and
B. Reed. Vertex colouring edge partitions. J. Combin. Theory Ser.
B, 94(2):237244, 2005.
 D. Avis, C. De Simone, and B. Reed. On the fractional
chromatic index of a graph and its complement. Oper. Res. Lett.,
33(4):385388, 2005.
 H. Everett, C. M. H. de Figueiredo, S. Klein, and
B. Reed. The perfection and recognition of bullreducible Berge graphs.
Theor. Inform. Appl., 39(1):145160, 2005.
 B. Farzad, M. Molloy, and B. Reed. (\Deltak)critical
graphs. J. Combin. Theory Ser. B, 93(2):173185, 2005.
 B. Reed and B. Sudakov. List colouring when
the chromatic number is close to the order of the graph. Combinatorica,
25(1):117123, 2005.

[2004] 

 S. Dantas, C. M. H. de Figueiredo, S. Klein, S.
Gravier, and B. Reed. Stable skew partition problem. Discrete Appl.
Math., 143(13):1722, 2004.
 M. DeVos, G. Ding, B. Oporowski, D. P. Sanders,
B. Reed, P. Seymour, and D. Vertigan. Excluding any graph as a minor allows
a low treewidth 2coloring. J. Combin. Theory Ser. B, 91(1):2541,
2004.
 G. Fertin, A. Raspaud, and B. Reed. Star coloring
of graphs. J. Graph Theory, 47(3):163182, 2004.
 C. T. Hoàng and B. Reed. On the
coP_{3}structure of perfect graphs. SIAM J. Discrete Math.,
18(3):571576 (electronic), 2004/05.
 B. Reed and P. Seymour. Hadwiger's conjecture
for line graphs. European J. Combin., 25(6):873876, 2004.
 B. Reed, K. Smith, and A. Vetta. Finding odd
cycle transversals. Oper. Res. Lett., 32(4):299301, 2004.

[2003] 

 B. Reed, S. W. Song, and J. L. Szwarcfiter. Preface
[Brazilian Symposium on Graphs, Algorithms and Combinatorics]. Discrete
Appl. Math., 141(13):1, 2004.
Note: Held in Fortaleza, 2001.
 B. Reed. Algorithmic aspects of tree width.
In Recent advances in algorithms and combinatorics, volume 11 of
CMS Books Math./Ouvrages Math. SMC, pages 85107. Springer, New
York, 2003.
 G. Calinescu, C. G. Fernandes, and B. Reed. Multicuts
in unweighted graphs and digraphs with bounded degree and bounded treewidth.
J. Algorithms, 48(2):333359, 2003.
 M. Loebl, J. Nesetril, and B. Reed. A
note on random homomorphism from arbitrary graphs to Z. Discrete
Math., 273(13):173181, 2003.
Note: EuroComb'01 (Barcelona).
 C. McDiarmid and B. Reed. Channel assignment
on graphs of bounded treewidth. Discrete Math., 273(13):183192,
2003.
Note: EuroComb'01 (Barcelona).
 B. Reed. The height of a random binary search
tree. J. ACM, 50(3):306332 (electronic), 2003.

[2002] 

 L. Devroye, C. McDiarmid, and B. Reed. Giant
components for two expanding graph processes. In Mathematics and computer
science, II (Versailles, 2002), Trends Math., pages 161173. Birkhäuser,
Basel, 2002.
 C. Cooper, A. Frieze, and B. Reed. Random regular
graphs of nonconstant degree: connectivity and Hamiltonicity. Combin.
Probab. Comput., 11(3):249261, 2002.
 C. Cooper, A. Frieze, B. Reed, and O. Riordan.
Random regular graphs of nonconstant degree: independence and chromatic
number. Combin. Probab. Comput., 11(4):323341, 2002.
 B. Reed and B. Sudakov. Asymptotically the list
colouring constants are 1. J. Combin. Theory Ser. B, 86(1):2737,
2002.

[2001] 

 H. Everett, C. M. H. de Figueiredo, C. LinharesSales,
F. Maffray, O. Porto, and B. Reed. Even pairs. In Perfect graphs,
WileyIntersci. Ser. Discrete Math. Optim., pages 6792. Wiley, Chichester,
2001.
 R. Hayward and B. Reed. Forbidding holes and
antiholes. In Perfect graphs, WileyIntersci. Ser. Discrete Math.
Optim., pages 113137. Wiley, Chichester, 2001.
 B. Reed. A gentle introduction to semidefinite
programming. In Perfect graphs, WileyIntersci. Ser. Discrete
Math. Optim., pages 233259. Wiley, Chichester, 2001.
 B. Reed. From conjecture to theorem. In
Perfect graphs, WileyIntersci. Ser. Discrete Math. Optim., pages
1324. Wiley, Chichester, 2001.
 C. LinharesSales, F. Maffray, and B. Reed. Recognizing
planar strict quasiparity graphs. Graphs Combin., 17(4):745757,
2001.
 D. Rautenbach and B. Reed. The ErdosPósa
property for odd cycles in highly connected graphs. Combinatorica,
21(2):267278, 2001.
Note: Paul Erdos and his mathematics (Budapest, 1999).

[2000] 

 C. Berge and B. Reed. Optimal packings
of edgedisjoint odd cycles. Discrete Math., 211(13):197202,
2000.
 de Figueiredo C., Klein S., and Reed B. Finding skew partitions
efficiently. Journal of Algorithms, 37: 505521, 2000.
 C. McDiarmid and B. Reed. Channel assignment
and weighted coloring. Networks, 36(2):114117, 2000.
 L. Perkovic and B. Reed. An improved algorithm
for finding tree decompositions of small width. Internat. J.
Found. Comput. Sci., 11(3):365371, 2000.
Note: Selected papers from the Workshop on Theoretical Aspects
of Computer Science (WG 99), Part 1 (Ascona).
 B. Reed and R. Thomas. Clique minors in
graphs and their complements. J. Combin. Theory Ser. B, 78(1):8185,
2000.

[1999] 

 M. Molloy and B. Reed. Graph colouring via the
probabilistic method. In Graph theory and combinatorial biology (Balatonlelle,
1996), volume 7 of Bolyai Soc. Math. Stud., pages 125155.
János Bolyai Math. Soc., Budapest, 1999.
 M. Molloy, B. Reed, and William Steiger. On
the mixing rate of the triangulation walk. In Randomization methods
in algorithm design (Princeton, NJ, 1997), volume 43 of DIMACS Ser.
Discrete Math. Theoret. Comput. Sci., pages 179190. Amer. Math. Soc.,
Providence, RI, 1999.
 C. Berge and B. Reed. Edgedisjoint odd cycles
in graphs with small chromatic number. Ann. Inst. Fourier (Grenoble),
49(3):783786, 1999.
Note: Symposium à la Mémoire de François Jaeger
(Grenoble, 1998).
 Hugh Hind, M. Molloy, and B. Reed. Total
coloring with \Delta + poly(log(\Delta)) colors. SIAM J. Comput.,
28(3):816821 (electronic), 1999.
 F. Maffray and B. Reed. A description of clawfree
perfect graphs. J. Combin. Theory Ser. B, 75(1):134156, 1999.
 C. McDiarmid and B. Reed. Colouring proximity
graphs in the plane. Discrete Math., 199(13):123137, 1999.
 M. Molloy and B. Reed. Critical subgraphs of
a random graph. Electron. J. Combin., 6:Research Paper 35, 13 pp.
(electronic), 1999.
 B. Reed. A strengthening of Brooks' theorem.
J. Combin. Theory Ser. B, 76(2):136149, 1999.
 B. Reed. Edge coloring nearly bipartite graphs.
Oper. Res. Lett., 24(12):1114, 1999.
 B. Reed. Mangoes and blueberries. Combinatorica,
19(2):267296, 1999.
 B. Reed. The list colouring constants. J.
Graph Theory, 31(2):149153, 1999.

[1998] 

 A. M. Frieze and B. Reed. Probabilistic analysis
of algorithms. In Probabilistic methods for algorithmic discrete mathematics,
volume 16 of Algorithms Combin., pages 3692. Springer, Berlin,
1998.
 M. Molloy and B. Reed. A bound on the total
chromatic number. Combinatorica, 18(2):241280, 1998.
 M. Molloy and B. Reed. The size of the giant
component of a random graph with a given degree sequence. Combin. Probab.
Comput., 7(3):295305, 1998.
 B. Reed. \omega, \Delta, and \chi.
J. Graph Theory, 27(4):177212, 1998.
 B. Reed and P. Seymour. Fractional colouring
and Hadwiger's conjecture. J. Combin. Theory Ser. B, 74(2):147152,
1998.

[1997] 

 H. Everett, S. Klein, and B. Reed. An algorithm
for finding homogeneous pairs. Discrete Appl. Math., 72(3):209218,
1997.
 H. Hind, M. Molloy, and B. Reed. Colouring a
graph frugally. Combinatorica, 17(4):469482, 1997.
 C. LinharesSales, F. Maffray, and B. Reed. On
planar perfectly contractile graphs. Graphs Combin., 13(2):167187,
1997.
 M. Molloy and B. Reed. A bound on the strong
chromatic index of a graph. J. Combin. Theory Ser. B, 69(2):103109,
1997.
 L. Perkovic and B. Reed. Edge coloring regular
graphs of high degree. Discrete Math., 165/166:567578, 1997.
Note: Graphs and combinatorics (Marseille, 1995).

[1996] 

 C. Cooper, A. Frieze, M. Molloy, and B. Reed.
Perfect matchings in random rregular, suniform hypergraphs.
Combin. Probab. Comput., 5(1):114, 1996.
 B. Reed. Paths, stars and the number three.
Combin. Probab. Comput., 5(3):277295, 1996.
 B. Reed, N. Robertson, P. Seymour, and R. Thomas.
Packing directed circuits. Combinatorica, 16(4):535554, 1996.

[1995] 

 M. Albert, A. Frieze, and B. Reed. Comments
on: ``Multicoloured Hamilton cycles'' [Electron. J. Combin. 2 (1995),
Research Paper 10, 13 pp. (electronic); MR1327570 (96b:05058)]. Electron.
J. Combin., 2:Research Paper 10, Comment 1, 1 HTML document (electronic),
1995.
 M. Albert, A. Frieze, and B. Reed. Multicoloured
Hamilton cycles. Electron. J. Combin., 2:Research Paper 10, approx.
13 pp. (electronic), 1995.
 L. Devroye and B. Reed. On the variance of the
height of random binary search trees. SIAM J. Comput., 24(6):11571162,
1995.
 A. Frieze, R. M. Karp, and B. Reed. When is
the assignment bound tight for the asymmetric travelingsalesman problem?.
SIAM J. Comput., 24(3):484493, 1995.
 A. Frieze and B. Reed. Covering the edges of
a random graph by cliques. Combinatorica, 15(4):489497, 1995.
 B. Gamble, W. Pulleyblank, B. Reed, and B. Shepherd.
Right angle free subsets in the plane. Graphs Combin., 11(2):121129,
1995.
 C. McDiarmid and B. Reed. Almost every
graph can be covered by \lceil{\Delta/2}\rceil linear forests. Combin.
Probab. Comput., 4(3):257268, 1995.
 M. Molloy and B. Reed. The dominating number
of a random cubic graph. Random Structures Algorithms, 7(3):209221,
1995.
 B. Reed. Rooted routing in the plane. Discrete
Appl. Math., 57(23):213227, 1995.
Note: Combinatorial optimization 1992 (CO92) (Oxford).
 B. Reed and N. Sbihi. Recognizing bullfree
perfect graphs. Graphs Combin., 11(2):171178, 1995.

[1994] 

 C. McDiarmid, B. Reed, A. Schrijver, and B. Shepherd.
Induced circuits in planar graphs. J. Combin. Theory Ser. B,
60(2):169176, 1994.

[1993] 

 B. Bollobás, B. Reed, and A. Thomason. An
extremal function for the achromatic number. In Graph structure theory
(Seattle, WA, 1991), volume 147 of Contemp. Math., pages 161165.
Amer. Math. Soc., Providence, RI, 1993.
 B. Reed. Counterexamples to a conjecture of
Las Vergnas and Meyniel. In Graph structure theory (Seattle, WA, 1991),
volume 147 of Contemp. Math., pages 157159. Amer. Math. Soc., Providence,
RI, 1993.
 G. Cornuéjols and B. Reed. Complete multipartite
cutsets in minimal imperfect graphs. J. Combin. Theory Ser. B,
59(2):191198, 1993.
 A. Frieze and B. Reed. Polychromatic Hamilton
cycles. Discrete Math., 118(13):6974, 1993.
 K. Kilakos and B. Reed. Fractionally colouring
total graphs. Combinatorica, 13(4):435440, 1993.
 C. McDiarmid and B. Reed. On total colourings
of graphs. J. Combin. Theory Ser. B, 57(1):122130, 1993.
 B. Reed. Rooted routing in the plane. CWI
Quarterly, 6(3):241255, 1993.

[1992] 

 K. Kilakos and B. Reed. A semiintegral total
colouring. In Sets, graphs and numbers (Budapest, 1991), volume
60 of Colloq. Math. Soc. János Bolyai, pages 429438. NorthHolland,
Amsterdam, 1992.
 N. Alon, C. McDiarmid, and B. Reed. Star arboricity.
Combinatorica, 12(4):375380, 1992.
 A. Frieze, C. McDiarmid, and B. Reed. On a conjecture
of Bondy and Fan. Ars Combin., 33:329336, 1992.
 B. Reed and C. McDiarmid. The strongly
connected components of 1in, 1out. Combin. Probab. Comput.,
1(3):265274, 1992.

[1991] 

 N. Alon, C. McDiarmid, and B. Reed. Acyclic
coloring of graphs. Random Structures Algorithms, 2(3):277288,
1991.

[1990] 

 A. Frieze, C. McDiarmid, and B. Reed. Greedy
matching on the line. SIAM J. Comput., 19(4):666672, 1990.
 C. McDiarmid and B. Reed. Linear arboricity
of random regular graphs. Random Structures Algorithms, 1(4):443445,
1990.

[< 1989] 

 A. M. Frieze, B. Jackson, C. J. H. McDiarmid, and
B. Reed. Edgecolouring random graphs. J. Combin. Theory Ser. B,
45(2):135149, 1988.
 C. L. Monma, B. Reed, and W. T. Trotter, Jr.. Threshold
tolerance graphs. J. Graph Theory, 12(3):343362, 1988.
 C. T. Hoàng and B. Reed. A note on short
cycles in digraphs. Discrete Math., 66(12):103107, 1987.
 B. Reed. A semistrong perfect graph theorem.
J. Combin. Theory Ser. B, 43(2):223240, 1987.
 B. Reed. A note on the semistrong perfect graph
conjecture. Discrete Math., 54(1):111112, 1985.
