default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruce A. Reed
Person information
- affiliation: McGill University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i16]John Iacono, Piotr Micek, Pat Morin, Bruce A. Reed:
Vertex Ranking of Degenerate Graphs. CoRR abs/2404.16340 (2024)- 2023
- [j156]Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye
, Bruce A. Reed, Ben Seamone:
The speed and threshold of the biased perfect matching and Hamilton cycle games. Discret. Appl. Math. 332: 23-40 (2023) - [j155]Bruce A. Reed, Maya Stein:
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result. J. Graph Theory 102(4): 737-783 (2023) - [j154]Bruce A. Reed, Maya Stein:
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result. J. Graph Theory 102(4): 797-821 (2023) - 2021
- [j153]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid:
Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. 28(3) (2021) - [j152]Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed:
Cops and robbers on oriented toroidal grids. Theor. Comput. Sci. 857: 166-176 (2021) - [c47]Jordan Barrett, Salomon Bendayan, Yanjia Li, Bruce A. Reed:
Partitioning Into Prescribed Number of Cycles and Mod k T-join With Slack. LAGOS 2021: 12-20 - [c46]Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The Speed and Threshold of the Biased Perfect Matching Game. LAGOS 2021: 190-199 - [c45]Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The Speed and Threshold of the Biased Hamilton Cycle Game. LAGOS 2021: 200-211 - 2020
- [j151]Sergey Norin, Bruce A. Reed, Andrew Thomason, David R. Wood:
A Lower Bound on the Average Degree Forcing a Minor. Electron. J. Comb. 27(2): 2 (2020) - [j150]János Pach, Bruce A. Reed, Yelena Yuditsky:
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Discret. Comput. Geom. 63(4): 888-917 (2020) - [j149]Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour:
Corrigendum to "Bisimplicial vertices in even-hole-free graphs". J. Comb. Theory B 142: 374-375 (2020) - [j148]Frédéric Havet, Bruce A. Reed, Maya Stein, David R. Wood:
A variant of the Erdős-Sós conjecture. J. Graph Theory 94(1): 131-158 (2020) - [i15]Tony Huynh, Bruce A. Reed, David R. Wood, Liana Yepremyan:
Notes on Tree- and Path-chromatic Number. CoRR abs/2002.05363 (2020) - [i14]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid:
Tight Bounds on The Clique Chromatic Number. CoRR abs/2006.11353 (2020)
2010 – 2019
- 2019
- [j147]Bruce A. Reed, Alex Scott, Paul D. Seymour:
Near-domination in graphs. J. Comb. Theory A 165: 392-407 (2019) - [j146]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on growing a tree in a graph. Random Struct. Algorithms 55(2): 290-312 (2019) - [c44]David Eppstein, Bruce A. Reed:
Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. SODA 2019: 589-605 - [i13]Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed:
Cops and robbers on oriented toroidal grids. CoRR abs/1904.10113 (2019) - 2018
- [j145]Jonas T. Witt, Marco E. Lübbecke, Bruce A. Reed:
Polyhedral results on the stable set problem in graphs containing even or odd pairs. Math. Program. 171(1-2): 519-522 (2018) - [c43]János Pach, Bruce A. Reed, Yelena Yuditsky:
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. SoCG 2018: 68:1-68:14 - [i12]János Pach, Bruce A. Reed, Yelena Yuditsky:
Almost all string graphs are intersection graphs of plane convex sets. CoRR abs/1803.06710 (2018) - [i11]David Eppstein, Bruce A. Reed:
Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. CoRR abs/1810.07825 (2018) - 2017
- [j144]Guillem Perarnau, Bruce A. Reed:
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Comb. Probab. Comput. 26(3): 448-467 (2017) - [j143]Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts:
Acyclic edge colourings of graphs with large girth. Random Struct. Algorithms 50(4): 511-533 (2017) - [i10]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on Growing a Tree in a Graph. CoRR abs/1707.00083 (2017) - 2016
- [j142]Bruce A. Reed, David R. Wood:
Forcing a sparse minor. Comb. Probab. Comput. 25(2): 300-322 (2016) - [j141]Bruce A. Reed, David R. Wood:
'Forcing a sparse minor' - CORRIGENDUM. Comb. Probab. Comput. 25(2): 323 (2016) - [j140]Andrew D. King, Bruce A. Reed:
A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω. J. Graph Theory 81(1): 30-34 (2016) - [c42]Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed:
How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. FOCS 2016: 695-703 - [i9]Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed:
How to determine if a random graph with a fixed degree sequence has a giant component. CoRR abs/1601.03714 (2016) - 2015
- [j139]Andrew D. King, Bruce A. Reed:
Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ. J. Graph Theory 78(3): 157-194 (2015) - [j138]Jonathan A. Noel, Bruce A. Reed, Hehui Wu:
A Proof of a Conjecture of Ohba. J. Graph Theory 79(2): 86-102 (2015) - [j137]Maria Chudnovsky, Sergey Norin, Bruce A. Reed, Paul D. Seymour:
Excluding a Substar and an Antisubstar. SIAM J. Discret. Math. 29(1): 297-308 (2015) - [c41]Bruce A. Reed:
Connectivity Preserving Iterative Compression. CCCG 2015 - [i8]Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed:
Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time. CoRR abs/1509.07680 (2015) - 2014
- [j136]Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed:
Removable paths and cycles with parity constraints. J. Comb. Theory B 106: 115-133 (2014) - [j135]Michael Molloy, Bruce A. Reed:
Colouring graphs when the number of colours is almost the maximum degree. J. Comb. Theory B 109: 134-195 (2014) - [j134]Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott:
For most graphs H, most H-free graphs have a linear homogeneous set. Random Struct. Algorithms 45(3): 343-361 (2014) - [i7]Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts:
Acyclic edge colourings of graphs with large girth. CoRR abs/1411.3047 (2014) - 2013
- [j133]Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce A. Reed, Stéphan Thomassé:
Oriented trees in digraphs. Discret. Math. 313(8): 967-974 (2013) - [j132]Jonathan A. Noel, Bruce A. Reed, Douglas B. West, Hehui Wu, Xuding Zhu:
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond. Electron. Notes Discret. Math. 43: 89-95 (2013) - [j131]Andrew D. King, Bruce A. Reed:
Asymptotics of the Chromatic Number for Quasi-Line Graphs. J. Graph Theory 73(3): 327-341 (2013) - [j130]Peter Keevash, Zhentao Li, Bojan Mohar, Bruce A. Reed:
Digraph Girth via Chromatic Number. SIAM J. Discret. Math. 27(2): 693-696 (2013) - [j129]Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood:
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. SIAM J. Discret. Math. 27(4): 1770-1774 (2013) - [c40]Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed:
A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. SODA 2013: 414-431 - 2012
- [j128]Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed:
Connectivity for Bridge-Addable Monotone Graph Classes. Comb. Probab. Comput. 21(6): 803-815 (2012) - [j127]Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics:
Polynomial-time recognition of clique-width ≤3 graphs. Discret. Appl. Math. 160(6): 834-865 (2012) - [j126]Bruce A. Reed, David R. Wood:
Polynomial treewidth forces a large grid-like-minor. Eur. J. Comb. 33(3): 374-379 (2012) - [j125]Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed:
The disjoint paths problem in quadratic time. J. Comb. Theory B 102(2): 424-435 (2012) - [j124]Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni:
Griggs and Yeh's Conjecture and L(p, 1)-labelings. SIAM J. Discret. Math. 26(1): 145-168 (2012) - [i6]Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood:
A linear-time algorithm for finding a complete graph minor in a dense graph. CoRR abs/1202.2624 (2012) - [i5]Andrew D. King, Bruce A. Reed:
A short proof that χ can be bounded ε away from Δ+1 towards ω. CoRR abs/1211.1410 (2012) - [i4]Jonathan A. Noel, Bruce A. Reed, Hehui Wu:
A Proof of a Conjecture of Ohba. CoRR abs/1211.1999 (2012) - [i3]Andrew D. King, Bruce A. Reed:
Claw-free graphs, skeletal graphs, and a stronger conjecture on $ω$, $Δ$, and $χ$. CoRR abs/1212.3036 (2012) - 2011
- [j123]Maria Chudnovsky, Bruce A. Reed, Paul D. Seymour:
The edge-density for K2, t minors. J. Comb. Theory B 101(1): 18-46 (2011) - [c39]Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan:
The Graph Minor Algorithm with Parity Conditions. FOCS 2011: 27-36 - [c38]Bruce A. Reed:
Graph Coloring via The Probabilistic Method. SODA 2011: 184 - [i2]Andrew D. King, Bruce A. Reed:
Asymptotics of the chromatic number for quasi-line graphs. CoRR abs/1102.0805 (2011) - 2010
- [j122]Louigi Addario-Berry, W. Sean Kennedy, Andrew D. King, Zhentao Li, Bruce A. Reed:
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. Discret. Appl. Math. 158(7): 765-770 (2010) - [j121]Michael Molloy, Bruce A. Reed:
Asymptotically optimal frugal colouring. J. Comb. Theory B 100(2): 226-246 (2010) - [j120]Michael Molloy, Bruce A. Reed:
Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246]. J. Comb. Theory B 100(2): 247-249 (2010) - [c37]Ken-ichi Kawarabayashi, Bruce A. Reed:
A Separator Theorem in Minor-Closed Classes. FOCS 2010: 153-162 - [c36]Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed:
Recognizing a Totally Odd K4-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. SODA 2010: 318-328 - [c35]Ken-ichi Kawarabayashi, Bruce A. Reed:
An (almost) Linear Time Algorithm for Odd Cyles Transversal. SODA 2010: 365-378 - [c34]Ken-ichi Kawarabayashi, Bruce A. Reed:
Odd cycle packing. STOC 2010: 695-704
2000 – 2009
- 2009
- [j119]Ken-ichi Kawarabayashi, Bruce A. Reed:
Highly parity linked graphs. Comb. 29(2): 215-225 (2009) - [j118]Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed:
Tree-width of graphs without a 3×3 grid minor. Discret. Appl. Math. 157(12): 2577-2596 (2009) - [j117]W. Sean Kennedy, Conor Meagher, Bruce A. Reed:
Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time. Electron. Notes Discret. Math. 34: 47-51 (2009) - [j116]Nikolaos Fountoulakis, Bruce A. Reed:
A general critical condition for the emergence of a giant component in random graphs with given degrees. Electron. Notes Discret. Math. 34: 639-645 (2009) - [j115]Takehiro Ito, W. Sean Kennedy, Bruce A. Reed:
A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2. Electron. Notes Discret. Math. 35: 235-240 (2009) - [j114]Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta:
On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory B 99(1): 20-29 (2009) - [j113]Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee:
Removable cycles in non-bipartite graphs. J. Comb. Theory B 99(1): 30-38 (2009) - [j112]Louigi Addario-Berry, Nicolas Broutin, Bruce A. Reed:
Critical random graphs and the structure of a minimum spanning tree. Random Struct. Algorithms 35(3): 323-347 (2009) - [j111]Bruce A. Reed, David R. Wood:
A linear-time algorithm to find a separator in a graph excluding a minor. ACM Trans. Algorithms 5(4): 39:1-39:16 (2009) - [j110]Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon:
Coloring Artemis graphs. Theor. Comput. Sci. 410(21-23): 2234-2240 (2009) - [c33]Michael Molloy, Bruce A. Reed:
Asymptotically optimal frugal colouring. SODA 2009: 106-114 - [c32]Ken-ichi Kawarabayashi, Bruce A. Reed:
A nearly linear time algorithm for the half integral parity disjoint paths packing problem. SODA 2009: 1183-1192 - [c31]Ken-ichi Kawarabayashi, Bruce A. Reed:
Hadwiger's conjecture is decidable. STOC 2009: 445-454 - 2008
- [j109]Colin McDiarmid, Bruce A. Reed:
On the Maximum Degree of a Random Planar Graph. Comb. Probab. Comput. 17(4): 591-601 (2008) - [j108]Conor Meagher, Bruce A. Reed:
Fractionally total colouring Gn, p. Discret. Appl. Math. 156(7): 1112-1124 (2008) - [j107]Bruce A. Reed:
Skew partitions in perfect graphs. Discret. Appl. Math. 156(7): 1150-1156 (2008) - [j106]Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed:
Degree constrained subgraphs. Discret. Appl. Math. 156(7): 1168-1174 (2008) - [j105]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. Discret. Appl. Math. 156(7): 1175-1180 (2008) - [j104]Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Carlos A. J. Martinhon, Fábio Protti, Bruce A. Reed:
Partition into cliques for cubic graphs: Planar case, complexity and approximation. Discret. Appl. Math. 156(12): 2270-2278 (2008) - [j103]Ken-ichi Kawarabayashi, Bruce A. Reed:
Fractional coloring and the odd Hadwiger's conjecture. Eur. J. Comb. 29(2): 411-417 (2008) - [j102]Omid Amini, Bruce A. Reed:
List Colouring Constants of Triangle Free Graphs. Electron. Notes Discret. Math. 30: 135-140 (2008) - [j101]Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan:
A weaker version of Lovász' path removal conjecture. J. Comb. Theory B 98(5): 972-979 (2008) - [j100]Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour:
Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory B 98(6): 1119-1164 (2008) - [j99]Andrew D. King, Bruce A. Reed:
Bounding chi in terms of omega and delta for quasi-line graphs. J. Graph Theory 59(3): 215-228 (2008) - [j98]Nikolaos Fountoulakis, Bruce A. Reed:
The evolution of the mixing rate of a simple random walk on the giant component of a random graph. Random Struct. Algorithms 33(1): 68-86 (2008) - [j97]Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed:
On Planar Quasi-Parity Graphs. SIAM J. Discret. Math. 22(1): 329-347 (2008) - [c30]Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed:
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. FOCS 2008: 771-780 - [c29]Bruce A. Reed, Zhentao Li:
Optimization and Recognition for K 5-minor Free Graphs in Linear Time. LATIN 2008: 206-215 - [c28]Ken-ichi Kawarabayashi, Bruce A. Reed:
A nearly linear time algorithm for the half integral disjoint paths packing. SODA 2008: 446-454 - [c27]Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni:
L(2, 1)-labelling of graphs. SODA 2008: 621-630 - 2007
- [j96]Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason:
Vertex-Colouring Edge-Weightings. Comb. 27(1): 1-12 (2007) - [j95]Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed:
The Erdös-Pósa Property For Long Circuits. Comb. 27(2): 135-145 (2007) - [j94]Andrew D. King, Bruce A. Reed, Adrian Vetta:
An upper bound for the chromatic number of line graphs. Eur. J. Comb. 28(8): 2182-2187 (2007) - [j93]Andrew D. King, Bruce A. Reed:
Asymptotics of the chromatic number for quasi-line graphs. Electron. Notes Discret. Math. 29: 327-331 (2007) - [j92]Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed:
List Colouring Squares of Planar Graphs. Electron. Notes Discret. Math. 29: 515-519 (2007) - [j91]David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed:
Vašek Chvátal: A Very Short Introduction. Graphs Comb. 23(Supplement-1): 41-65 (2007) - [j90]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate min-max relations for odd cycles in planar graphs. Math. Program. 110(1): 71-91 (2007) - [c26]Arkadev Chattopadhyay, Bruce A. Reed:
Properly 2-Colouring Linear Hypergraphs. APPROX-RANDOM 2007: 395-408 - [c25]William S. Kennedy, Bruce A. Reed:
Fast Skew Partition Recognition. KyotoCGGT 2007: 101-107 - [c24]Dieter Rautenbach, Bruce A. Reed:
Domination in Cubic Graphs of Large Girth. KyotoCGGT 2007: 186-190 - [c23]Ken-ichi Kawarabayashi, Bruce A. Reed:
Computing crossing number in linear time. STOC 2007: 382-390 - 2006
- [j89]Colin McDiarmid, Bruce A. Reed:
Concentration for self-bounding functions and an inequality of Talagrand. Random Struct. Algorithms 29(4): 549-557 (2006) - 2005
- [j88]Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed:
Degree constrained subgraphs. Electron. Notes Discret. Math. 19: 257-263 (2005) - [j87]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. Electron. Notes Discret. Math. 19: 265-271 (2005) - [j86]Conor Meagher, Bruce A. Reed:
Fractionally total colouring Gn, p. Electron. Notes Discret. Math. 19: 297-303 (2005) - [j85]Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
The perfection and recognition of bull-reducible Berge graphs. RAIRO Theor. Informatics Appl. 39(1): 145-160 (2005) - [j84]Babak Farzad, Michael S. O. Molloy, Bruce A. Reed:
(Delta-k)-critical graphs. J. Comb. Theory B 93(2): 173-185 (2005) - [j83]Louigi Addario-Berry, Robert E. L. Aldred, Ketan Dalal, Bruce A. Reed:
Vertex colouring edge partitions. J. Comb. Theory B 94(2): 237-244 (2005) - [j82]David Avis, Caterina De Simone, Bruce A. Reed:
On the fractional chromatic index of a graph and its complement. Oper. Res. Lett. 33(4): 385-388 (2005) - [c22]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate Min-max Relations for Odd Cycles in Planar Graphs. IPCO 2005: 35-50 - [c21]Zhentao Li, Bruce A. Reed:
Heap Building Bounds. WADS 2005: 14-23 - [i1]Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon:
Coloring Artemis graphs. CoRR abs/cs/0504082 (2005) - 2004
- [j81]Bruce A. Reed, Benny Sudakov:
List Colouring When The Chromatic Number Is Close To the Order Of The Graph. Comb. 25(1): 117-123 (2004) - [j80]Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter:
Preface. Discret. Appl. Math. 141(1-3): 1 (2004) - [j79]Simone Dantas, Celina M. H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed:
Stable skew partition problem. Discret. Appl. Math. 143(1-3): 17-22 (2004) - [j78]Bruce A. Reed, Paul D. Seymour:
Hadwiger's conjecture for line graphs. Eur. J. Comb. 25(6): 873-876 (2004) - [j77]Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory B 91(1): 25-41 (2004) - [j76]Guillaume Fertin, André Raspaud, Bruce A. Reed:
Star coloring of graphs. J. Graph Theory 47(3): 163-182 (2004) - [j75]Bruce A. Reed, Kaleigh Smith, Adrian Vetta:
Finding odd cycle transversals. Oper. Res. Lett. 32(4): 299-301 (2004) - [j74]Chính T. Hoàng, Bruce A. Reed:
On the Co-P3-Structure of Perfect Graphs. SIAM J. Discret. Math. 18(3): 571-576 (2004) - 2003
- [j73]Martin Loebl, Jaroslav Nesetril, Bruce A. Reed:
A note on random homomorphism from arbitrary graphs to Z. Discret. Math. 273(1-3): 173-181 (2003) - [j72]Colin McDiarmid, Bruce A. Reed:
Channel assignment on graphs of bounded treewidth. Discret. Math. 273(1-3): 183-192 (2003) - [j71]Bruce A. Reed:
The height of a random binary search tree. J. ACM 50(3): 306-332 (2003) - [j70]Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed:
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48(2): 333-359 (2003) - 2002
- [j69]Colin Cooper, Alan M. Frieze, Bruce A. Reed:
Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Comb. Probab. Comput. 11(3): 249-261 (2002) - [j68]Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan:
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Comb. Probab. Comput. 11(4): 323-341 (2002) - [j67]Bruce A. Reed, Benny Sudakov:
Asymptotically the List Colouring Constants Are 1. J. Comb. Theory B 86(1): 27-37 (2002) - [c20]Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed:
Polynomial time recognition of P4-structure. SODA 2002: 382-389 - 2001
- [j66]Dieter Rautenbach, Bruce A. Reed:
The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. Comb. 21(2): 267-278 (2001) - [j65]Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
Bull-Reducible Berge Graphs are Perfect. Electron. Notes Discret. Math. 10: 93-95 (2001) - [j64]Martin Loebl, Jaroslav Nesetril, Bruce A. Reed:
A note on Random Homomorphism from ArbitraryGraphs to Z. Electron. Notes Discret. Math. 10: 176-180 (2001) - [j63]Colin McDiarmid, Bruce A. Reed:
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs. Electron. Notes Discret. Math. 10: 198-201 (2001) - [j62]Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed:
Recognizing Planar Strict Quasi-Parity Graphs. Graphs Comb. 17(4): 745-757 (2001) - [c19]Dieter Rautenbach, Bruce A. Reed:
Approximately covering by cycles in planar graphs. SODA 2001: 402-406 - [c18]Michael Molloy, Bruce A. Reed:
Colouring graphs when the number of colours is nearly the maximum degree. STOC 2001: 462-470 - [c17]Guillaume Fertin, André Raspaud, Bruce A. Reed:
On Star Coloring of Graphs. WG 2001: 140-153 - 2000
- [j61]Claude Berge, Bruce A. Reed:
Optimal packings of edge-disjoint odd cycles. Discret. Math. 211: 197-202 (2000) - [j60]Michael Molloy, Bruce A. Reed:
k-Colouring when k is close to Delta. Electron. Notes Discret. Math. 5: 235-238 (2000) - [j59]Ljubomir Perkovic, Bruce A. Reed:
An Improved Algorithm for Finding Tree Decompositions of Small Width. Int. J. Found. Comput. Sci. 11(3): 365-371 (2000) - [j58]Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed:
Finding Skew Partitions Efficiently. J. Algorithms 37(2): 505-521 (2000) - [j57]Bruce A. Reed, Robin Thomas:
Clique Minors in Graphs and Their Complements. J. Comb. Theory B 78(1): 81-85 (2000) - [j56]Colin McDiarmid, Bruce A. Reed:
Channel assignment and weighted coloring. Networks 36(2): 114-117 (2000) - [j55]Michael Molloy, Bruce A. Reed:
Near-optimal list colorings. Random Struct. Algorithms 17(3-4): 376-402 (2000) - [c16]Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics:
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). LATIN 2000: 126-134 - [c15]Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed:
Finding Skew Partitions Efficiently. LATIN 2000: 163-172 - [c14]Bruce A. Reed:
How tall is a tree? STOC 2000: 479-483
1990 – 1999
- 1999
- [j54]Bruce A. Reed:
Mangoes and Blueberries. Comb. 19(2): 267-296 (1999) - [j53]Michael Molloy, Bruce A. Reed:
Critical Subgraphs of a Random Graph. Electron. J. Comb. 6 (1999) - [j52]Colin McDiarmid, Bruce A. Reed:
Colouring proximity graphs in the plane. Discret. Math. 199(1-3): 123-137 (1999) - [j51]Bruce A. Reed:
Introducing Directed Tree Width. Electron. Notes Discret. Math. 3: 222-229 (1999) - [j50]Frédéric Maffray, Bruce A. Reed:
A Description of Claw-Free Perfect Graphs. J. Comb. Theory B 75(1): 134-156 (1999) - [j49]Bruce A. Reed:
A Strengthening of Brooks' Theorem. J. Comb. Theory B 76(2): 136-149 (1999) - [j48]Nadimpalli V. R. Mahadev, Bruce A. Reed:
A note on vertex orders for stability number. J. Graph Theory 30(2): 113-120 (1999) - [j47]Bruce A. Reed:
The list colouring constants. J. Graph Theory 31(2): 149-153 (1999) - [j46]Bruce A. Reed:
Edge coloring nearly bipartite graphs. Oper. Res. Lett. 24(1-2): 11-14 (1999) - [c13]Ljubomir Perkovic, Bruce A. Reed:
An Improved Algorithm for Finding Tree Decompositions of Small Width. WG 1999: 148-154 - 1998
- [j45]Michael Molloy, Bruce A. Reed:
A Bound on the Total Chromatic Number. Comb. 18(2): 241-280 (1998) - [j44]Michael Molloy, Bruce A. Reed:
The Size of the Giant Component of a Random Graph with a Given Degree Sequence. Comb. Probab. Comput. 7(3): 295-305 (1998) - [j43]Bruce A. Reed, Paul D. Seymour:
Fractional Colouring and Hadwiger's Conjecture. J. Comb. Theory B 74(2): 147-152 (1998) - [j42]Bruce A. Reed:
ω, Δ, and χ. J. Graph Theory 27(4): 177-212 (1998) - [j41]Hugh Hind, Michael Molloy, Bruce A. Reed:
Total Coloring With Delta + (log Delta) Colors. SIAM J. Comput. 28(3): 816-821 (1998) - [c12]Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed:
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO 1998: 137-152 - [c11]Michael Molloy, Bruce A. Reed:
Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. LATIN 1998: 216-225 - [c10]Michael Molloy, Bruce A. Reed:
Further Algorithmic Aspects of the Local Lemma. STOC 1998: 524-529 - 1997
- [j40]Hugh Hind, Michael Molloy, Bruce A. Reed:
Colouring a Graph Frugally. Comb. 17(4): 469-482 (1997) - [j39]Hazel Everett, Sulamita Klein, Bruce A. Reed:
An Algorithm for Finding Homogeneous Pairs. Discret. Appl. Math. 72(3): 209-218 (1997) - [j38]Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed:
Path parity and perfection. Discret. Math. 165-166: 233-252 (1997) - [j37]Ljubomir Perkovic, Bruce A. Reed:
Edge coloring regular graphs of high degree. Discret. Math. 165-166: 567-578 (1997) - [j36]Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed:
On Planar Perfectly Contractile Graphs. Graphs Comb. 13(2): 167-187 (1997) - [j35]Michael Molloy, Bruce A. Reed:
A Bound on the Strong Chromatic Index of a Graph, . J. Comb. Theory B 69(2): 103-109 (1997) - [c9]Michael S. O. Molloy, Bruce A. Reed, William Steiger:
On the mixing rate of the triangulation walk. Randomization Methods in Algorithm Design 1997: 179-190 - 1996
- [j34]Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas:
Packing Directed Circuits. Comb. 16(4): 535-554 (1996) - [j33]Bruce A. Reed, F. Bruce Shepherd:
The Gallai-Younger Conjecture for Planar Graphs. Comb. 16(4): 555-566 (1996) - [j32]Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed:
Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Comb. Probab. Comput. 5: 1-14 (1996) - [j31]Bruce A. Reed:
Paths, Stars and the Number Three. Comb. Probab. Comput. 5: 277-295 (1996) - [j30]S. E. Markossian, G. S. Gasparian, Bruce A. Reed:
beta-Perfect Graphs. J. Comb. Theory B 67(1): 1-11 (1996) - 1995
- [j29]Alan M. Frieze, Bruce A. Reed:
Covering the Edges of a Random Graph by Cliques. Comb. 15(4): 489-497 (1995) - [j28]Michael H. Albert, Alan M. Frieze, Bruce A. Reed:
Multicoloured Hamilton Cycles. Electron. J. Comb. 2 (1995) - [j27]Colin McDiarmid, Bruce A. Reed:
Almost Every Graph can be Covered by [fracDelta2] Linear Forests. Comb. Probab. Comput. 4: 257-268 (1995) - [j26]Bruce A. Reed:
Rooted Routing in the Plane. Discret. Appl. Math. 57(2-3): 213-227 (1995) - [j25]B. Gamble, William R. Pulleyblank, Bruce A. Reed, F. Bruce Shepherd:
Right angle free subsets in the plane. Graphs Comb. 11(2): 121-129 (1995) - [j24]Bruce A. Reed, Najiba Sbihi:
Recognizing bull-free perfect graphs. Graphs Comb. 11(2): 171-178 (1995) - [j23]Michael Molloy, Bruce A. Reed:
A Critical Point for Random Graphs with a Given Degree Sequence. Random Struct. Algorithms 6(2/3): 161-180 (1995) - [j22]Michael Molloy, Bruce A. Reed:
The Dominating Number of Random Cubic Graph. Random Struct. Algorithms 7(3): 209-222 (1995) - [j21]Alan M. Frieze, Richard M. Karp, Bruce A. Reed:
When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? SIAM J. Comput. 24(3): 484-493 (1995) - [j20]Luc Devroye, Bruce A. Reed:
On the Variance of the Height of Random Binary Search Trees. SIAM J. Comput. 24(6): 1157-1162 (1995) - 1994
- [j19]Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd:
Induced Circuits in Planar Graphs. J. Comb. Theory B 60(2): 169-176 (1994) - 1993
- [j18]Kyriakos Kilakos, Bruce A. Reed:
Fractionally colouring total graphs. Comb. 13(4): 435-440 (1993) - [j17]Alan M. Frieze, Bruce A. Reed:
Polychromatic Hamilton cycles. Discret. Math. 118(1-3): 69-74 (1993) - [j16]Colin J. H. McDiarmid, Bruce A. Reed:
On Total Colorings of Graphs. J. Comb. Theory B 57(1): 122-130 (1993) - [j15]Gérard Cornuéjols, Bruce A. Reed:
Complete Multi-partite Cutsets in Minimal Imperfect Graphs. J. Comb. Theory B 59(2): 191-198 (1993) - 1992
- [j14]Noga Alon, Colin McDiarmid, Bruce A. Reed:
Star arboricity. Comb. 12(4): 375-380 (1992) - [j13]Bruce A. Reed, Colin McDiarmid:
The Strongly Connected Components of 1-in, 1-out. Comb. Probab. Comput. 1: 265-274 (1992) - [c8]Vasek Chvátal, Bruce A. Reed:
Mick Gets Some (the Odds Are on His Side). FOCS 1992: 620-627 - [c7]Alan M. Frieze, Richard M. Karp, Bruce A. Reed:
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? IPCO 1992: 453-461 - [c6]Bruce A. Reed:
Finding Approximate Separators and Computing Tree Width Quickly. STOC 1992: 221-228 - [c5]Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd:
Non-Interfering Network Flows. SWAT 1992: 245-257 - 1991
- [j12]Noga Alon, Colin McDiarmid, Bruce A. Reed:
Acyclic Coloring of Graphs. Random Struct. Algorithms 2(3): 277-288 (1991) - [c4]Bruce A. Reed:
Counterexamples to a conjecture of Las Vergnas and Meyniel. Graph Structure Theory 1991: 157-159 - [c3]Béla Bollobás, Bruce A. Reed, Andrew Thomason:
An extremal function for the achromatic number. Graph Structure Theory 1991: 161-165 - [c2]Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour:
Finding disjoint trees in planar graphs in linear time. Graph Structure Theory 1991: 295-301 - 1990
- [j11]Colin McDiarmid, Bruce A. Reed:
Linear Arboricity of Random Regular Graphs. Random Struct. Algorithms 1(4): 443-447 (1990) - [j10]Alan M. Frieze, Colin McDiarmid, Bruce A. Reed:
Greedy Matching on the Line. SIAM J. Comput. 19(4): 666-672 (1990) - [c1]Bruce A. Reed:
Perfection, Parity, Planarity, and Packing Paths. IPCO 1990: 407-419
1980 – 1989
- 1989
- [j9]Chính T. Hoàng, Bruce A. Reed:
P4-comparability graphs. Discret. Math. 74(1-2): 173-200 (1989) - [j8]Colin McDiarmid, Bruce A. Reed:
Building Heaps Fast. J. Algorithms 10(3): 352-365 (1989) - [j7]Chính T. Hoàng, Bruce A. Reed:
Some classes of perfectly orderable graphs. J. Graph Theory 13(4): 445-463 (1989) - 1988
- [j6]Alan M. Frieze, Bill Jackson, Colin J. H. McDiarmid, Bruce A. Reed:
Edge-colouring random graphs. J. Comb. Theory B 45(2): 135-149 (1988) - [j5]Clyde L. Monma, Bruce A. Reed, William T. Trotter:
Threshold tolerance graphs. J. Graph Theory 12(3): 343-362 (1988) - 1987
- [j4]Bruce A. Reed:
A note on even pairs. Discret. Math. 65(3): 317-318 (1987) - [j3]Chính T. Hoàng, Bruce A. Reed:
A note on short cycles in diagraphs. Discret. Math. 66(1-2): 103-107 (1987) - [j2]Bruce A. Reed:
A semi-strong Perfect Graph theorem. J. Comb. Theory B 43(2): 223-240 (1987) - 1985
- [j1]Bruce A. Reed:
A note on the semi-strong perfect graph conjecture. Discret. Math. 54(1): 111-112 (1985)
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 2025-01-21 00:15 CET 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:
