Bruce A. Reed - RankMe

219 papers A* 24B 11C 3Journal 172Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Embedding nearly spanning trees. Comb. Probab. Comput. Bruce A. Reed, Maya Stein
2024	J	`jnl`	Vertex Ranking of Degenerate Graphs. CoRR John Iacono, Piotr Micek, Pat Morin, Bruce A. Reed
2023	J	`jnl`	Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result. J. Graph Theory Bruce A. Reed, Maya Stein
2023	J	`jnl`	Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result. J. Graph Theory Bruce A. Reed, Maya Stein
2023	J	`jnl`	The speed and threshold of the biased perfect matching and Hamilton cycle games. Discret. Appl. Math. Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone
2021	J	`jnl`	Cops and robbers on oriented toroidal grids. Theor. Comput. Sci. Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed
2021	C	`conf`	Partitioning Into Prescribed Number of Cycles and Mod LAGOS Jordan Barrett, Salomon Bendayan, Yanjia Li, Bruce A. Reed
2021	C	`conf`	The Speed and Threshold of the Biased Hamilton Cycle Game. LAGOS Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone
2021	C	`conf`	The Speed and Threshold of the Biased Perfect Matching Game. LAGOS Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone
2021	J	`jnl`	Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid
2020	J	`jnl`	A Lower Bound on the Average Degree Forcing a Minor. Electron. J. Comb. Sergey Norin, Bruce A. Reed, Andrew Thomason, David R. Wood
2020	J	`jnl`	A variant of the Erdős-Sós conjecture. J. Graph Theory Frédéric Havet, Bruce A. Reed, Maya Stein, David R. Wood
2020	J	`jnl`	Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Discret. Comput. Geom. János Pach, Bruce A. Reed, Yelena Yuditsky
2020	J	`jnl`	Corrigendum to "Bisimplicial vertices in even-hole-free graphs". J. Comb. Theory B Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour
2020	J	`jnl`	Notes on Tree- and Path-chromatic Number. CoRR Tony Huynh, Bruce A. Reed, David R. Wood, Liana Yepremyan
2020	J	`jnl`	Tight Bounds on The Clique Chromatic Number. CoRR Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid
2019	J	`jnl`	Cops and robbers on oriented toroidal grids. CoRR Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed
2019	A*	`conf`	Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. SODA David Eppstein, Bruce A. Reed
2019	J	`jnl`	Near-domination in graphs. J. Comb. Theory A Bruce A. Reed, Alex Scott, Paul D. Seymour
2019	J	`jnl`	Notes on growing a tree in a graph. Random Struct. Algorithms Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed
2018	A*	`conf`	Almost All String Graphs are Intersection Graphs of Plane Convex Sets. SoCG János Pach, Bruce A. Reed, Yelena Yuditsky
2018	J	`jnl`	Almost all string graphs are intersection graphs of plane convex sets. CoRR János Pach, Bruce A. Reed, Yelena Yuditsky
2018	J	`jnl`	Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. CoRR David Eppstein, Bruce A. Reed
2018	J	`jnl`	Polyhedral results on the stable set problem in graphs containing even or odd pairs. Math. Program. Jonas T. Witt, Marco E. Lübbecke, Bruce A. Reed
2017	J	`jnl`	Acyclic edge colourings of graphs with large girth. Random Struct. Algorithms Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts
2017	J	`jnl`	Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Comb. Probab. Comput. Guillem Perarnau, Bruce A. Reed
2017	J	`jnl`	Notes on Growing a Tree in a Graph. CoRR Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed
2016	J	`jnl`	'Forcing a sparse minor' - CORRIGENDUM. Comb. Probab. Comput. Bruce A. Reed, David R. Wood
2016	J	`jnl`	A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω. J. Graph Theory Andrew D. King, Bruce A. Reed
2016	J	`jnl`	Forcing a sparse minor. Comb. Probab. Comput. Bruce A. Reed, David R. Wood
2016	A*	`conf`	How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. FOCS Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed
2016	J	`jnl`	How to determine if a random graph with a fixed degree sequence has a giant component. CoRR Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed
2015	J	`jnl`	A Proof of a Conjecture of Ohba. J. Graph Theory Jonathan A. Noel, Bruce A. Reed, Hehui Wu
2015	J	`jnl`	Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ. J. Graph Theory Andrew D. King, Bruce A. Reed
2015	J	`jnl`	Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time. CoRR Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed
2015	—	`conf`	Connectivity Preserving Iterative Compression. CCCG Bruce A. Reed
2015	J	`jnl`	Excluding a Substar and an Antisubstar. SIAM J. Discret. Math. Maria Chudnovsky, Sergey Norin, Bruce A. Reed, Paul D. Seymour
2014	J	`jnl`	Acyclic edge colourings of graphs with large girth. CoRR Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts
2014	J	`jnl`	Colouring graphs when the number of colours is almost the maximum degree. J. Comb. Theory B Michael Molloy, Bruce A. Reed
2014	J	`jnl`	For most graphs Random Struct. Algorithms Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott
2014	J	`jnl`	Removable paths and cycles with parity constraints. J. Comb. Theory B Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed
2013	J	`jnl`	A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. SIAM J. Discret. Math. Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood
2013	A*	`conf`	A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. SODA Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed
2013	J	`jnl`	Asymptotics of the Chromatic Number for Quasi-Line Graphs. J. Graph Theory Andrew D. King, Bruce A. Reed
2013	J	`jnl`	Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond. Electron. Notes Discret. Math. Jonathan A. Noel, Bruce A. Reed, Douglas B. West, Hehui Wu, Xuding Zhu
2013	J	`jnl`	Digraph Girth via Chromatic Number. SIAM J. Discret. Math. Peter Keevash, Zhentao Li, Bojan Mohar, Bruce A. Reed
2013	J	`jnl`	Oriented trees in digraphs. Discret. Math. Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce A. Reed, Stéphan Thomassé
2012	J	`jnl`	A Proof of a Conjecture of Ohba CoRR Jonathan A. Noel, Bruce A. Reed, Hehui Wu
2012	J	`jnl`	A linear-time algorithm for finding a complete graph minor in a dense graph CoRR Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood
2012	J	`jnl`	A short proof that χ can be bounded ε away from Δ+1 towards ω CoRR Andrew D. King, Bruce A. Reed
2012	J	`jnl`	Claw-free graphs, skeletal graphs, and a stronger conjecture on $ω$, $Δ$, and $χ$ CoRR Andrew D. King, Bruce A. Reed
2012	J	`jnl`	Connectivity for Bridge-Addable Monotone Graph Classes. Comb. Probab. Comput. Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed
2012	J	`jnl`	Griggs and Yeh's Conjecture and L(p, 1)-labelings. SIAM J. Discret. Math. Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni
2012	J	`jnl`	Polynomial treewidth forces a large grid-like-minor. Eur. J. Comb. Bruce A. Reed, David R. Wood
2012	J	`jnl`	Polynomial-time recognition of clique-width ≤3 graphs. Discret. Appl. Math. Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics
2012	J	`jnl`	The disjoint paths problem in quadratic time. J. Comb. Theory B Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed
2011	J	`jnl`	Asymptotics of the chromatic number for quasi-line graphs CoRR Andrew D. King, Bruce A. Reed
2011	A*	`conf`	Graph Coloring via The Probabilistic Method. SODA Bruce A. Reed
2011	A*	`conf`	The Graph Minor Algorithm with Parity Conditions. FOCS Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan
2011	J	`jnl`	The edge-density for K J. Comb. Theory B Maria Chudnovsky, Bruce A. Reed, Paul D. Seymour
2010	A*	`conf`	A Separator Theorem in Minor-Closed Classes. FOCS Ken-ichi Kawarabayashi, Bruce A. Reed
2010	A*	`conf`	An (almost) Linear Time Algorithm for Odd Cyles Transversal. SODA Ken-ichi Kawarabayashi, Bruce A. Reed
2010	J	`jnl`	Asymptotically optimal frugal colouring. J. Comb. Theory B Michael Molloy, Bruce A. Reed
2010	J	`jnl`	Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246]. J. Comb. Theory B Michael Molloy, Bruce A. Reed
2010	J	`jnl`	Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. Discret. Appl. Math. Louigi Addario-Berry, W. Sean Kennedy, Andrew D. King, Zhentao Li, Bruce A. Reed
2010	A*	`conf`	Odd cycle packing. STOC Ken-ichi Kawarabayashi, Bruce A. Reed
2010	A*	`conf`	Recognizing a Totally Odd K SODA Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed
2009	J	`jnl`	A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2. Electron. Notes Discret. Math. Takehiro Ito, W. Sean Kennedy, Bruce A. Reed
2009	J	`jnl`	A general critical condition for the emergence of a giant component in random graphs with given degrees. Electron. Notes Discret. Math. Nikolaos Fountoulakis, Bruce A. Reed
2009	J	`jnl`	A linear-time algorithm to find a separator in a graph excluding a minor. ACM Trans. Algorithms Bruce A. Reed, David R. Wood
2009	A*	`conf`	A nearly linear time algorithm for the half integral parity disjoint paths packing problem. SODA Ken-ichi Kawarabayashi, Bruce A. Reed
2009	A*	`conf`	Asymptotically optimal frugal colouring. SODA Michael Molloy, Bruce A. Reed
2009	J	`jnl`	Coloring Artemis graphs. Theor. Comput. Sci. Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
2009	J	`jnl`	Critical random graphs and the structure of a minimum spanning tree. Random Struct. Algorithms Louigi Addario-Berry, Nicolas Broutin, Bruce A. Reed
2009	J	`jnl`	Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time. Electron. Notes Discret. Math. W. Sean Kennedy, Conor Meagher, Bruce A. Reed
2009	A*	`conf`	Hadwiger's conjecture is decidable. STOC Ken-ichi Kawarabayashi, Bruce A. Reed
2009	J	`jnl`	Highly parity linked graphs. Comb. Ken-ichi Kawarabayashi, Bruce A. Reed
2009	J	`jnl`	On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory B Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta
2009	J	`jnl`	Removable cycles in non-bipartite graphs. J. Comb. Theory B Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee
2009	J	`jnl`	Tree-width of graphs without a 3×3 grid minor. Discret. Appl. Math. Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed
2008	A*	`conf`	A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. FOCS Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed
2008	A*	`conf`	A nearly linear time algorithm for the half integral disjoint paths packing. SODA Ken-ichi Kawarabayashi, Bruce A. Reed
2008	J	`jnl`	A weaker version of Lovász' path removal conjecture. J. Comb. Theory B Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan
2008	J	`jnl`	Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory B Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour
2008	J	`jnl`	Bounding chi in terms of omega and delta for quasi-line graphs. J. Graph Theory Andrew D. King, Bruce A. Reed
2008	J	`jnl`	Degree constrained subgraphs. Discret. Appl. Math. Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed
2008	J	`jnl`	Fractional coloring and the odd Hadwiger's conjecture. Eur. J. Comb. Ken-ichi Kawarabayashi, Bruce A. Reed
2008	J	`jnl`	Fractionally total colouring G Discret. Appl. Math. Conor Meagher, Bruce A. Reed
2008	A*	`conf`	L(2, 1)-labelling of graphs. SODA Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni
2008	J	`jnl`	List Colouring Constants of Triangle Free Graphs. Electron. Notes Discret. Math. Omid Amini, Bruce A. Reed
2008	J	`jnl`	On Planar Quasi-Parity Graphs. SIAM J. Discret. Math. Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
2008	J	`jnl`	On the Maximum Degree of a Random Planar Graph. Comb. Probab. Comput. Colin McDiarmid, Bruce A. Reed
2008	B	`conf`	Optimization and Recognition for K 5-minor Free Graphs in Linear Time. LATIN Bruce A. Reed, Zhentao Li
2008	J	`jnl`	Partition into cliques for cubic graphs: Planar case, complexity and approximation. Discret. Appl. Math. Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Carlos A. J. Martinhon, Fábio Protti, Bruce A. Reed
2008	J	`jnl`	Planar graph bipartization in linear time. Discret. Appl. Math. Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
2008	J	`jnl`	Skew partitions in perfect graphs. Discret. Appl. Math. Bruce A. Reed
2008	J	`jnl`	The evolution of the mixing rate of a simple random walk on the giant component of a random graph. Random Struct. Algorithms Nikolaos Fountoulakis, Bruce A. Reed
2007	J	`jnl`	An upper bound for the chromatic number of line graphs. Eur. J. Comb. Andrew D. King, Bruce A. Reed, Adrian Vetta
2007	J	`jnl`	Approximate min-max relations for odd cycles in planar graphs. Math. Program. Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
2007	J	`jnl`	Asymptotics of the chromatic number for quasi-line graphs. Electron. Notes Discret. Math. Andrew D. King, Bruce A. Reed
2007	A*	`conf`	Computing crossing number in linear time. STOC Ken-ichi Kawarabayashi, Bruce A. Reed
2007	—	`conf`	Domination in Cubic Graphs of Large Girth. KyotoCGGT Dieter Rautenbach, Bruce A. Reed
2007	—	`conf`	Fast Skew Partition Recognition. KyotoCGGT William S. Kennedy, Bruce A. Reed
2007	J	`jnl`	List Colouring Squares of Planar Graphs. Electron. Notes Discret. Math. Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed
2007	—	`conf`	Properly 2-Colouring Linear Hypergraphs. APPROX-RANDOM Arkadev Chattopadhyay, Bruce A. Reed
2007	J	`jnl`	The Erdös-Pósa Property For Long Circuits. Comb. Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed
2007	J	`jnl`	Vašek Chvátal: A Very Short Introduction. Graphs Comb. David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed
2007	J	`jnl`	Vertex-Colouring Edge-Weightings. Comb. Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason
2006	J	`jnl`	Concentration for self-bounding functions and an inequality of Talagrand. Random Struct. Algorithms Colin McDiarmid, Bruce A. Reed
2005	J	`jnl`	( J. Comb. Theory B Babak Farzad, Michael S. O. Molloy, Bruce A. Reed
2005	B	`conf`	Approximate Min-max Relations for Odd Cycles in Planar Graphs. IPCO Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
2005	J	`jnl`	Coloring Artemis graphs CoRR Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
2005	J	`jnl`	Degree constrained subgraphs. Electron. Notes Discret. Math. Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed
2005	J	`jnl`	Fractionally total colouring G Electron. Notes Discret. Math. Conor Meagher, Bruce A. Reed
2005	B	`conf`	Heap Building Bounds. WADS Zhentao Li, Bruce A. Reed
2005	J	`jnl`	On the fractional chromatic index of a graph and its complement. Oper. Res. Lett. David Avis, Caterina De Simone, Bruce A. Reed
2005	J	`jnl`	Planar graph bipartization in linear time. Electron. Notes Discret. Math. Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
2005	J	`jnl`	The perfection and recognition of bull-reducible Berge graphs. RAIRO Theor. Informatics Appl. Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed
2005	J	`jnl`	Vertex colouring edge partitions. J. Comb. Theory B Louigi Addario-Berry, Robert E. L. Aldred, Ketan Dalal, Bruce A. Reed
2004	J	`jnl`	Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory B Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan
2004	J	`jnl`	Finding odd cycle transversals. Oper. Res. Lett. Bruce A. Reed, Kaleigh Smith, Adrian Vetta
2004	J	`jnl`	Hadwiger's conjecture for line graphs. Eur. J. Comb. Bruce A. Reed, Paul D. Seymour
2004	J	`jnl`	List Colouring When The Chromatic Number Is Close To the Order Of The Graph. Comb. Bruce A. Reed, Benny Sudakov
2004	J	`jnl`	On the Co-P SIAM J. Discret. Math. Chính T. Hoàng, Bruce A. Reed
2004	J	`jnl`	Preface. Discret. Appl. Math. Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter
2004	J	`jnl`	Stable skew partition problem. Discret. Appl. Math. Simone Dantas, Celina M. H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed
2004	J	`jnl`	Star coloring of graphs. J. Graph Theory Guillaume Fertin, André Raspaud, Bruce A. Reed
2003	J	`jnl`	A note on random homomorphism from arbitrary graphs to Z. Discret. Math. Martin Loebl, Jaroslav Nesetril, Bruce A. Reed
2003	J	`jnl`	Channel assignment on graphs of bounded treewidth. Discret. Math. Colin McDiarmid, Bruce A. Reed
2003	J	`jnl`	Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
2003	J	`jnl`	The height of a random binary search tree. J. ACM Bruce A. Reed
2002	J	`jnl`	Asymptotically the List Colouring Constants Are 1. J. Comb. Theory B Bruce A. Reed, Benny Sudakov
2002	A*	`conf`	Polynomial time recognition of P4-structure. SODA Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed
2002	J	`jnl`	Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Bruce A. Reed
2002	J	`jnl`	Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan
2001	J	`jnl`	A note on Random Homomorphism from ArbitraryGraphs to Z. Electron. Notes Discret. Math. Martin Loebl, Jaroslav Nesetril, Bruce A. Reed
2001	A*	`conf`	Approximately covering by cycles in planar graphs. SODA Dieter Rautenbach, Bruce A. Reed
2001	J	`jnl`	Bull-Reducible Berge Graphs are Perfect. Electron. Notes Discret. Math. Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed
2001	J	`jnl`	Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs. Electron. Notes Discret. Math. Colin McDiarmid, Bruce A. Reed
2001	A*	`conf`	Colouring graphs when the number of colours is nearly the maximum degree. STOC Michael Molloy, Bruce A. Reed
2001	B	`conf`	On Star Coloring of Graphs. WG Guillaume Fertin, André Raspaud, Bruce A. Reed
2001	J	`jnl`	Recognizing Planar Strict Quasi-Parity Graphs. Graphs Comb. Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
2001	J	`jnl`	The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. Comb. Dieter Rautenbach, Bruce A. Reed
2000	J	`jnl`	An Improved Algorithm for Finding Tree Decompositions of Small Width. Int. J. Found. Comput. Sci. Ljubomir Perkovic, Bruce A. Reed
2000	J	`jnl`	Channel assignment and weighted coloring. Networks Colin McDiarmid, Bruce A. Reed
2000	J	`jnl`	Clique Minors in Graphs and Their Complements. J. Comb. Theory B Bruce A. Reed, Robin Thomas
2000	B	`conf`	Finding Skew Partitions Efficiently. LATIN Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
2000	J	`jnl`	Finding Skew Partitions Efficiently. J. Algorithms Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
2000	A*	`conf`	How tall is a tree? STOC Bruce A. Reed
2000	J	`jnl`	Near-optimal list colorings. Random Struct. Algorithms Michael Molloy, Bruce A. Reed
2000	J	`jnl`	Optimal packings of edge-disjoint odd cycles. Discret. Math. Claude Berge, Bruce A. Reed
2000	B	`conf`	Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). LATIN Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics
2000	J	`jnl`	k-Colouring when k is close to Delta. Electron. Notes Discret. Math. Michael Molloy, Bruce A. Reed
1999	J	`jnl`	A Description of Claw-Free Perfect Graphs. J. Comb. Theory B Frédéric Maffray, Bruce A. Reed
1999	J	`jnl`	A Strengthening of Brooks' Theorem. J. Comb. Theory B Bruce A. Reed
1999	J	`jnl`	A note on vertex orders for stability number. J. Graph Theory Nadimpalli V. R. Mahadev, Bruce A. Reed
1999	B	`conf`	An Improved Algorithm for Finding Tree Decompositions of Small Width. WG Ljubomir Perkovic, Bruce A. Reed
1999	J	`jnl`	Colouring proximity graphs in the plane. Discret. Math. Colin McDiarmid, Bruce A. Reed
1999	J	`jnl`	Critical Subgraphs of a Random Graph. Electron. J. Comb. Michael Molloy, Bruce A. Reed
1999	J	`jnl`	Edge coloring nearly bipartite graphs. Oper. Res. Lett. Bruce A. Reed
1999	J	`jnl`	Introducing Directed Tree Width. Electron. Notes Discret. Math. Bruce A. Reed
1999	J	`jnl`	Mangoes and Blueberries. Comb. Bruce A. Reed
1999	J	`jnl`	The list colouring constants. J. Graph Theory Bruce A. Reed
1998	J	`jnl`	A Bound on the Total Chromatic Number. Comb. Michael Molloy, Bruce A. Reed
1998	B	`conf`	Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. LATIN Michael Molloy, Bruce A. Reed
1998	J	`jnl`	Fractional Colouring and Hadwiger's Conjecture. J. Comb. Theory B Bruce A. Reed, Paul D. Seymour
1998	A*	`conf`	Further Algorithmic Aspects of the Local Lemma. STOC Michael Molloy, Bruce A. Reed
1998	B	`conf`	Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
1998	J	`jnl`	The Size of the Giant Component of a Random Graph with a Given Degree Sequence. Comb. Probab. Comput. Michael Molloy, Bruce A. Reed
1998	J	`jnl`	Total Coloring With Delta + (log Delta) Colors. SIAM J. Comput. Hugh Hind, Michael Molloy, Bruce A. Reed
1998	J	`jnl`	ω, Δ, and χ. J. Graph Theory Bruce A. Reed
1997	J	`jnl`	A Bound on the Strong Chromatic Index of a Graph J. Comb. Theory B Michael Molloy, Bruce A. Reed
1997	J	`jnl`	An Algorithm for Finding Homogeneous Pairs. Discret. Appl. Math. Hazel Everett, Sulamita Klein, Bruce A. Reed
1997	J	`jnl`	Colouring a Graph Frugally. Comb. Hugh Hind, Michael Molloy, Bruce A. Reed
1997	J	`jnl`	Edge coloring regular graphs of high degree. Discret. Math. Ljubomir Perkovic, Bruce A. Reed
1997	J	`jnl`	On Planar Perfectly Contractile Graphs. Graphs Comb. Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
1997	—	`conf`	On the mixing rate of the triangulation walk. Randomization Methods in Algorithm Design Michael S. O. Molloy, Bruce A. Reed, William Steiger
1997	J	`jnl`	Path parity and perfection. Discret. Math. Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed
1996	J	`jnl`	Packing Directed Circuits. Comb. Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas
1996	J	`jnl`	Paths, Stars and the Number Three. Comb. Probab. Comput. Bruce A. Reed
1996	J	`jnl`	Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed
1996	J	`jnl`	The Gallai-Younger Conjecture for Planar Graphs. Comb. Bruce A. Reed, F. Bruce Shepherd
1995	J	`jnl`	A Critical Point for Random Graphs with a Given Degree Sequence. Random Struct. Algorithms Michael Molloy, Bruce A. Reed
1995	J	`jnl`	Almost Every Graph can be Covered by [fracDelta2] Linear Forests. Comb. Probab. Comput. Colin McDiarmid, Bruce A. Reed
1995	J	`jnl`	Covering the Edges of a Random Graph by Cliques. Comb. Alan M. Frieze, Bruce A. Reed
1995	J	`jnl`	Multicoloured Hamilton Cycles. Electron. J. Comb. Michael H. Albert, Alan M. Frieze, Bruce A. Reed
1995	J	`jnl`	On the Variance of the Height of Random Binary Search Trees. SIAM J. Comput. Luc Devroye, Bruce A. Reed
1995	J	`jnl`	Recognizing bull-free perfect graphs. Graphs Comb. Bruce A. Reed, Najiba Sbihi
1995	J	`jnl`	Right angle free subsets in the plane. Graphs Comb. B. Gamble, William R. Pulleyblank, Bruce A. Reed, F. Bruce Shepherd
1995	J	`jnl`	Rooted Routing in the Plane. Discret. Appl. Math. Bruce A. Reed
1995	J	`jnl`	The Dominating Number of Random Cubic Graph. Random Struct. Algorithms Michael Molloy, Bruce A. Reed
1995	J	`jnl`	When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? SIAM J. Comput. Alan M. Frieze, Richard M. Karp, Bruce A. Reed
1994	J	`jnl`	Induced Circuits in Planar Graphs. J. Comb. Theory B Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd
1993	J	`jnl`	Complete Multi-partite Cutsets in Minimal Imperfect Graphs. J. Comb. Theory B Gérard Cornuéjols, Bruce A. Reed
1993	J	`jnl`	Fractionally colouring total graphs. Comb. Kyriakos Kilakos, Bruce A. Reed
1993	J	`jnl`	On Total Colorings of Graphs. J. Comb. Theory B Colin J. H. McDiarmid, Bruce A. Reed
1993	J	`jnl`	Polychromatic Hamilton cycles. Discret. Math. Alan M. Frieze, Bruce A. Reed
1992	A*	`conf`	Finding Approximate Separators and Computing Tree Width Quickly STOC Bruce A. Reed
1992	A*	`conf`	Mick Gets Some (the Odds Are on His Side) FOCS Vasek Chvátal, Bruce A. Reed
1992	—	`conf`	Non-Interfering Network Flows. SWAT Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd
1992	J	`jnl`	Star arboricity. Comb. Noga Alon, Colin McDiarmid, Bruce A. Reed
1992	J	`jnl`	The Strongly Connected Components of 1-in, 1-out. Comb. Probab. Comput. Bruce A. Reed, Colin McDiarmid
1992	B	`conf`	When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? IPCO Alan M. Frieze, Richard M. Karp, Bruce A. Reed
1991	J	`jnl`	Acyclic Coloring of Graphs. Random Struct. Algorithms Noga Alon, Colin McDiarmid, Bruce A. Reed
1991	—	`conf`	An extremal function for the achromatic number. Graph Structure Theory Béla Bollobás, Bruce A. Reed, Andrew Thomason
1991	—	`conf`	Counterexamples to a conjecture of Las Vergnas and Meyniel. Graph Structure Theory Bruce A. Reed
1991	—	`conf`	Finding disjoint trees in planar graphs in linear time. Graph Structure Theory Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour
1990	J	`jnl`	Greedy Matching on the Line. SIAM J. Comput. Alan M. Frieze, Colin McDiarmid, Bruce A. Reed
1990	J	`jnl`	Linear Arboricity of Random Regular Graphs. Random Struct. Algorithms Colin McDiarmid, Bruce A. Reed
1990	B	`conf`	Perfection, Parity, Planarity, and Packing Paths. IPCO Bruce A. Reed
1989	J	`jnl`	Building Heaps Fast. J. Algorithms Colin McDiarmid, Bruce A. Reed
1989	J	`jnl`	P4-comparability graphs. Discret. Math. Chính T. Hoàng, Bruce A. Reed
1989	J	`jnl`	Some classes of perfectly orderable graphs. J. Graph Theory Chính T. Hoàng, Bruce A. Reed
1988	J	`jnl`	Edge-colouring random graphs. J. Comb. Theory B Alan M. Frieze, Bill Jackson, Colin J. H. McDiarmid, Bruce A. Reed
1988	J	`jnl`	Threshold tolerance graphs. J. Graph Theory Clyde L. Monma, Bruce A. Reed, William T. Trotter
1987	J	`jnl`	A note on even pairs. Discret. Math. Bruce A. Reed
1987	J	`jnl`	A note on short cycles in diagraphs. Discret. Math. Chính T. Hoàng, Bruce A. Reed
1987	J	`jnl`	A semi-strong Perfect Graph theorem. J. Comb. Theory B Bruce A. Reed
1985	J	`jnl`	A note on the semi-strong perfect graph conjecture. Discret. Math. Bruce A. Reed