David R. Wood

According to our database1, David R. Wood authored at least 175 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
A variant of the Erdős-Sós conjecture.
J. Graph Theory, 2020

Planar Graphs Have Bounded Queue-Number.
J. ACM, 2020

Nonrepetitive graph colouring.
CoRR, 2020

Subgraph densities in a surface.
CoRR, 2020

Notes on Tree- and Path-chromatic Number.
CoRR, 2020

Notes on Graph Product Structure Theory.
CoRR, 2020

A Lower Bound on the Average Degree Forcing a Minor.
Electron. J. Comb., 2020

2019
A Golden Ratio Inequality for Vertex Degrees of Graphs.
Am. Math. Mon., 2019

Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor.
J. Graph Theory, 2019

Bad news for chordal partitions.
J. Graph Theory, 2019

Defective and clustered choosability of sparse graphs.
Comb. Probab. Comput., 2019

The structure of k-planar graphs.
CoRR, 2019

Planar graphs have bounded nonrepetitive chromatic number.
CoRR, 2019

Queue Layouts of Graphs with Bounded Degree and Bounded Genus.
CoRR, 2019

Clustered Colouring in Minor-Closed Classes.
Comb., 2019

Defective Colouring of Graphs Excluding A Subgraph or Minor.
Comb., 2019

Track Layouts, Layered Path Decompositions, and Leveled Planarity.
Algorithmica, 2019

2018
Anagram-Free Colorings of Graph Subdivisions.
SIAM J. Discret. Math., 2018

K<sub>4</sub>-Minor-Free Induced Subgraphs of Sparse Connected Graphs.
SIAM J. Discret. Math., 2018

Corrigendum: Orthogonal Tree Decompositions of Graphs.
SIAM J. Discret. Math., 2018

Orthogonal Tree Decompositions of Graphs.
SIAM J. Discret. Math., 2018

Thickness and antithickness of graphs.
J. Comput. Geom., 2018

Improper colourings inspired by Hadwiger's conjecture.
J. Lond. Math. Soc., 2018

The extremal function for Petersen minors.
J. Comb. Theory, Ser. B, 2018

The treewidth of line graphs.
J. Comb. Theory, Ser. B, 2018

Minor-closed graph classes with bounded layered pathwidth.
CoRR, 2018

Tight Upper Bounds on the Crossing Number in a Minor-Closed Class.
CoRR, 2018

Better bounds for poset dimension and boxicity.
CoRR, 2018

The exact chromatic number of the convex segment disjointness graph.
CoRR, 2018

Seymour's conjecture on 2-connected graphs of large pathwidth.
CoRR, 2018

Anagram-Free Graph Colouring.
Electron. J. Comb., 2018

2017
Structure of Graphs with Locally Restricted Crossings.
SIAM J. Discret. Math., 2017

Hadwiger's Conjecture for ℓ-Link Graphs.
J. Graph Theory, 2017

Parameters Tied to Treewidth.
J. Graph Theory, 2017

Layered separators in minor-closed graph classes with applications.
J. Comb. Theory, Ser. B, 2017

Majority Colourings of Digraphs.
Electron. J. Comb., 2017

2016
Three-Dimensional Graph Drawing.
Encyclopedia of Algorithms, 2016

On the maximum order of graphs embedded in surfaces.
J. Comb. Theory, Ser. B, 2016

Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking.
Discret. Appl. Math., 2016

'Forcing a sparse minor' - CORRIGENDUM.
Comb. Probab. Comput., 2016

Forcing a sparse minor.
Comb. Probab. Comput., 2016

Three dimensional graph drawing with fixed vertices and one bend per edge.
CoRR, 2016

$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs.
CoRR, 2016

Cliques in Graphs Excluding a Complete Graph Minor.
Electron. J. Comb., 2016

Average Degree Conditions Forcing a Minor.
Electron. J. Comb., 2016

Nonrepetitive colouring via entropy compression.
Comb., 2016

Layouts of Expander Graphs.
Chic. J. Theor. Comput. Sci., 2016

Thoughts on Barnette's Conjecture.
Australas. J Comb., 2016

Track Layout Is Hard.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
Cycles of Given Size in a Dense Graph.
SIAM J. Discret. Math., 2015

Empty Pentagons in Point Sets with Collinearities.
SIAM J. Discret. Math., 2015

Circumference and Pathwidth of Highly Connected Graphs.
J. Graph Theory, 2015

Treewidth of the Line Graph of a Complete Graph.
J. Graph Theory, 2015

3-Monotone Expanders.
CoRR, 2015

The Degree-Diameter Problem for Sparse Graph Classes.
Electron. J. Comb., 2015

Genus, Treewidth, and Local Crossing Number.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Which point sets admit a k-angulation?
J. Comput. Geom., 2014

On the Upward Planarity of Mixed Plane Graphs.
J. Graph Algorithms Appl., 2014

General Position Subsets and Independent Hyperplanes in d-Space.
CoRR, 2014

Brooks' Vertex-Colouring Theorem in Linear Time.
CoRR, 2014

Progress on Dirac's Conjecture.
Electron. J. Comb., 2014

Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem.
Electron. J. Comb., 2014

2013
On the General Position Subset Selection Problem.
SIAM J. Discret. Math., 2013

A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph.
SIAM J. Discret. Math., 2013

Treewidth of Cartesian Products of Highly Connected Graphs.
J. Graph Theory, 2013

Complete graph minors and the graph minor structure theorem.
J. Comb. Theory, Ser. B, 2013

On Multiplicative Sidon Sets.
Integers, 2013

Proximity Drawings of High-Degree Trees.
Int. J. Comput. Geom. Appl., 2013

Excluded Forest Minors and the Erdős-Pósa Property.
Comb. Probab. Comput., 2013

Layered Separators in Minor-Closed Families with Applications.
CoRR, 2013

Rooted K<sub>4</sub>-Minors.
Electron. J. Comb., 2013

Nonrepetitive Colourings of Planar Graphs with O(log n) Colours.
Electron. J. Comb., 2013

Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains.
SIAM J. Discret. Math., 2012

Colouring the triangles determined by a point set.
J. Comput. Geom., 2012

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.
Int. J. Comput. Geom. Appl., 2012

Token Graphs.
Graphs Comb., 2012

Polynomial treewidth forces a large grid-like-minor.
Eur. J. Comb., 2012

Characterisations and examples of graph classes with bounded expansion.
Eur. J. Comb., 2012

Nordhaus-Gaddum for treewidth.
Eur. J. Comb., 2012

Small minors in dense graphs.
Eur. J. Comb., 2012

On the Connectivity of Visibility Graphs.
Discret. Comput. Geom., 2012

Cliques in Odd-Minor-Free Graphs.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011
Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
Graphs Comb., 2011

On the maximum number of cliques in a graph embedded in a surface.
Eur. J. Comb., 2011

On the Book Thickness of k-Trees.
Discret. Math. Theor. Comput. Sci., 2011

Nonrepetitive Colouring via Entropy Compression
CoRR, 2011

On the number of maximal independent sets in a graph
CoRR, 2011

Disproof of the List Hadwiger Conjecture.
Electron. J. Comb., 2011

The Chromatic Number of the Convex Segment Disjointness Graph.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010
Thomassen's Choosability Argument Revisited.
SIAM J. Discret. Math., 2010

On Visibility and Blockers.
J. Comput. Geom., 2010

Irreducible triangulations are small.
J. Comb. Theory, Ser. B, 2010

Contractibility and the Hadwiger Conjecture.
Eur. J. Comb., 2010

Edge-Removal and Non-Crossing Configurations in Geometric Graphs.
Discret. Math. Theor. Comput. Sci., 2010

Partitions and Coverings of Trees by Bounded-Degree Subtrees
CoRR, 2010

Graph Minors and Minimum Degree.
Electron. J. Comb., 2010

2009
A linear-time algorithm to find a separator in a graph excluding a minor.
ACM Trans. Algorithms, 2009

On tree-partition-width.
Eur. J. Comb., 2009

On the Chromatic Number of some Flip Graphs.
Discret. Math. Theor. Comput. Sci., 2009

The distance geometry of music.
Comput. Geom., 2009

2008
A Characterization of the degree sequences of 2-trees.
J. Graph Theory, 2008

Minimum Degree and Graph Minors.
Electron. Notes Discret. Math., 2008

A Polynomial Bound for Untangling Geometric Planar Graphs.
Electron. Notes Discret. Math., 2008

Compatible Geometric Matchings.
Electron. Notes Discret. Math., 2008

Bounded-Degree Graphs have Arbitrarily Large Queue-Number.
Discret. Math. Theor. Comput. Sci., 2008

Distinct Distances in Graph Drawings.
Electron. J. Comb., 2008

The Minor Crossing Number of Graphs with an Excluded Minor.
Electron. J. Comb., 2008

Notes on Nonrepetitive Graph Colouring.
Electron. J. Comb., 2008

On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica, 2008

Improved upper bounds on the crossing number.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
On the Metric Dimension of Cartesian Products of Graphs.
SIAM J. Discret. Math., 2007

Simultaneous diagonal flips in plane triangulations.
J. Graph Theory, 2007

On the Maximum Number of Cliques in a Graph.
Graphs Comb., 2007

Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets.
Electron. Notes Discret. Math., 2007

Extremal Graph Theory for Metric Dimension and Diameter.
Electron. Notes Discret. Math., 2007

Independent Sets in Graphs with an Excluded Clique Minor.
Discret. Math. Theor. Comput. Sci., 2007

On the Complexity of the Balanced Vertex Ordering Problem.
Discret. Math. Theor. Comput. Sci., 2007

Graph Treewidth and Geometric Thickness Parameters.
Discret. Comput. Geom., 2007

Clique Minors in Cartesian Products of Graphs.
CoRR, 2007

Graph drawings with few slopes.
Comput. Geom., 2007

Drawings of planar graphs with few slopes and segments.
Comput. Geom., 2007

On the oriented chromatic number of dense graphs.
Contributions Discret. Math., 2007

No-Three-in-Line-in-3D.
Algorithmica, 2007

2006
Upward Three-Dimensional Grid Drawings of Graphs.
Order, 2006

Vertex partitions of chordal graphs.
J. Graph Theory, 2006

Partitions of complete geometric graphs into plane trees.
Comput. Geom., 2006

Drawing a Graph in a Hypercube.
Electron. J. Comb., 2006

Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness.
Electron. J. Comb., 2006

Induced Subgraphs of Bounded Degree and Bounded Treewidth.
Contributions Discret. Math., 2006

A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica, 2006

Three-Dimensional Orthogonal Graph Drawing with Optimal Volume.
Algorithmica, 2006

Characterisations of intersection graphs by vertex orderings.
Australas. J Comb., 2006

Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

2005
Layout of Graphs with Bounded Tree-Width.
SIAM J. Comput., 2005

Queue Layouts of Graph Products and Powers.
Discret. Math. Theor. Comput. Sci., 2005

Acyclic, Star and Oriented Colourings of Graph Subdivisions.
Discret. Math. Theor. Comput. Sci., 2005

Stacks, Queues and Tracks: Layouts of Graph Subdivisions.
Discret. Math. Theor. Comput. Sci., 2005

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane.
Discret. Comput. Geom., 2005

Balanced vertex-orderings of graphs.
Discret. Appl. Math., 2005

A Simple Proof of the F{á}ry-Wagner Theorem
CoRR, 2005

Grid drawings of <i>k</i>-colourable graphs.
Comput. Geom., 2005

The Distance Geometry of Deep Rhythms and Scales.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Dimension-exchange algorithms for token distribution on tree-connected architectures.
J. Parallel Distributed Comput., 2004

Three-Dimensional 1-Bend Graph Drawings.
J. Graph Algorithms Appl., 2004

The Maximum Number of Edges in a Three-Dimensional Grid-Drawing.
J. Graph Algorithms Appl., 2004

Bounded degree acyclic decompositions of digraphs.
J. Comb. Theory, Ser. B, 2004

On Linear Layouts of Graphs.
Discret. Math. Theor. Comput. Sci., 2004

Track Layouts of Graphs.
Discret. Math. Theor. Comput. Sci., 2004

Light edges in degree-constrained graphs.
Discret. Math., 2004

Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout.
Algorithmica, 2004

Layouts of Graph Subdivisions.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

Really Straight Graph Drawings.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
Optimal three-dimensional orthogonal graph drawing in the general position model.
Theor. Comput. Sci., 2003

Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings.
J. Graph Algorithms Appl., 2003

Geometric thickness in a grid.
Discret. Math., 2003

Tree-Partitions of k-Trees with Applications in Graph Layout.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Three-Dimensional Grid Drawings with Sub-quadratic Volume.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Degree constrained book embeddings.
J. Algorithms, 2002

Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms.
Comput. J., 2002

On vertex-magic and edge-magic total injections of graphs.
Australas. J Comb., 2002

Dimension-Exchange Algorithms for Load Balancing on Trees.
Proceedings of the SIROCCO 9, 2002

Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

Cost-optimal quadtrees for ray shooting.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Geometric Thickness in a Grid of Linear Area.
Electron. Notes Discret. Math., 2001

Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

A Fixed-Parameter Approach to Two-Layer Planarization.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Orthogonal Drawings with Few Layers.
Proceedings of the Graph Drawing, 9th International Symposium, 2001


2000
Lower bounds for hot-potato permutation routing on trees.
Proceedings of the SIROCCO 7, 2000

Refinement of Three-Dimensional Orthogonal Graph Drawings.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999
Multi-dimensional Orthogonal Graph Drawing with Small Boxes.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998
An Algorithm for Three-Dimensional Orthogonal Graph Drawing.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997
An algorithm for finding a maximum clique in a graph.
Oper. Res. Lett., 1997


  Loading...