D. Wood

发表

Treewidth of the Kneser Graph and the

Erdýos-Ko-Rado Theorem, Daniel J. Harveyand, D. Wood, 2013 .

A Polynomial Bound for Untangling Geometric Planar Graphs

Prosenjit Bose, Pat Morin, David R. Wood, 2007, Discret. Comput. Geom..

Exponentially Many Hypergraph Colourings

I. Wanless, D. Wood, 2020, 2008.00775.

Inducibility and universality for trees

Timothy F. N. Chan, D. Král, B. Mohar, 2021, 2102.02010.

A Fixed-Parameter Approach to Two-Layer Planarization

Giuseppe Liotta, David R. Wood, Naomi Nishimura, 2001, Graph Drawing.

C O ] 8 F eb 2 01 2 Cliques in Odd-Minor-Free Graphs ∗

K. Kawarabayashi, D. Wood, 2012 .

Progress on Dirac's Conjecture pdf

David R. Wood, Michael S. Payne, M. S. Payne, 2012, Electron. J. Comb..

Clustered Graph Coloring and Layered Treewidth

David R. Wood, Chun-Hung Liu, D. Wood, 2019, 1905.08969.

Product structure of graph classes with bounded treewidth

T. Huynh, Jane Tan, K. Clinch, 2022, Combinatorics, Probability and Computing.

Drawings of planar graphs with few slopes and segments

D. Eppstein, V. Dujmovic, M. Suderman, 2006, Comput. Geom..

Defective Colouring of Hypergraphs

A. Scott, António Girão, Freddie Illingworth, 2022, 2207.10514.

Refined list version of Hadwiger's conjecture

Xuding Zhu, Yiting Jiang, D. Wood, 2022, 2209.07013.

C O ] 1 1 O ct 2 01 1 Disproof of the List Hadwiger Conjecture ∗

J. Barát, G. Joret, D. Wood, 2011 .

Induced Subgraphs of Bounded Degree and Bounded Treewidth

P. Bose, V. Dujmovic, D. Wood, 2005, Contributions Discret. Math..

A logarithmic bound for the chromatic number of the associahedron

B. Reed, A. Scott, D. Wood, 2018, 1811.08972.

Product structure of graph classes with strongly sublinear separators

D. Wood, D. Wood, 2022, ArXiv.

Three-Dimensional Grid Drawings with Sub-Quadratic

D. Wood, D. Wood, 2003 .

Notes on Nonrepetitive Graph Colouring

J. Barát, D. Wood, D. Wood, 2005, Electron. J. Comb..

Improved product structure for graphs on surfaces

T. Huynh, Robert Hickingbotham, D. Wood, 2021, Discret. Math. Theor. Comput. Sci..

Extremal functions for sparse minors

S. Norin, Kevin Hendrey, D. Wood, 2021, Advances in Combinatorics.

Treewidth of the Kneser Graph and the Erd\H{o}s-Ko-Rado Theorem

Daniel J. Harvey, D. Wood, 2013 .

Graph drawings with few slopes

V. Dujmovic, M. Suderman, D. Wood, 2006, Comput. Geom..

Induced Subgraphs of Bounded Degree and Bounded Treewidth

Prosenjit Bose, David R. Wood, Vida Dujmovic, 2005, Contributions Discret. Math..

Product structure of graphs with an excluded minor

A. Scott, Freddie Illingworth, D. Wood, 2021, 2104.06627.

Shallow Minors, Graph Products and Beyond Planar Graphs

Robert Hickingbotham, D. Wood, D. Wood, 2021, 2111.12412.

Cliques in Odd-Minor-Free Graphs

K. Kawarabayashi, D. Wood, 2011, CATS.

Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness

J. Barát, D. Wood, J. Matoušek, 2005, Electron. J. Comb..

Clustered coloring of graphs with bounded layered treewidth and bounded degree

D. Wood, Chunqi Liu, D. Wood, 2022, European Journal of Combinatorics.

Treewidth, Circle Graphs, and Circular Drawings

B. Mohar, Freddie Illingworth, Robert Hickingbotham, 2022, SIAM J. Discret. Math..

Defective Colouring of Graphs Excluding A Subgraph or Minor

Sang-il Oum, D. Wood, P. Ossona de Mendez, 2018, Combinatorica.

Token Graphs

J. Urrutia, F. Hurtado, R. Fabila-Monroy, 2011, Graphs and Combinatorics.

Graphs of Linear Growth have Bounded Treewidth

Daniel J. Harvey, B. Mohar, J. P. Gollin, 2022, Electron. J. Comb..

Separation dimension and degree

A. Scott, D. Wood, 2018, Mathematical Proceedings of the Cambridge Philosophical Society.

Tree-Partitions with Bounded Degree Trees ∗

D. Wood, Marc Distel, D. Wood, 2022 .

On tree-partition-width

D. Wood, D. Wood, 2006, Eur. J. Comb..

Vertex partitions of chordal graphs

D. Wood, D. Wood, 2004, J. Graph Theory.

Colourings of the cartesian product of graphs and multiplicative Sidon sets

A. Pór, D. Wood, 2005, Comb..

Nonrepetitive graph colouring pdf

David R. Wood, D. Wood, D. Wood, 2020, The Electronic Journal of Combinatorics.

Cliques in Graphs Excluding a Complete Graph Minor

David R. Wood, D. Wood, D. Wood, 2015, Electron. J. Comb..

Colouring Strong Products

Louis Esperet, D. Wood, 2022, 2205.04953.

Separating layered treewidth and row treewidth

P. Bose, Pat Morin, D. Wood, 2021, Discret. Math. Theor. Comput. Sci..

Defective and Clustered Graph Colouring

D. Wood, D. Wood, D. Wood, 2018, 1803.07694.

Orthogonal Tree Decompositions of Graphs

Pat Morin, David R. Wood, Vida Dujmovic, 2017, SIAM J. Discret. Math..

Structure of Graphs with Locally Restricted Crossings

David Eppstein, David R. Wood, Vida Dujmovic, 2015, SIAM J. Discret. Math..

Layered separators in minor-closed graph classes with applications

Pat Morin, David R. Wood, Vida Dujmovic, 2013, J. Comb. Theory, Ser. B.

Hypergraph Colouring and Degeneracy

D. Wood, D. Wood, 2013, 1310.2972.

Structural properties of bipartite subgraphs

David R. Wood, Robert Hickingbotham, Robert Hickingbotham, 2021, 2106.12099.

Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking

David R. Wood, Y. Ahmet Sekercioglu, Y. A. Sekercioglu, 2015, Discret. Appl. Math..

On the maximum order of graphs embedded in surfaces

David R. Wood, Guillermo Pineda-Villavicencio, Eran Nevo, 2013, J. Comb. Theory, Ser. B.

The Degree-Diameter Problem for Sparse Graph Classes

David R. Wood, Guillermo Pineda-Villavicencio, Guillermo Pineda-Villavicencio, 2013, Electron. J. Comb..

A variant of the Erdős‐Sós conjecture

David R. Wood, Frédéric Havet, Maya Stein, 2016, J. Graph Theory.

A Variant of the Erd\H{o}s-S\'os Conjecture

David R. Wood, Bruce Reed, Maya Stein, 2016, 1606.09343.

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω

Prosenjit Bose, David R. Wood, John Iacono, 2012, Int. J. Comput. Geom. Appl..

Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)

Édouard Bonnet, O-joung Kwon, D. Wood, 2022, ArXiv.

Graph product structure for non-minor-closed classes

Pat Morin, D. Wood, Vida Dujmovi'c, 2019, J. Comb. Theory, Ser. B.

Planar Graphs have Bounded Queue-Number

Pat Morin, David R. Wood, Vida Dujmovic, 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

On the Maximum Number of Cliques in a Graph

David R. Wood, D. Wood, D. Wood, 2006, Graphs Comb..

The distance geometry of music

Erik D. Demaine, Godfried T. Toussaint, David R. Wood, 2007, Comput. Geom..

An algorithm for finding a maximum clique in a graph

David R. Wood, D. Wood, D. Wood, 1997, Oper. Res. Lett..

Dimension-exchange algorithms for token distribution on tree-connected architectures

Antonios Symvonis, David R. Wood, Michael E. Houle, 2004, J. Parallel Distributed Comput..

Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond pdf

David R. Wood, Samuel Fiorini, Tony Huynh, 2021, Electron. J. Comb..

Tree densities in sparse graph classes

T. Huynh, D. Wood, 2020, Canadian Journal of Mathematics.

Simultaneous diagonal flips in plane triangulations

Prosenjit Bose, Pat Morin, David R. Wood, 2005, SODA '06.

On the Parameterized Complexity of Layered Graph Drawing

Giuseppe Liotta, David R. Wood, Naomi Nishimura, 2001, Algorithmica.

Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem

David R. Wood, Daniel J. Harvey, D. Wood, 2013, Electron. J. Comb..

Notes on Tree- and Path-chromatic Number

B. Reed, T. Huynh, Liana Yepremyan, 2020, ArXiv.

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane

David R. Wood, Jan Kára, Attila Pór, 2005, Discret. Comput. Geom..

A Lower Bound on the Average Degree Forcing a Minor

David R. Wood, Andrew Thomason, Bruce Reed, 2019, Electron. J. Comb..

Average Degree Conditions Forcing a Minor

David R. Wood, Daniel J. Harvey, D. Wood, 2015, Electron. J. Comb..

Cycles of Given Size in a Dense Graph

David R. Wood, Daniel J. Harvey, D. Wood, 2015, SIAM J. Discret. Math..

Forcing a sparse minor

Bruce A. Reed, David R. Wood, B. Reed, 2014, Combinatorics, Probability and Computing.

A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph pdf

Bruce A. Reed, David R. Wood, Vida Dujmovic, 2012, SIAM J. Discret. Math..

Small minors in dense graphs pdf

David R. Wood, Samuel Fiorini, Dirk Oliver Theis, 2010, Eur. J. Comb..

A linear-time algorithm to find a separator in a graph excluding a minor

Bruce A. Reed, David R. Wood, B. Reed, 2009, TALG.

Polynomial treewidth forces a large grid-like-minor

Bruce A. Reed, David R. Wood, B. Reed, 2008, Eur. J. Comb..

Fast separation in a graph with an excluded minor

B. Reed, D. Wood, D. Wood, 2004 .

Thickness and Antithickness of Graphs pdf

David R. Wood, Vida Dujmovic, V. Dujmovic, 2017, J. Comput. Geom..

Hadwiger's Conjecture for 3-Arc Graphs

Sanming Zhou, David Wood, Guangjun Xu, 2013, Electron. J. Comb..

Majority Colourings of Digraphs

Stephan Kreutzer, Paul D. Seymour, David R. Wood, 2016, Electron. J. Comb..

Clique Minors in Cartesian Products of Graphs pdf

David R. Wood, D. Wood, D. Wood, 2007, ArXiv.

Token Graphs

Jorge Urrutia, David R. Wood, Ferran Hurtado, 2009, Graphs Comb..

Tight Upper Bounds on the Crossing Number in a Minor-Closed Class pdf

Ken-ichi Kawarabayashi, David R. Wood, Vida Dujmovic, 2018, ArXiv.

Defective Colouring of Graphs Excluding A Subgraph or Minor

Patrice Ossona de Mendez, David R. Wood, Sang-il Oum, 2016, Comb..

The extremal function for Petersen minors

David R. Wood, Kevin Hendrey, Kevin Hendrey, 2015, J. Comb. Theory, Ser. B.

Circumference and Pathwidth of Highly Connected Graphs

David R. Wood, Emily Abernethy Marshall, E. Marshall, 2013, J. Graph Theory.

A Note on Hadwiger's Conjecture

D. Wood, D. Wood, 2013, 1304.6510.

Disproof of the List Hadwiger Conjecture pdf

David R. Wood, Gwenaël Joret, János Barát, 2011, Electron. J. Comb..

Graph Minors and Minimum Degree

David R. Wood, Gasper Fijavz, Gasper Fijavz, 2008, Electron. J. Comb..

Minimum Degree and Graph Minors

David R. Wood, Gasper Fijavz, Gasper Fijavz, 2008, Electron. Notes Discret. Math..

A pr 2 01 3 A Note on Hadwiger ’ s Conjecture

D. Wood, D. Wood, 2013 .

Track Layouts, Layered Path Decompositions, and Leveled Planarity

William E. Devanny, Michael J. Bannister, D. Eppstein, 2015, Algorithmica.

Track Layouts of Graphs

David R. Wood, Vida Dujmovic, Attila Pór, 2004, Discret. Math. Theor. Comput. Sci..

Layout of Graphs with Bounded Tree-Width

Pat Morin, David R. Wood, Vida Dujmovic, 2004, SIAM J. Comput..

Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing

David R. Wood, D. Wood, D. Wood, 2002, FSTTCS.

On Linear Layouts of Graphs

David R. Wood, Vida Dujmovic, V. Dujmovic, 2004, Discret. Math. Theor. Comput. Sci..

Balanced vertex-orderings of graphs

Timothy M. Chan, Mohammad Taghi Hajiaghayi, David R. Wood, 2005, Discret. Appl. Math..

Edge-Removal and Non-Crossing Configurations in Geometric Graphs

David R. Wood, Ferran Hurtado, Ruy Fabila Monroy, 2010, Discret. Math. Theor. Comput. Sci..

Compatible geometric matchings

Sergey Bereg, Jorge Urrutia, David R. Wood, 2007, Comput. Geom..

Partitions of Complete Geometric Graphs into Plane Trees

Prosenjit Bose, David R. Wood, Ferran Hurtado, 2004, GD.

Characterisations and examples of graph classes with bounded expansion

Jaroslav Nesetril, Patrice Ossona de Mendez, David R. Wood, 2009, Eur. J. Comb..