David Wood | Academic Influence

David Wood 's AcademicInfluence.com Rankings

David Wood

Mathematics

#1482

World Rank

#2428

Historical Rank

Measure Theory

#2577

World Rank

#3088

Historical Rank

mathematics Degrees

Download Badge

Mathematics

David Wood 's Degrees

Bachelors Mathematics University of Auckland
Masters Mathematics University of Auckland
PhD Mathematics University of Auckland

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is David Wood Influential?

(Suggest an Edit or Addition)

According to Wikipedia, David Ronald Wood is a Professor in the School of Mathematics at Monash University in Melbourne, Australia. His research area is discrete mathematics and theoretical computer science, especially structural graph theory, extremal graph theory, geometric graph theory, graph colouring, graph drawing, and combinatorial geometry.

(See a Problem?)

David Wood 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On the Metric Dimension of Cartesian Products of Graphs (2005) (431)
Extremal Graph Theory for Metric Dimension and Diameter (2007) (200)
An algorithm for finding a maximum clique in a graph (1997) (140)
On Linear Layouts of Graphs (2004) (122)
Layout of Graphs with Bounded Tree-Width (2004) (101)
Planar Graphs have Bounded Queue-Number (2019) (84)
Drawings of planar graphs with few slopes and segments (2006) (83)
Characterisations and examples of graph classes with bounded expansion (2009) (82)
Stacks, Queues and Tracks: Layouts of Graph Subdivisions (2005) (80)
On the Maximum Number of Cliques in a Graph (2006) (76)
On the Parameterized Complexity of Layered Graph Drawing (2001) (74)
Graph Treewidth and Geometric Thickness Parameters (2005) (69)
Parameters Tied to Treewidth (2013) (67)
Fault-tolerant metric dimension of graphs (2003) (65)
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness (2005) (64)
Layered separators in minor-closed graph classes with applications (2013) (62)
Nonrepetitive colouring via entropy compression (2011) (62)
Acyclic, Star and Oriented Colourings of Graph Subdivisions (2005) (61)
Track Layouts of Graphs (2004) (59)
Structure of Graphs with Locally Restricted Crossings (2015) (52)
Compatible geometric matchings (2007) (48)
The distance geometry of music (2007) (48)
On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane (2005) (46)
On tree-partition-width (2006) (46)
On the General Position Subset Selection Problem (2012) (44)
Three-Dimensional Grid Drawings with Sub-quadratic Volume (2003) (42)
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing (2002) (41)
Balanced vertex-orderings of graphs (2005) (41)
Notes on Nonrepetitive Graph Colouring (2005) (41)
A Fixed-Parameter Approach to 2-Layer Planarization (2001) (41)
Edge-Removal and Non-Crossing Configurations in Geometric Graphs (2010) (39)
Defective and Clustered Graph Colouring (2018) (39)
Token Graphs (2009) (38)
Graph drawings with few slopes (2006) (38)
Track Layouts, Layered Path Decompositions, and Leveled Planarity (2015) (37)
Improper colourings inspired by Hadwiger's conjecture (2017) (37)
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor (2006) (36)
A linear-time algorithm to find a separator in a graph excluding a minor (2009) (36)
Planar graphs have bounded nonrepetitive chromatic number (2019) (33)
Optimal three-dimensional orthogonal graph drawing in the general position model (2003) (33)
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs (2002) (32)
On the number of maximal independent sets in a graph (2011) (32)
No-Three-in-Line-in-3D (2004) (32)
Polynomial treewidth forces a large grid-like-minor (2008) (32)
Partitions of Complete Geometric Graphs into Plane Trees (2004) (31)
Queue Layouts of Graph Products and Powers (2005) (30)
Graph product structure for non-minor-closed classes (2019) (30)
Tree-Partitions of k-Trees with Applications in Graph Layout (2003) (29)
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing (2004) (28)
Defective Colouring of Graphs Excluding A Subgraph or Minor (2016) (27)
A Polynomial Bound for Untangling Geometric Planar Graphs (2007) (26)
Dimension-Exchange Algorithms for Load Balancing on Trees (2002) (26)
Irreducible triangulations are small (2009) (26)
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (2012) (26)
Simultaneous diagonal flips in plane triangulations (2005) (26)
Contractibility and the Hadwiger Conjecture (2008) (25)
Really Straight Graph Drawings (2004) (24)
Forcing a sparse minor (2014) (24)
Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing (2001) (24)
Better bounds for poset dimension and boxicity (2018) (22)
Nonrepetitive Colourings of Planar Graphs with O(log n) Colours (2012) (22)
An Algorithm for Three-Dimensional Orthogonal Graph Drawing (1998) (22)
On the Complexity of the Balanced Vertex Ordering Problem (2005) (22)
On Visibility and Blockers (2009) (22)
Disproof of the List Hadwiger Conjecture (2011) (22)
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume (2000) (22)
The treewidth of line graphs (2012) (21)
Degree constrained book embeddings (2002) (20)
Three-Dimensional Orthogonal Graph Drawing (2000) (20)
Every Large Point Set contains Many Collinear Points or an Empty Pentagon (2009) (20)
Complete graph minors and the graph minor structure theorem (2011) (20)
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond) (2022) (19)
Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout (2004) (19)
Excluded Forest Minors and the Erdős–Pósa Property (2012) (19)
On the maximum number of cliques in a graph embedded in a surface (2009) (18)
Clique Minors in Cartesian Products of Graphs (2007) (18)
An improved planar graph product structure theorem (2021) (18)
Nonrepetitive graph colouring (2020) (17)
Notes on Graph Product Structure Theory (2020) (17)
Fast separation in a graph with an excluded minor (2004) (17)
Clustered Colouring in Minor-Closed Classes (2017) (17)
Multi-dimensional Orthogonal Graph Drawing with Small Boxes (1999) (17)
On vertex-magic and edge-magic total injections of graphs (2002) (17)
Clustered 3-colouring graphs of bounded degree (2020) (16)
Bounded-Degree Graphs have Arbitrarily Large Queue-Number (2006) (16)
Three-Dimensional Graph Drawing (2016) (16)
Grid drawings of k-colourable graphs (2005) (16)
Independent Sets in Graphs with an Excluded Clique Minor (2006) (16)
Thomassen's Choosability Argument Revisited (2010) (16)
Clustered Graph Coloring and Layered Treewidth (2019) (16)
On Higher-Dimensional Orthogonal Graph Drawing (1997) (16)
Distinct Distances in Graph Drawings (2008) (15)
On the Connectivity of Visibility Graphs (2011) (15)
Cliques in Graphs Excluding a Complete Graph Minor (2015) (15)
On the Chromatic Number of some Flip Graphs (2009) (14)
Colourings of the cartesian product of graphs and multiplicative Sidon sets (2005) (14)
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains (2011) (14)
The Minor Crossing Number of Graphs with an Excluded Minor (2006) (14)
The structure of k-planar graphs (2019) (14)
A variant of the Erdős‐Sós conjecture (2016) (13)
Shallow Minors, Graph Products and Beyond Planar Graphs (2021) (13)
Subgraph densities in a surface (2020) (13)
A Characterization of the degree sequences of 2‐trees (2006) (12)
Universality in minor-closed graph classes (2021) (12)
Layouts of Expander Graphs (2015) (12)
Orthogonal Tree Decompositions of Graphs (2017) (12)
Colourings with Bounded Monochromatic Components in Graphs of Given Circumference (2016) (12)
The size Ramsey number of graphs with bounded treewidth (2019) (12)
Rooted K4-Minors (2011) (12)
Small minors in dense graphs (2010) (12)
Treewidth of the Line Graph of a Complete Graph (2015) (11)
Improved product structure for graphs on surfaces (2021) (11)
Dimension-exchange algorithms for token distribution on tree-connected architectures (2004) (11)
Minor-closed graph classes with bounded layered pathwidth (2018) (11)
The extremal function for Petersen minors (2015) (11)
Improved upper bounds on the crossing number (2008) (11)
Upward Three-Dimensional Grid Drawings of Graphs (2005) (10)
Clustered Coloring of Graphs Excluding a Subgraph and a Minor (2019) (10)
Progress on Dirac's Conjecture (2012) (10)
The Chromatic Number of the Convex Segment Disjointness Graph (2011) (10)
A General Framework for Hypergraph Coloring (2022) (10)
Majority Colourings of Digraphs (2016) (10)
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring (2013) (9)
The exact chromatic number of the convex segment disjointness graph (2011) (9)
Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem (2013) (9)
Light edges in degree-constrained graphs (2004) (9)
Brooks' Vertex-Colouring Theorem in Linear Time (2014) (9)
Stack-Number is Not Bounded by Queue-Number (2020) (9)
Circumference and Pathwidth of Highly Connected Graphs (2013) (9)
Characterisations of intersection graphs by vertex orderings (2004) (9)
General position subsets and independent hyperplanes in d-space (2014) (9)
Three-Dimensional 1-Bend Graph Drawings (2004) (9)
Genus, Treewidth, and Local Crossing Number (2015) (9)
Separating layered treewidth and row treewidth (2021) (9)
Clustered Variants of Hajós' Conjecture (2019) (9)
Vertex partitions of chordal graphs (2004) (9)
Product structure of graph classes with bounded treewidth (2022) (8)
On the Upward Planarity of Mixed Plane Graphs (2013) (8)
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (2012) (8)
Tree densities in sparse graph classes (2020) (8)
Refinement of Three-Dimensional Orthogonal Graph Drawings (2000) (8)
Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings (2000) (8)
A Note on Tree-Partition-Width (2006) (7)
Two-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs (1998) (7)
Blocking coloured point sets (2010) (7)
The Distance Geometry of Deep Rhythms and Scales (2005) (7)
Queue Layouts of Graphs with Bounded Degree and Bounded Genus (2019) (7)
Anagram-Free Graph Colouring (2016) (7)
Average Degree Conditions Forcing a Minor (2015) (7)
Lower bounds for hot-potato permutation routing on trees (2000) (7)
A Lower Bound on the Average Degree Forcing a Minor (2019) (7)
Cycles of Given Size in a Dense Graph (2015) (7)
On the Book Thickness of k-Trees (2009) (7)
Treewidth of Cartesian Products of Highly Connected Graphs (2011) (7)
Orthogonal Drawings with Few Layers (2001) (6)
Abelian Square-free Graph Colouring (2016) (6)
Product structure of graphs with an excluded minor (2021) (6)
On the oriented chromatic number of dense graphs (2006) (6)
Clustered coloring of graphs excluding a subgraph (2019) (6)
Defective and Clustered Colouring of Sparse Graphs (2018) (6)
Edge-Maximal Graphs on Surfaces (2016) (6)
Hadwiger's Conjecture for 3-Arc Graphs (2013) (6)
Defective and clustered choosability of sparse graphs (2018) (6)
Induced Subgraphs of Bounded Degree and Bounded Treewidth (2005) (5)
Empty Pentagons in Point Sets with Collinearities (2012) (5)
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (2021) (5)
‘Forcing a sparse minor’ — CORRIGENDUM (2015) (5)
Bounded degree acyclic decompositions of digraphs (2004) (5)
The product structure of squaregraphs (2022) (5)
Separation dimension and degree (2018) (5)
Geometric thickness in a grid (2003) (5)
Graph Minors and Minimum Degree (2008) (5)
The Degree-Diameter Problem for Sparse Graph Classes (2013) (5)
New Results in Graph Layout (2003) (5)
Product structure of graph classes with strongly sublinear separators (2022) (5)
Three-dimensional graph products with unbounded stack-number (2022) (4)
Anagram-Free Colorings of Graph Subdivisions (2017) (4)
Layouts of Graph Subdivisions (2004) (4)
Cliques in Odd-Minor-Free Graphs (2011) (4)
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor (2017) (4)
A Variant of the Erd\H{o}s-S\'os Conjecture (2016) (4)
Drawing a Graph in a Hypercube (2005) (4)
Cost-optimal quadtrees for ray shooting (2002) (4)
Thoughts on Barnette's Conjecture (2013) (4)
Tree-Partitions with Bounded Degree Trees (2022) (4)
Extremal functions for sparse minors (2021) (4)
Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth (2018) (3)
A logarithmic bound for the chromatic number of the associahedron (2018) (3)
Clustered colouring of graph classes with bounded treedepth or pathwidth (2020) (3)
Bad news for chordal partitions (2017) (3)
Proximity Drawings of High-Degree Trees (2010) (3)
On the maximum order of graphs embedded in surfaces (2013) (3)
Colouring the triangles determined by a point set (2011) (3)
Multi-Dimensional Orthogonal Graph Drawing in the General Position Model (1999) (3)
Track Layout Is Hard (2016) (3)
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (2015) (3)
On Multiplicative Sidon Sets (2011) (3)
A Note on Hadwiger's Conjecture (2013) (2)
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class (2018) (2)
Structural Properties of Graph Products (2021) (2)
Towards a 2-bends algorithm for three-dimensional orthogonal graph drawing (1997) (2)
Inducibility and universality for trees (2021) (2)
Partitions and Coverings of Trees by Bounded-Degree Subtrees (2010) (2)
Exponentially Many Hypergraph Colourings (2020) (2)
Colouring the Square of the Cartesian Product of Trees (2010) (2)
Hadwiger's Conjecture for ℓ‐Link Graphs (2014) (2)
Decompositions of Complete Multipartite Graphs into Complete Graphs (2011) (2)
Really Straight Drawings I : Planar Graphs ∗ (2005) (2)
A Polynomial Bound for Untangling Geometric Planar Graphs (2008) (2)
A linear upper bound on the rectilinear crossing number (2005) (2)
Folding = Colouring (2008) (2)
No-Three-in-Line-in3 D (2005) (2)
The Big-Line-Big-Clique Conjecture is False for Infinite Point Sets (2010) (1)
Corrigendum: Orthogonal Tree Decompositions of Graphs (2018) (1)
Really Straight Drawings II: Non-Planar Graphs (2005) (1)
C O ] 2 2 Fe b 20 18 Improper Colourings inspired by Hadwiger ’ s Conjecture ∗ (2018) (1)
Minimum Degree and Graph Minors (2008) (1)
Anagram-free colourings of graph subdivisions (2017) (1)
Clustered coloring of graphs with bounded layered treewidth and bounded degree (2022) (1)
Graph Drawings with Few Slopes Dedicated to Godfried Toussaint on his 60th birthday. (2006) (1)
Colouring Strong Products (2022) (1)
Thickness and Antithickness of Graphs (2017) (1)
Treewidth of the Line Graph of Complete and Complete Multipartite Graphs (2012) (1)
Refined list version of Hadwiger's conjecture (2022) (1)
Three dimensional graph drawing with fixed vertices and one bend per edge (2016) (1)
Nonrepetitive colouring via entropy compression (2015) (1)
Hypergraph Colouring and Degeneracy (2013) (1)
Structural properties of bipartite subgraphs (2021) (1)
Planar Graphs have Bounded Queue-Number Vida Dujmović (2019) (0)
Defective Colouring of Hypergraphs (2022) (0)
Treewidth of the Kneser Graph and the (2013) (0)
J ul 2 01 1 On Multiplicative Sidon Sets (2011) (0)
Anagram-Free Colorings of Graph Subdivisions | SIAM Journal on Discrete Mathematics | Vol. 32, No. 3 | Society for Industrial and Applied Mathematics (2018) (0)
A pr 2 00 6 Graph Treewidth and Geometric Thickness Parameters ∗ (2008) (0)
CS-AAG-2000-03 Token Distribution on Tree-Conne tedAr hite tures (2000) (0)
A pr 2 01 3 A Note on Hadwiger ’ s Conjecture (2013) (0)
Grafos de orden máximo y mínimo con diámetro y dimensión métrica fijados (2006) (0)
Defective Colouring of Graphs Excluding A Subgraph or Minor (2018) (0)
Treewidth, Circle Graphs and Circular Drawings (2022) (0)
The Excluded Tree Minor Theorem Revisited (2023) (0)
Ju n 20 06 Graph Drawings with Few Slopes ∗ (2007) (0)
On the Connectivity of Visibility Graphs (2012) (0)
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms (2002) (0)
Graphs excluding a fixed minor are $O(\sqrt{n})$-complete-blowups of a treewidth 4 graph (2022) (0)
Three-Dimensional Grid Drawings with Sub-Quadratic (2003) (0)
Track Layouts, Layered Path Decompositions, and Leveled Planarity (2018) (0)
Notes on Tree- and Path-chromatic Number (2020) (0)
Vertex-Orderings of GraphsTherese Biedl (2007) (0)
$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (2016) (0)
# A 26 INTEGERS 13 ( 2013 ) ON MULTIPLICATIVE SIDON SETS (2013) (0)
A Characterization of the Degree Sequences of 2-trees (2007) (0)
Treewidth of the Kneser Graph and the Erd\H{o}s-Ko-Rado Theorem (2013) (0)
C O ] 1 1 O ct 2 01 1 Disproof of the List Hadwiger Conjecture ∗ (2011) (0)
3-Monotone Expanders (2015) (0)
A ug 2 01 2 ON THE GENERAL POSITION SUBSET SELECTION PROBLEM (0)
C O ] 3 1 A ug 2 01 7 Anagram-free colourings of graph subdivisions (2017) (0)
Graphs of maximum and minimum order with fixed metric dimension and diameter (2006) (0)
Token Graphs (2011) (0)
A Golden Ratio Inequality for Vertex Degrees of Graphs (2018) (0)
C O ] 8 F eb 2 01 2 Cliques in Odd-Minor-Free Graphs ∗ (2012) (0)
Graphs of Linear Growth have Bounded Treewidth (2022) (0)
2-Layer Graph Drawings with Bounded Pathwidth (2022) (0)
A Simple Proof of the F{á}ry-Wagner Theorem (2005) (0)
Which point sets admit a k-angulation? (2012) (0)
A pr 2 01 8 The exact chromatic number of the convex segment disjointness graph ∗ In memory of (2018) (0)
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure (2022) (0)
Star Colourings of Subdivisions (2007) (0)
A New Algorithm and Open Problems in Three-Dimensional Orthogonal Graph Drawing (1999) (0)

This paper list is powered by the following services:

Other Resources About David Wood

en.wikipedia.org

What Schools Are Affiliated With David Wood ?

David Wood is affiliated with the following schools: