Bruce A. Reed

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 25

Top Venues

CoRR

J. Graph Theory

Comb. Probab. Comput.

Random Struct. Algorithms

Publications

John Iacono, Piotr Micek, Pat Morin, Bruce A. Reed
Vertex Ranking of Degenerate Graphs. CoRR (2024)
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 (2023)
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) (2023)
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) (2023)
Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid
Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. 28 (3) (2021)
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 (2021)
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, Ser. B 142 (2020)
János Pach, Bruce A. Reed, Yelena Yuditsky
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Discret. Comput. Geom. 63 (4) (2020)
Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid
Tight Bounds on The Clique Chromatic Number. CoRR (2020)
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) (2020)
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) (2020)
Tony Huynh, Bruce A. Reed, David R. Wood, Liana Yepremyan
Notes on Tree- and Path-chromatic Number. CoRR (2020)
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 (2019)
Bruce A. Reed, Alex Scott, Paul D. Seymour
Near-domination in graphs. J. Comb. Theory, Ser. A 165 (2019)
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) (2019)
János Pach, Bruce A. Reed, Yelena Yuditsky
Almost all string graphs are intersection graphs of plane convex sets. CoRR (2018)
János Pach, Bruce A. Reed, Yelena Yuditsky
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. SoCG (2018)
Guillem Perarnau, Bruce A. Reed
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Comb. Probab. Comput. 26 (3) (2017)
Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed
Notes on Growing a Tree in a Graph. CoRR (2017)
Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts
Acyclic edge colourings of graphs with large girth. Random Struct. Algorithms 50 (4) (2017)
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)
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 (2016)
Andrew D. King, Bruce A. Reed
A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω. J. Graph Theory 81 (1) (2016)
Bruce A. Reed, David R. Wood
Forcing a sparse minor. Comb. Probab. Comput. 25 (2) (2016)
Bruce A. Reed, David R. Wood
'Forcing a sparse minor' - CORRIGENDUM. Comb. Probab. Comput. 25 (2) (2016)
Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed
Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time. CoRR (2015)
Andrew D. King, Bruce A. Reed
Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ. J. Graph Theory 78 (3) (2015)
Bruce A. Reed
Connectivity Preserving Iterative Compression. CCCG (2015)
Jonathan A. Noel, Bruce A. Reed, Hehui Wu
A Proof of a Conjecture of Ohba. J. Graph Theory 79 (2) (2015)
Maria Chudnovsky, Sergey Norin, Bruce A. Reed, Paul D. Seymour
Excluding a Substar and an Antisubstar. SIAM J. Discret. Math. 29 (1) (2015)
Michael Molloy, Bruce A. Reed
Colouring graphs when the number of colours is almost the maximum degree. J. Comb. Theory, Ser. B 109 (2014)
Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed
Removable paths and cycles with parity constraints. J. Comb. Theory, Ser. B 106 (2014)
Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts
Acyclic edge colourings of graphs with large girth. CoRR (2014)
Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott
-free graphs have a linear homogeneous set. Random Struct. Algorithms 45 (3) (2014)
Peter Keevash, Zhentao Li, Bojan Mohar, Bruce A. Reed
Digraph Girth via Chromatic Number. SIAM J. Discret. Math. 27 (2) (2013)
Andrew D. King, Bruce A. Reed
Asymptotics of the Chromatic Number for Quasi-Line Graphs. J. Graph Theory 73 (3) (2013)
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 (2013)
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) (2013)
Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed
A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. SODA (2013)
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) (2013)
Andrew D. King, Bruce A. Reed
Claw-free graphs, skeletal graphs, and a stronger conjecture on $ω$, $Δ$, and $χ$ CoRR (2012)
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) (2012)
Jonathan A. Noel, Bruce A. Reed, Hehui Wu
A Proof of a Conjecture of Ohba CoRR (2012)
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) (2012)
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 (2012)
Bruce A. Reed, David R. Wood
Polynomial treewidth forces a large grid-like-minor. Eur. J. Comb. 33 (3) (2012)
Andrew D. King, Bruce A. Reed
A short proof that χ can be bounded ε away from Δ+1 towards ω CoRR (2012)
Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed
Connectivity for Bridge-Addable Monotone Graph Classes. Comb. Probab. Comput. 21 (6) (2012)
Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed
The disjoint paths problem in quadratic time. J. Comb. Theory, Ser. B 102 (2) (2012)
Maria Chudnovsky, Bruce A. Reed, Paul D. Seymour
minors. J. Comb. Theory, Ser. B 101 (1) (2011)
Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan
The Graph Minor Algorithm with Parity Conditions. FOCS (2011)
Andrew D. King, Bruce A. Reed
Asymptotics of the chromatic number for quasi-line graphs CoRR (2011)
Bruce A. Reed
Graph Coloring via The Probabilistic Method. SODA (2011)
Ken-ichi Kawarabayashi, Bruce A. Reed
An (almost) Linear Time Algorithm for Odd Cyles Transversal. SODA (2010)
Michael Molloy, Bruce A. Reed
Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246]. J. Comb. Theory, Ser. B 100 (2) (2010)
Ken-ichi Kawarabayashi, Bruce A. Reed
Odd cycle packing. STOC (2010)
Michael Molloy, Bruce A. Reed
Asymptotically optimal frugal colouring. J. Comb. Theory, Ser. B 100 (2) (2010)
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) (2010)
Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed
-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. SODA (2010)
Ken-ichi Kawarabayashi, Bruce A. Reed
A Separator Theorem in Minor-Closed Classes. FOCS (2010)
Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee
Removable cycles in non-bipartite graphs. J. Comb. Theory, Ser. B 99 (1) (2009)
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) (2009)
Ken-ichi Kawarabayashi, Bruce A. Reed
Hadwiger's conjecture is decidable. STOC (2009)
Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta
On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory, Ser. B 99 (1) (2009)
W. Sean Kennedy, Conor Meagher, Bruce A. Reed
Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time. Electron. Notes Discret. Math. 34 (2009)
Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed
Tree-width of graphs without a 3×3 grid minor. Discret. Appl. Math. 157 (12) (2009)
Louigi Addario-Berry, Nicolas Broutin, Bruce A. Reed
Critical random graphs and the structure of a minimum spanning tree. Random Struct. Algorithms 35 (3) (2009)
Ken-ichi Kawarabayashi, Bruce A. Reed
Highly parity linked graphs. Comb. 29 (2) (2009)
Michael Molloy, Bruce A. Reed
Asymptotically optimal frugal colouring. SODA (2009)
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 (2009)
Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
Coloring Artemis graphs. Theor. Comput. Sci. 410 (21-23) (2009)
Ken-ichi Kawarabayashi, Bruce A. Reed
A nearly linear time algorithm for the half integral parity disjoint paths packing problem. SODA (2009)
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 (2009)
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)
Omid Amini, Bruce A. Reed
List Colouring Constants of Triangle Free Graphs. Electron. Notes Discret. Math. 30 (2008)
Bruce A. Reed
Skew partitions in perfect graphs. Discret. Appl. Math. 156 (7) (2008)
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
Planar graph bipartization in linear time. Discret. Appl. Math. 156 (7) (2008)
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, Ser. B 98 (6) (2008)
Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni
L(2, 1)-labelling of graphs. SODA (2008)
Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed
Degree constrained subgraphs. Discret. Appl. Math. 156 (7) (2008)
Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan
A weaker version of Lovász' path removal conjecture. J. Comb. Theory, Ser. B 98 (5) (2008)
Conor Meagher, Bruce A. Reed
. Discret. Appl. Math. 156 (7) (2008)
Bruce A. Reed, Zhentao Li
Optimization and Recognition for K 5-minor Free Graphs in Linear Time. LATIN (2008)
Colin McDiarmid, Bruce A. Reed
On the Maximum Degree of a Random Planar Graph. Comb. Probab. Comput. 17 (4) (2008)
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) (2008)
Ken-ichi Kawarabayashi, Bruce A. Reed
A nearly linear time algorithm for the half integral disjoint paths packing. SODA (2008)
Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
On Planar Quasi-Parity Graphs. SIAM J. Discret. Math. 22 (1) (2008)
Andrew D. King, Bruce A. Reed
Bounding chi in terms of omega and delta for quasi-line graphs. J. Graph Theory 59 (3) (2008)
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) (2008)
Ken-ichi Kawarabayashi, Bruce A. Reed
Fractional coloring and the odd Hadwiger's conjecture. Eur. J. Comb. 29 (2) (2008)
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
Approximate min-max relations for odd cycles in planar graphs. Math. Program. 110 (1) (2007)
William S. Kennedy, Bruce A. Reed
Fast Skew Partition Recognition. KyotoCGGT (2007)
David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed
Vašek Chvátal: A Very Short Introduction. Graphs Comb. 23 (Supplement-1) (2007)
Dieter Rautenbach, Bruce A. Reed
Domination in Cubic Graphs of Large Girth. KyotoCGGT (2007)
Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed
The Erdös-Pósa Property For Long Circuits. Comb. 27 (2) (2007)
Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed
List Colouring Squares of Planar Graphs. Electron. Notes Discret. Math. 29 (2007)
Arkadev Chattopadhyay, Bruce A. Reed
Properly 2-Colouring Linear Hypergraphs. APPROX-RANDOM (2007)
Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason
Vertex-Colouring Edge-Weightings. Comb. 27 (1) (2007)
Ken-ichi Kawarabayashi, Bruce A. Reed
Computing crossing number in linear time. STOC (2007)
Andrew D. King, Bruce A. Reed, Adrian Vetta
An upper bound for the chromatic number of line graphs. Eur. J. Comb. 28 (8) (2007)

Bruce A. Reed.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bruce A. Reed