David R. Wood

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 96

Top Venues

CoRR

SIAM J. Discret. Math.

Electron. J. Comb.

Comb. Probab. Comput.

Publications

Chun-Hung Liu, David R. Wood
Clustered coloring of graphs with bounded layered treewidth and bounded degree. Eur. J. Comb. 122 (2024)
Louis Esperet, David R. Wood
Colouring strong products. Eur. J. Comb. 121 (2024)
Robert Hickingbotham, Freddie Illingworth, Bojan Mohar, David R. Wood
Treewidth, Circle Graphs, and Circular Drawings. SIAM J. Discret. Math. 38 (1) (2024)
Robert Hickingbotham, Paul Jungeblut, Laura Merker, David R. Wood
The product structure of squaregraphs. J. Graph Theory 105 (2) (2024)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. Electron. J. Comb. 31 (2) (2024)
Vida Dujmovic, Pat Morin, David R. Wood, David Worley
Grid Minors and Products. CoRR (2024)
Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood
Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. 38 (3) (2024)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
Planar graphs in blowups of fans. CoRR (2024)
António Girão, Freddie Illingworth, Alex D. Scott, David R. Wood
Defective coloring of hypergraphs. Random Struct. Algorithms 64 (3) (2024)
Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
The Grid-Minor Theorem Revisited. SODA (2024)
David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
Three-Dimensional Graph Products with Unbounded Stack-Number. Discret. Comput. Geom. 71 (4) (2024)
Robert Hickingbotham, David R. Wood
Shallow Minors, Graph Products, and Beyond-Planar Graphs. SIAM J. Discret. Math. 38 (1) (2024)
Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood
Product structure of graph classes with bounded treewidth. Comb. Probab. Comput. 33 (3) (2024)
Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. 33 (1) (2024)
Vida Dujmovic, Pat Morin, David R. Wood
Graph product structure for non-minor-closed classes. J. Comb. Theory, Ser. B 162 (2023)
Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood
Proof of the Clustered Hadwiger Conjecture. FOCS (2023)
Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
The grid-minor theorem revisited. CoRR (2023)
Sergey Norin, Alex Scott, David R. Wood
Clustered colouring of graph classes with bounded treedepth or pathwidth. Comb. Probab. Comput. 32 (1) (2023)
David R. Wood
2-Layer Graph Drawings with Bounded Pathwidth. J. Graph Algorithms Appl. 27 (9) (2023)
Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
The Excluded Tree Minor Theorem Revisited. CoRR (2023)
Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood
Proof of the Clustered Hadwiger Conjecture. CoRR (2023)
Rutger Campbell, Marc Distel, J. Pascal Gollin, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, David R. Wood
Graphs of Linear Growth have Bounded Treewidth. Electron. J. Comb. 30 (3) (2023)
Yangyan Gu, Yiting Jiang, David R. Wood, Xuding Zhu
Refined List Version of Hadwiger's Conjecture. SIAM J. Discret. Math. 37 (3) (2023)
Torsten Ueckerdt, David R. Wood, Wendy Yi
An Improved Planar Graph Product Structure Theorem. Electron. J. Comb. 29 (2) (2022)
Marc Distel, Robert Hickingbotham, Tony Huynh, David R. Wood
Improved product structure for graphs on surfaces. Discret. Math. Theor. Comput. Sci. 24 (2) (2022)
Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood
Separating layered treewidth and row treewidth. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
Three-dimensional graph products with unbounded stack-number. CoRR (2022)
Ian M. Wanless, David R. Wood
A General Framework for Hypergraph Coloring. SIAM J. Discret. Math. 36 (3) (2022)
Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood
Stack-Number is Not Bounded by Queue-Number. Comb. 42 (2) (2022)
Tony Huynh, Gwenaël Joret, David R. Wood
Subgraph densities in a surface. Comb. Probab. Comput. 31 (5) (2022)
Chun-Hung Liu, David R. Wood
Clustered variants of Hajós' conjecture. J. Comb. Theory, Ser. B 152 (2022)
Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood
Product structure of graph classes with bounded treewidth. CoRR (2022)
David R. Wood
Product structure of graph classes with strongly sublinear separators. CoRR (2022)
David R. Wood
2-Layer Graph Drawings with Bounded Pathwidth. CoRR (2022)
Édouard Bonnet, O-joung Kwon, David R. Wood
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond). CoRR (2022)
Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood
Clustered 3-colouring graphs of bounded degree. Comb. Probab. Comput. 31 (1) (2022)
Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood
Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond. Electron. J. Comb. 28 (4) (2021)
Nina Kamcev, Anita Liebenau, David R. Wood, Liana Yepremyan
The Size Ramsey Number of Graphs with Bounded Treewidth. SIAM J. Discret. Math. 35 (1) (2021)
Torsten Ueckerdt, David R. Wood, Wendy Yi
An improved planar graph product structure theorem. CoRR (2021)
Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond. CoRR (2021)
Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood
Separating layered treewidth and row treewidth. CoRR (2021)
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. 40 (6) (2020)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs Have Bounded Queue-Number. J. ACM 67 (4) (2020)
Zdenek Dvorák, Tony Huynh, Gwenaël Joret, Chun-Hung Liu, David R. Wood
Notes on Graph Product Structure Theory. CoRR (2020)
Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood
Minor-Closed Graph Classes with Bounded Layered Pathwidth. SIAM J. Discret. Math. 34 (3) (2020)
David R. Wood
Nonrepetitive graph colouring. 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)
Tony Huynh, Gwenaël Joret, David R. Wood
Subgraph densities in a surface. CoRR (2020)
Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood
Stack-number is not bounded by queue-number. CoRR (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)
Paul Wollan, David R. Wood
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor. J. Graph Theory 91 (3) (2019)
Alex Scott, Paul D. Seymour, David R. Wood
Bad news for chordal partitions. J. Graph Theory 90 (1) (2019)
Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layouts, Layered Path Decompositions, and Leveled Planarity. Algorithmica 81 (4) (2019)
Sergey Norin, Alex Scott, Paul D. Seymour, David R. Wood
Clustered Colouring in Minor-Closed Classes. Comb. 39 (6) (2019)
Fiachra Knox, Bojan Mohar, David R. Wood
A Golden Ratio Inequality for Vertex Degrees of Graphs. Am. Math. Mon. 126 (8) (2019)
Vida Dujmovic, Pat Morin, David R. Wood
Queue Layouts of Graphs with Bounded Degree and Bounded Genus. CoRR (2019)
Kevin Hendrey, David R. Wood
Defective and clustered choosability of sparse graphs. Comb. Probab. Comput. 28 (5) (2019)
Vida Dujmovic, Pat Morin, David R. Wood
The structure of k-planar graphs. CoRR (2019)
Patrice Ossona de Mendez, Sang-il Oum, David R. Wood
Defective Colouring of Graphs Excluding A Subgraph or Minor. Comb. 39 (2) (2019)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs have Bounded Queue-Number. CoRR (2019)
Vida Dujmovic, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood
Planar graphs have bounded nonrepetitive chromatic number. CoRR (2019)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs have Bounded Queue-Number. FOCS (2019)
Ruy Fabila Monroy, Jakob Jonsson, Pavel Valtr, David R. Wood
The exact chromatic number of the convex segment disjointness graph. CoRR (2018)
Kevin Hendrey, David R. Wood
Defective and Clustered Choosability of Sparse Graphs. CoRR (2018)
Daniel J. Harvey, David R. Wood
The treewidth of line graphs. J. Comb. Theory, Ser. B 132 (2018)
Jan van den Heuvel, David R. Wood
Improper colourings inspired by Hadwiger's conjecture. J. Lond. Math. Soc. 98 (1) (2018)
Gwenaël Joret, David R. Wood
-Minor-Free Induced Subgraphs of Sparse Connected Graphs. SIAM J. Discret. Math. 32 (1) (2018)
Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
Corrigendum: Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32 (4) (2018)
Alex Scott, David R. Wood
Better bounds for poset dimension and boxicity. CoRR (2018)
Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32 (2) (2018)
Tim E. Wilson, David R. Wood
Anagram-Free Graph Colouring. Electron. J. Comb. 25 (2) (2018)
Tim E. Wilson, David R. Wood
Anagram-Free Colorings of Graph Subdivisions. SIAM J. Discret. Math. 32 (3) (2018)
Kevin Hendrey, David R. Wood
The extremal function for Petersen minors. J. Comb. Theory, Ser. B 131 (2018)
Vida Dujmovic, David R. Wood
Thickness and antithickness of graphs. J. Comput. Geom. 9 (1) (2018)
Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class. CoRR (2018)
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
Seymour's conjecture on 2-connected graphs of large pathwidth. CoRR (2018)
Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood
Minor-closed graph classes with bounded layered pathwidth. CoRR (2018)
Vida Dujmovic, David R. Wood
Thickness and Antithickness of Graphs. CoRR (2017)
Vida Dujmovic, Pat Morin, David R. Wood
Layered separators in minor-closed graph classes with applications. J. Comb. Theory, Ser. B 127 (2017)
Bin Jia, David R. Wood
Hadwiger's Conjecture for ℓ-Link Graphs. J. Graph Theory 84 (4) (2017)
Vida Dujmovic, David Eppstein, David R. Wood
Structure of Graphs with Locally Restricted Crossings. SIAM J. Discret. Math. 31 (2) (2017)
Daniel J. Harvey, David R. Wood
Parameters Tied to Treewidth. J. Graph Theory 84 (4) (2017)
Stephan Kreutzer, Sang-il Oum, Paul D. Seymour, Dominic van der Zypen, David R. Wood
Majority Colourings of Digraphs. Electron. J. Comb. 24 (2) (2017)
Vida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood
Nonrepetitive colouring via entropy compression. Comb. 36 (6) (2016)
Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood
Layouts of Expander Graphs. Chic. J. Theor. Comput. Sci. 2016 (2016)
Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layout Is Hard. Graph Drawing (2016)
Helmut Alt, Michael S. Payne, Jens M. Schmidt, David R. Wood
Thoughts on Barnette's Conjecture. Australas. J Comb. 64 (2016)
David R. Wood
Cliques in Graphs Excluding a Complete Graph Minor. Electron. J. Comb. 23 (3) (2016)
Tony Grubman, Y. Ahmet Sekercioglu, David R. Wood
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking. Discret. Appl. Math. 213 (2016)
Eran Nevo, Guillermo Pineda-Villavicencio, David R. Wood
On the maximum order of graphs embedded in surfaces. J. Comb. Theory, Ser. B 119 (2016)
David R. Wood
Three dimensional graph drawing with fixed vertices and one bend per edge. CoRR (2016)
Gwenaël Joret, David R. Wood
$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs. CoRR (2016)
Bruce A. Reed, David R. Wood
Forcing a sparse minor. Comb. Probab. Comput. 25 (2) (2016)
Daniel J. Harvey, David R. Wood
Average Degree Conditions Forcing a Minor. Electron. J. Comb. 23 (1) (2016)
Bruce A. Reed, David R. Wood
'Forcing a sparse minor' - CORRIGENDUM. Comb. Probab. Comput. 25 (2) (2016)
Guillermo Pineda-Villavicencio, David R. Wood
The Degree-Diameter Problem for Sparse Graph Classes. Electron. J. Comb. 22 (2) (2015)
Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layouts, Layered Path Decompositions, and Leveled Planarity. CoRR (2015)
Vida Dujmovic, David Eppstein, David R. Wood
Genus, Treewidth, and Local Crossing Number. Graph Drawing (2015)
Daniel J. Harvey, David R. Wood
Treewidth of the Line Graph of a Complete Graph. J. Graph Theory 79 (1) (2015)

David R. Wood.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

David R. Wood