| 2021 | LAGOS | Partitioning Into Prescribed Number of Cycles and Mod | Jordan Barrett, Salomon Bendayan, Yanjia Li, Bruce A. Reed |
| 2021 | LAGOS | The Speed and Threshold of the Biased Perfect Matching Game. | Noah Brstle, Sarah Clusiau, Vishnu V. Narayan, Ndiam Ndiaye, Bruce A. Reed, Ben Seamone |
| 2021 | LAGOS | The Speed and Threshold of the Biased Hamilton Cycle Game. | Noah Brstle, Sarah Clusiau, Vishnu V. Narayan, Ndiam Ndiaye, Bruce A. Reed, Ben Seamone |
| 2019 | SODA | Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. | David Eppstein, Bruce A. Reed |
| 2016 | FOCS | How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. | Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed |
| 2013 | SODA | A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. | Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2011 | FOCS | The Graph Minor Algorithm with Parity Conditions. | Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan |
| 2011 | SODA | Graph Coloring via The Probabilistic Method. | Bruce A. Reed |
| 2010 | FOCS | A Separator Theorem in Minor-Closed Classes. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2010 | SODA | Recognizing a Totally Odd K | Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed |
| 2010 | SODA | An (almost) Linear Time Algorithm for Odd Cyles Transversal. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2010 | STOC | Odd cycle packing. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2009 | SODA | A nearly linear time algorithm for the half integral parity disjoint paths packing problem. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2009 | SODA | Asymptotically optimal frugal colouring. | Michael Molloy, Bruce A. Reed |
| 2009 | STOC | Hadwiger's conjecture is decidable. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2008 | FOCS | A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. | Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed |
| 2008 | LATIN | Optimization and Recognition for K 5-minor Free Graphs in Linear Time. | Bruce A. Reed, Zhentao Li |
| 2008 | SODA | L(2, 1)-labelling of graphs. | Frdric Havet, Bruce A. Reed, Jean-Sbastien Sereni |
| 2008 | SODA | A nearly linear time algorithm for the half integral disjoint paths packing. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2007 | STOC | Computing crossing number in linear time. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2005 | IPCO | Approximate Min-max Relations for Odd Cycles in Planar Graphs. | Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta |
| 2005 | WADS | Heap Building Bounds. | Zhentao Li, Bruce A. Reed |
| 2002 | SODA | Polynomial time recognition of P4-structure. | Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed |
| 2001 | SODA | Approximately covering by cycles in planar graphs. | Dieter Rautenbach, Bruce A. Reed |
| 2001 | STOC | Colouring graphs when the number of colours is nearly the maximum degree. | Michael Molloy, Bruce A. Reed |
| 2001 | WG | On Star Coloring of Graphs. | Guillaume Fertin, Andr Raspaud, Bruce A. Reed |
| 2000 | LATIN | Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). | Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics |
| 2000 | LATIN | Finding Skew Partitions Efficiently. | Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed |
| 2000 | STOC | How tall is a tree? | Bruce A. Reed |
| 1999 | WG | An Improved Algorithm for Finding Tree Decompositions of Small Width. | Ljubomir Perkovic, Bruce A. Reed |
| 1998 | IPCO | Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
| 1998 | LATIN | Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. | Michael Molloy, Bruce A. Reed |
| 1998 | STOC | Further Algorithmic Aspects of the Local Lemma. | Michael Molloy, Bruce A. Reed |
| 1992 | FOCS | Mick Gets Some (the Odds Are on His Side) | Vasek Chvtal, Bruce A. Reed |
| 1992 | IPCO | When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? | Alan M. Frieze, Richard M. Karp, Bruce A. Reed |
| 1992 | STOC | Finding Approximate Separators and Computing Tree Width Quickly | Bruce A. Reed |
| 1990 | IPCO | Perfection, Parity, Planarity, and Packing Paths. | Bruce A. Reed |