David R. Wood - RankMe

285 papers A* 6A 20B 4Misc 1Journal 243Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Reduced bandwidth: A qualitative strengthening of twin-width in minor-closed classes (and beyond). J. Comb. Theory B Édouard Bonnet, O-joung Kwon, David R. Wood
2025	J	`jnl`	3-Colouring Planar Graphs. CoRR Vida Dujmovic, Pat Morin, Sergey Norin, David R. Wood
2025	J	`jnl`	Clustered Colouring of Graph Products. Electron. J. Comb. Rutger Campbell, Jochen Pascal Gollin, Kevin Hendrey, Thomas Lesgourgues, Bojan Mohar, Youri Tamitegama, Jane Tan, David R. Wood
2025	J	`jnl`	Dominating Kt-Models. J. Graph Theory Freddie Illingworth, David R. Wood
2025	J	`jnl`	Expansion of gap-planar graphs. CoRR David R. Wood
2025	J	`jnl`	Grid Minors and Products. Electron. J. Comb. Vida Dujmovic, Pat Morin, David R. Wood, David Worley
2025	J	`jnl`	Optimal Tree-Decompositions with Bags of Bounded Treewidth. CoRR Kevin Hendrey, David R. Wood
2025	A*	`conf`	Planar Graphs in Blowups of Fans. SODA Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2025	J	`jnl`	Polynomial Bounds in the Apex Minor Theorem. CoRR Kevin Hendrey, David R. Wood
2025	J	`jnl`	Structural properties of graph products. J. Graph Theory Robert Hickingbotham, David R. Wood
2025	J	`jnl`	Structure of CoRR Kevin Hendrey, Nikolai Karol, David R. Wood
2025	J	`jnl`	The Grid-Minor Theorem Revisited. Comb. Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2025	J	`jnl`	Tree decompositions with small width, spread, order and degree. CoRR David R. Wood
2025	J	`jnl`	Treewidth 2 in the Planar Graph Product Structure Theorem. Discret. Math. Theor. Comput. Sci. Marc Distel, Kevin Hendrey, Nikolai Karol, David R. Wood, Jung Hon Yip
2024	J	`jnl`	Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. Electron. J. Comb. Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2024	J	`jnl`	Clustered coloring of graphs with bounded layered treewidth and bounded degree. Eur. J. Comb. Chun-Hung Liu, David R. Wood
2024	J	`jnl`	Colouring strong products. Eur. J. Comb. Louis Esperet, David R. Wood
2024	J	`jnl`	Corrigendum: Orthogonal Tree-Decompositions of Graphs. SIAM J. Discret. Math. Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
2024	J	`jnl`	Defective coloring of hypergraphs. Random Struct. Algorithms António Girão, Freddie Illingworth, Alex D. Scott, David R. Wood
2024	J	`jnl`	Grid Minors and Products. CoRR Vida Dujmovic, Pat Morin, David R. Wood, David Worley
2024	J	`jnl`	Planar graphs in blowups of fans. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2024	J	`jnl`	Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood
2024	J	`jnl`	Product Structure and Tree-Decompositions. CoRR Chun-Hung Liu, Sergey Norin, David R. Wood
2024	J	`jnl`	Product structure of graph classes with bounded treewidth. Comb. Probab. Comput. Rutger Campbell, Katie Clinch, Marc Distel, Jochen Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood
2024	J	`jnl`	Shallow Minors, Graph Products, and Beyond-Planar Graphs. SIAM J. Discret. Math. Robert Hickingbotham, David R. Wood
2024	J	`jnl`	The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2024	A*	`conf`	The Grid-Minor Theorem Revisited. SODA Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2024	J	`jnl`	The product structure of squaregraphs. J. Graph Theory Robert Hickingbotham, Paul Jungeblut, Laura Merker, David R. Wood
2024	J	`jnl`	Three-Dimensional Graph Products with Unbounded Stack-Number. Discret. Comput. Geom. David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
2024	J	`jnl`	Treewidth 2 in the Planar Graph Product Structure Theorem. CoRR Marc Distel, Kevin Hendrey, Nikolai Karol, David R. Wood, Jung Hon Yip
2024	J	`jnl`	Treewidth, Circle Graphs, and Circular Drawings. SIAM J. Discret. Math. Robert Hickingbotham, Freddie Illingworth, Bojan Mohar, David R. Wood
2023	J	`jnl`	2-Layer Graph Drawings with Bounded Pathwidth. J. Graph Algorithms Appl. David R. Wood
2023	J	`jnl`	Clustered colouring of graph classes with bounded treedepth or pathwidth. Comb. Probab. Comput. Sergey Norin, Alex Scott, David R. Wood
2023	J	`jnl`	Graph product structure for non-minor-closed classes. J. Comb. Theory B Vida Dujmovic, Pat Morin, David R. Wood
2023	J	`jnl`	Graphs of Linear Growth have Bounded Treewidth. Electron. J. Comb. Rutger Campbell, Marc Distel, Jochen Pascal Gollin, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, David R. Wood
2023	A*	`conf`	Proof of the Clustered Hadwiger Conjecture. FOCS Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood
2023	J	`jnl`	Proof of the Clustered Hadwiger Conjecture. CoRR Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood
2023	J	`jnl`	Refined List Version of Hadwiger's Conjecture. SIAM J. Discret. Math. Yangyan Gu, Yiting Jiang, David R. Wood, Xuding Zhu
2023	J	`jnl`	The Excluded Tree Minor Theorem Revisited. CoRR Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2023	J	`jnl`	The grid-minor theorem revisited. CoRR Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2022	J	`jnl`	2-Layer Graph Drawings with Bounded Pathwidth. CoRR David R. Wood
2022	J	`jnl`	A General Framework for Hypergraph Coloring. SIAM J. Discret. Math. Ian M. Wanless, David R. Wood
2022	J	`jnl`	An Improved Planar Graph Product Structure Theorem. Electron. J. Comb. Torsten Ueckerdt, David R. Wood, Wendy Yi
2022	J	`jnl`	Clustered 3-colouring graphs of bounded degree. Comb. Probab. Comput. Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood
2022	J	`jnl`	Clustered variants of Hajós' conjecture. J. Comb. Theory B Chun-Hung Liu, David R. Wood
2022	J	`jnl`	Improved product structure for graphs on surfaces. Discret. Math. Theor. Comput. Sci. Marc Distel, Robert Hickingbotham, Tony Huynh, David R. Wood
2022	J	`jnl`	Inducibility and universality for trees. Comb. Theory Timothy F. N. Chan, Daniel Král', Bojan Mohar, David R. Wood
2022	J	`jnl`	Product structure of graph classes with bounded treewidth. CoRR Rutger Campbell, Katie Clinch, Marc Distel, Jochen Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood
2022	J	`jnl`	Product structure of graph classes with strongly sublinear separators. CoRR David R. Wood
2022	J	`jnl`	Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond). CoRR Édouard Bonnet, O-joung Kwon, David R. Wood
2022	J	`jnl`	Separating layered treewidth and row treewidth. Discret. Math. Theor. Comput. Sci. Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood
2022	J	`jnl`	Stack-Number is Not Bounded by Queue-Number. Comb. Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood
2022	J	`jnl`	Subgraph densities in a surface. Comb. Probab. Comput. Tony Huynh, Gwenaël Joret, David R. Wood
2022	J	`jnl`	Three-dimensional graph products with unbounded stack-number. CoRR David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
2021	J	`jnl`	An improved planar graph product structure theorem. CoRR Torsten Ueckerdt, David R. Wood, Wendy Yi
2021	J	`jnl`	Separating layered treewidth and row treewidth. CoRR Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood
2021	J	`jnl`	Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond. Electron. J. Comb. Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood
2021	J	`jnl`	Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond. CoRR Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood
2021	J	`jnl`	The Size Ramsey Number of Graphs with Bounded Treewidth. SIAM J. Discret. Math. Nina Kamcev, Anita Liebenau, David R. Wood, Liana Yepremyan
2020	J	`jnl`	A Lower Bound on the Average Degree Forcing a Minor. Electron. J. Comb. Sergey Norin, Bruce A. Reed, Andrew Thomason, David R. Wood
2020	J	`jnl`	A variant of the Erdős-Sós conjecture. J. Graph Theory Frédéric Havet, Bruce A. Reed, Maya Stein, David R. Wood
2020	J	`jnl`	Minor-Closed Graph Classes with Bounded Layered Pathwidth. SIAM J. Discret. Math. Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood
2020	J	`jnl`	Nonrepetitive graph colouring. CoRR David R. Wood
2020	J	`jnl`	Notes on Graph Product Structure Theory. CoRR Zdenek Dvorák, Tony Huynh, Gwenaël Joret, Chun-Hung Liu, David R. Wood
2020	J	`jnl`	Notes on Tree- and Path-chromatic Number. CoRR Tony Huynh, Bruce A. Reed, David R. Wood, Liana Yepremyan
2020	J	`jnl`	Planar Graphs Have Bounded Queue-Number. J. ACM Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2020	J	`jnl`	Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
2020	J	`jnl`	Stack-number is not bounded by queue-number. CoRR Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood
2020	J	`jnl`	Subgraph densities in a surface. CoRR Tony Huynh, Gwenaël Joret, David R. Wood
2019	J	`jnl`	A Golden Ratio Inequality for Vertex Degrees of Graphs. Am. Math. Mon. Fiachra Knox, Bojan Mohar, David R. Wood
2019	J	`jnl`	Bad news for chordal partitions. J. Graph Theory Alex Scott, Paul D. Seymour, David R. Wood
2019	J	`jnl`	Clustered Colouring in Minor-Closed Classes. Comb. Sergey Norin, Alex Scott, Paul D. Seymour, David R. Wood
2019	J	`jnl`	Defective Colouring of Graphs Excluding A Subgraph or Minor. Comb. Patrice Ossona de Mendez, Sang-il Oum, David R. Wood
2019	J	`jnl`	Defective and clustered choosability of sparse graphs. Comb. Probab. Comput. Kevin Hendrey, David R. Wood
2019	J	`jnl`	Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor. J. Graph Theory Paul Wollan, David R. Wood
2019	A*	`conf`	Planar Graphs have Bounded Queue-Number. FOCS Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2019	J	`jnl`	Planar Graphs have Bounded Queue-Number. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2019	J	`jnl`	Planar graphs have bounded nonrepetitive chromatic number. CoRR Vida Dujmovic, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood
2019	J	`jnl`	Queue Layouts of Graphs with Bounded Degree and Bounded Genus. CoRR Vida Dujmovic, Pat Morin, David R. Wood
2019	J	`jnl`	The structure of k-planar graphs. CoRR Vida Dujmovic, Pat Morin, David R. Wood
2019	J	`jnl`	Track Layouts, Layered Path Decompositions, and Leveled Planarity. Algorithmica Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
2018	J	`jnl`	Anagram-Free Colorings of Graph Subdivisions. SIAM J. Discret. Math. Tim E. Wilson, David R. Wood
2018	J	`jnl`	Anagram-Free Graph Colouring. Electron. J. Comb. Tim E. Wilson, David R. Wood
2018	J	`jnl`	Better bounds for poset dimension and boxicity. CoRR Alex Scott, David R. Wood
2018	J	`jnl`	Corrigendum: Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
2018	J	`jnl`	Defective and Clustered Choosability of Sparse Graphs. CoRR Kevin Hendrey, David R. Wood
2018	J	`jnl`	Improper colourings inspired by Hadwiger's conjecture. J. Lond. Math. Soc. Jan van den Heuvel, David R. Wood
2018	J	`jnl`	K SIAM J. Discret. Math. Gwenaël Joret, David R. Wood
2018	J	`jnl`	Minor-closed graph classes with bounded layered pathwidth. CoRR Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood
2018	J	`jnl`	Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
2018	J	`jnl`	Seymour's conjecture on 2-connected graphs of large pathwidth. CoRR Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
2018	J	`jnl`	The exact chromatic number of the convex segment disjointness graph. CoRR Ruy Fabila-Monroy, Jakob Jonsson, Pavel Valtr, David R. Wood
2018	J	`jnl`	The extremal function for Petersen minors. J. Comb. Theory B Kevin Hendrey, David R. Wood
2018	J	`jnl`	The treewidth of line graphs. J. Comb. Theory B Daniel J. Harvey, David R. Wood
2018	J	`jnl`	Thickness and antithickness of graphs. J. Comput. Geom. Vida Dujmovic, David R. Wood
2018	J	`jnl`	Tight Upper Bounds on the Crossing Number in a Minor-Closed Class. CoRR Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood
2017	J	`jnl`	Hadwiger's Conjecture for ℓ-Link Graphs. J. Graph Theory Bin Jia, David R. Wood
2017	J	`jnl`	Layered separators in minor-closed graph classes with applications. J. Comb. Theory B Vida Dujmovic, Pat Morin, David R. Wood
2017	J	`jnl`	Majority Colourings of Digraphs. Electron. J. Comb. Stephan Kreutzer, Sang-il Oum, Paul D. Seymour, Dominic van der Zypen, David R. Wood
2017	J	`jnl`	Parameters Tied to Treewidth. J. Graph Theory Daniel J. Harvey, David R. Wood
2017	J	`jnl`	Structure of Graphs with Locally Restricted Crossings. SIAM J. Discret. Math. Vida Dujmovic, David Eppstein, David R. Wood
2017	J	`jnl`	Thickness and Antithickness of Graphs. CoRR Vida Dujmovic, David R. Wood
2016	J	`jnl`	$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs. CoRR Gwenaël Joret, David R. Wood
2016	J	`jnl`	'Forcing a sparse minor' - CORRIGENDUM. Comb. Probab. Comput. Bruce A. Reed, David R. Wood
2016	J	`jnl`	Average Degree Conditions Forcing a Minor. Electron. J. Comb. Daniel J. Harvey, David R. Wood
2016	J	`jnl`	Cliques in Graphs Excluding a Complete Graph Minor. Electron. J. Comb. David R. Wood
2016	J	`jnl`	Forcing a sparse minor. Comb. Probab. Comput. Bruce A. Reed, David R. Wood
2016	J	`jnl`	Layouts of Expander Graphs. Chic. J. Theor. Comput. Sci. Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood
2016	J	`jnl`	Nonrepetitive colouring via entropy compression. Comb. Vida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood
2016	J	`jnl`	On the maximum order of graphs embedded in surfaces. J. Comb. Theory B Eran Nevo, Guillermo Pineda-Villavicencio, David R. Wood
2016	J	`jnl`	Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking. Discret. Appl. Math. Tony Grubman, Y. Ahmet Sekercioglu, David R. Wood
2016	J	`jnl`	Thoughts on Barnette's Conjecture. Australas. J Comb. Helmut Alt, Michael S. Payne, Jens M. Schmidt, David R. Wood
2016	J	`jnl`	Three dimensional graph drawing with fixed vertices and one bend per edge. CoRR David R. Wood
2016	—	`ch.`	Three-Dimensional Graph Drawing. Encyclopedia of Algorithms David R. Wood
2016	A	`conf`	Track Layout Is Hard. GD Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
2015	J	`jnl`	3-Monotone Expanders. CoRR Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood
2015	J	`jnl`	Circumference and Pathwidth of Highly Connected Graphs. J. Graph Theory Emily Abernethy Marshall, David R. Wood
2015	J	`jnl`	Cycles of Given Size in a Dense Graph. SIAM J. Discret. Math. Daniel J. Harvey, David R. Wood
2015	J	`jnl`	Empty Pentagons in Point Sets with Collinearities. SIAM J. Discret. Math. János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
2015	A	`conf`	Genus, Treewidth, and Local Crossing Number. GD Vida Dujmovic, David Eppstein, David R. Wood
2015	J	`jnl`	Genus, Treewidth, and Local Crossing Number. CoRR Vida Dujmovic, David Eppstein, David R. Wood
2015	J	`jnl`	The Degree-Diameter Problem for Sparse Graph Classes. Electron. J. Comb. Guillermo Pineda-Villavicencio, David R. Wood
2015	J	`jnl`	Track Layouts, Layered Path Decompositions, and Leveled Planarity. CoRR Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
2015	J	`jnl`	Treewidth of the Line Graph of a Complete Graph. J. Graph Theory Daniel J. Harvey, David R. Wood
2014	J	`jnl`	Brooks' Vertex-Colouring Theorem in Linear Time. CoRR Bradley Baetz, David R. Wood
2014	J	`jnl`	General Position Subsets and Independent Hyperplanes in d-Space. CoRR Jean Cardinal, Csaba D. Tóth, David R. Wood
2014	J	`jnl`	On the Upward Planarity of Mixed Plane Graphs. J. Graph Algorithms Appl. Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood
2014	J	`jnl`	Progress on Dirac's Conjecture. Electron. J. Comb. Michael S. Payne, David R. Wood
2014	J	`jnl`	Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem. Electron. J. Comb. Daniel J. Harvey, David R. Wood
2014	J	`jnl`	Which point sets admit a k-angulation? J. Comput. Geom. Michael S. Payne, Jens M. Schmidt, David R. Wood
2013	J	`jnl`	A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. SIAM J. Discret. Math. Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood
2013	J	`jnl`	Complete graph minors and the graph minor structure theorem. J. Comb. Theory B Gwenaël Joret, David R. Wood
2013	J	`jnl`	Excluded Forest Minors and the Erdős-Pósa Property. Comb. Probab. Comput. Samuel Fiorini, Gwenaël Joret, David R. Wood
2013	A*	`conf`	Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring. FOCS Vida Dujmovic, Pat Morin, David R. Wood
2013	J	`jnl`	Layered Separators in Minor-Closed Families with Applications. CoRR Vida Dujmovic, Pat Morin, David R. Wood
2013	J	`jnl`	Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. Electron. J. Comb. Vida Dujmovic, Gwenaël Joret, Fabrizio Frati, David R. Wood
2013	J	`jnl`	On Multiplicative Sidon Sets. Integers David Wakeham, David R. Wood
2013	J	`jnl`	On the General Position Subset Selection Problem. SIAM J. Discret. Math. Michael S. Payne, David R. Wood
2013	A	`conf`	On the Upward Planarity of Mixed Plane Graphs. GD Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood
2013	J	`jnl`	Proximity Drawings of High-Degree Trees. Int. J. Comput. Geom. Appl. Ferran Hurtado, Giuseppe Liotta, David R. Wood
2013	J	`jnl`	Rooted K Electron. J. Comb. Ruy Fabila-Monroy, David R. Wood
2013	J	`jnl`	Treewidth of Cartesian Products of Highly Connected Graphs. J. Graph Theory David R. Wood
2012	J	`jnl`	A linear-time algorithm for finding a complete graph minor in a dense graph CoRR Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood
2012	J	`jnl`	An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains. SIAM J. Discret. Math. Vida Dujmovic, Gwenaël Joret, David R. Wood
2012	J	`jnl`	Characterisations and examples of graph classes with bounded expansion. Eur. J. Comb. Jaroslav Nesetril, Patrice Ossona de Mendez, David R. Wood
2012	—	`conf`	Cliques in Odd-Minor-Free Graphs. CATS Ken-ichi Kawarabayashi, David R. Wood
2012	J	`jnl`	Colouring the triangles determined by a point set. J. Comput. Geom. Ruy Fabila-Monroy, David R. Wood
2012	J	`jnl`	Empty pentagons in point sets with collinearities CoRR János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
2012	J	`jnl`	Excluded Forest Minors and the Erdős-Pósa Property CoRR Samuel Fiorini, Gwenaël Joret, David R. Wood
2012	J	`jnl`	Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours CoRR Vida Dujmovic, Fabrizio Frati, Gwenaël Joret, David R. Wood
2012	J	`jnl`	Nordhaus-Gaddum for treewidth. Eur. J. Comb. Gwenaël Joret, David R. Wood
2012	J	`jnl`	On the Connectivity of Visibility Graphs. Discret. Comput. Geom. Michael S. Payne, Attila Pór, Pavel Valtr, David R. Wood
2012	J	`jnl`	On the general position subset selection problem CoRR Michael S. Payne, David R. Wood
2012	J	`jnl`	PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geom. Appl. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood
2012	J	`jnl`	Polynomial treewidth forces a large grid-like-minor. Eur. J. Comb. Bruce A. Reed, David R. Wood
2012	J	`jnl`	Progress on Dirac's Conjecture CoRR Michael S. Payne, David R. Wood
2012	J	`jnl`	Small minors in dense graphs. Eur. J. Comb. Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood
2012	J	`jnl`	Token Graphs. Graphs Comb. Ruy Fabila-Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood
2012	J	`jnl`	Which point sets admit a k-angulation? CoRR Michael S. Payne, Jens M. Schmidt, David R. Wood
2011	J	`jnl`	Colouring the Square of the Cartesian Product of Trees. Discret. Math. Theor. Comput. Sci. David R. Wood
2011	J	`jnl`	Colouring the Triangles Determined by a Point Set CoRR Ruy Fabila-Monroy, David R. Wood
2011	J	`jnl`	Disproof of the List Hadwiger Conjecture CoRR János Barát, Gwenaël Joret, David R. Wood
2011	J	`jnl`	Disproof of the List Hadwiger Conjecture. Electron. J. Comb. János Barát, Gwenaël Joret, David R. Wood
2011	J	`jnl`	Every Large Point Set contains Many Collinear Points or an Empty Pentagon. Graphs Comb. Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood
2011	J	`jnl`	Nonrepetitive Colouring via Entropy Compression CoRR Vida Dujmovic, Gwenaël Joret, David R. Wood
2011	J	`jnl`	Nordhaus-Gaddum for Treewidth CoRR Gwenaël Joret, David R. Wood
2011	J	`jnl`	On the Book Thickness of k-Trees. Discret. Math. Theor. Comput. Sci. David R. Wood, Vida Dujmovic
2011	J	`jnl`	On the maximum number of cliques in a graph embedded in a surface. Eur. J. Comb. Vida Dujmovic, Gasper Fijavz, Gwenaël Joret, Thom Sulanke, David R. Wood
2011	J	`jnl`	On the number of maximal independent sets in a graph CoRR David R. Wood
2011	J	`jnl`	On the number of maximal independent sets in a graph. Discret. Math. Theor. Comput. Sci. David R. Wood
2011	—	`conf`	The Chromatic Number of the Convex Segment Disjointness Graph. EGC Ruy Fabila-Monroy, David R. Wood
2011	J	`jnl`	The chromatic number of the convex segment disjointness graph CoRR Ruy Fabila-Monroy, David R. Wood
2011	J	`jnl`	Treewidth of Cartesian Products of Highly Connected Graphs CoRR David R. Wood
2010	J	`jnl`	Contractibility and the Hadwiger Conjecture. Eur. J. Comb. David R. Wood
2010	J	`jnl`	Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discret. Math. Theor. Comput. Sci. Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood
2010	J	`jnl`	Extremal Graph Theory for Metric Dimension and Diameter. Electron. J. Comb. M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood
2010	J	`jnl`	Graph Minors and Minimum Degree. Electron. J. Comb. Gasper Fijavz, David R. Wood
2010	J	`jnl`	Irreducible triangulations are small. J. Comb. Theory B Gwenaël Joret, David R. Wood
2010	J	`jnl`	On Visibility and Blockers. J. Comput. Geom. Attila Pór, David R. Wood
2010	J	`jnl`	Partitions and Coverings of Trees by Bounded-Degree Subtrees CoRR David R. Wood
2010	J	`jnl`	Proximity Drawings of High-Degree Trees CoRR Ferran Hurtado, Giuseppe Liotta, David R. Wood
2010	J	`jnl`	Small Minors in Dense Graphs. CoRR Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood
2010	J	`jnl`	Thomassen's Choosability Argument Revisited. CoRR David R. Wood, Svante Linusson
2010	J	`jnl`	Thomassen's Choosability Argument Revisited. SIAM J. Discret. Math. David R. Wood, Svante Linusson
2009	J	`jnl`	A Polynomial Bound for Untangling Geometric Planar Graphs. Discret. Comput. Geom. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood
2009	J	`jnl`	A linear-time algorithm to find a separator in a graph excluding a minor. ACM Trans. Algorithms Bruce A. Reed, David R. Wood
2009	J	`jnl`	Colourings of the cartesian product of graphs and multiplicative Sidon sets. Comb. Attila Pór, David R. Wood
2009	J	`jnl`	Compatible geometric matchings. Comput. Geom. Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood
2009	—	`conf`	Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CCCG Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood
2009	J	`jnl`	Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CoRR Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood
2009	J	`jnl`	On the Chromatic Number of some Flip Graphs. Discret. Math. Theor. Comput. Sci. Ruy Fabila-Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood, Jorge Urrutia
2009	J	`jnl`	On tree-partition-width. Eur. J. Comb. David R. Wood
2009	J	`jnl`	The distance geometry of music. Comput. Geom. Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2008	J	`jnl`	A Characterization of the degree sequences of 2-trees. J. Graph Theory Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer
2008	J	`jnl`	A Polynomial Bound for Untangling Geometric Planar Graphs. Electron. Notes Discret. Math. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin, Stefan Langerman, David R. Wood
2008	J	`jnl`	Bounded-Degree Graphs have Arbitrarily Large Queue-Number. Discret. Math. Theor. Comput. Sci. David R. Wood
2008	J	`jnl`	Compatible Geometric Matchings. Electron. Notes Discret. Math. Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood
2008	J	`jnl`	Distinct Distances in Graph Drawings. Electron. J. Comb. Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood
2008	—	`conf`	Improved upper bounds on the crossing number. SCG Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood
2008	J	`jnl`	Minimum Degree and Graph Minors. Electron. Notes Discret. Math. Gasper Fijavz, David R. Wood
2008	J	`jnl`	Notes on Nonrepetitive Graph Colouring. Electron. J. Comb. János Barát, David R. Wood
2008	J	`jnl`	On the Parameterized Complexity of Layered Graph Drawing. Algorithmica Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood
2008	J	`jnl`	The Minor Crossing Number of Graphs with an Excluded Minor. Electron. J. Comb. Drago Bokal, Gasper Fijavz, David R. Wood
2007	—	`conf`	A Characterization of the Degree Sequences of 2-trees. ANALCO Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer
2007	J	`jnl`	A polynomial bound for untangling geometric planar graphs CoRR Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood
2007	J	`jnl`	Clique Minors in Cartesian Products of Graphs. CoRR David R. Wood
2007	J	`jnl`	Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets. Electron. Notes Discret. Math. Attila Pór, David R. Wood
2007	J	`jnl`	Drawings of planar graphs with few slopes and segments. Comput. Geom. Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood
2007	J	`jnl`	Extremal Graph Theory for Metric Dimension and Diameter. Electron. Notes Discret. Math. M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood
2007	J	`jnl`	Graph Treewidth and Geometric Thickness Parameters. Discret. Comput. Geom. Vida Dujmovic, David R. Wood
2007	J	`jnl`	Graph drawings with few slopes. Comput. Geom. Vida Dujmovic, Matthew Suderman, David R. Wood
2007	J	`jnl`	Independent Sets in Graphs with an Excluded Clique Minor. Discret. Math. Theor. Comput. Sci. David R. Wood
2007	J	`jnl`	No-Three-in-Line-in-3D. Algorithmica Attila Pór, David R. Wood
2007	J	`jnl`	On the Complexity of the Balanced Vertex Ordering Problem. Discret. Math. Theor. Comput. Sci. Jan Kára, Jan Kratochvíl, David R. Wood
2007	J	`jnl`	On the Maximum Number of Cliques in a Graph. Graphs Comb. David R. Wood
2007	J	`jnl`	On the Metric Dimension of Cartesian Products of Graphs. SIAM J. Discret. Math. José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara, David R. Wood
2007	J	`jnl`	On the oriented chromatic number of dense graphs. Contributions Discret. Math. David R. Wood
2007	J	`jnl`	Simultaneous diagonal flips in plane triangulations. J. Graph Theory Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
2007	J	`jnl`	The Distance Geometry of Music CoRR Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2006	J	`jnl`	A Characterization of the Degree Sequences of 2-Trees CoRR Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer
2006	J	`jnl`	A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
2006	J	`jnl`	Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. Electron. J. Comb. János Barát, Jirí Matousek, David R. Wood
2006	J	`jnl`	Characterisations of intersection graphs by vertex orderings. Australas. J Comb. David R. Wood
2006	J	`jnl`	Drawing a Graph in a Hypercube. Electron. J. Comb. David R. Wood
2006	J	`jnl`	Induced Subgraphs of Bounded Degree and Bounded Treewidth. Contributions Discret. Math. Prosenjit Bose, Vida Dujmovic, David R. Wood
2006	J	`jnl`	Partitions of complete geometric graphs into plane trees. Comput. Geom. Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
2006	A	`conf`	Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. GD David R. Wood, Jan Arne Telle
2006	A*	`conf`	Simultaneous diagonal flips in plane triangulations. SODA Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
2006	J	`jnl`	Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Algorithmica Therese Biedl, Torsten Thiele, David R. Wood
2006	J	`jnl`	Upward Three-Dimensional Grid Drawings of Graphs. Order Vida Dujmovic, David R. Wood
2006	J	`jnl`	Vertex partitions of chordal graphs. J. Graph Theory David R. Wood
2005	J	`jnl`	A Simple Proof of the F{á}ry-Wagner Theorem CoRR David R. Wood
2005	J	`jnl`	Acyclic, Star and Oriented Colourings of Graph Subdivisions. Discret. Math. Theor. Comput. Sci. David R. Wood
2005	J	`jnl`	Balanced vertex-orderings of graphs. Discret. Appl. Math. Therese Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood
2005	A	`conf`	Graph Treewidth and Geometric Thickness Parameters. GD Vida Dujmovic, David R. Wood
2005	J	`jnl`	Grid drawings of Comput. Geom. David R. Wood
2005	B	`conf`	Induced Subgraphs of Bounded Degree and Bounded Treewidth. WG Prosenjit Bose, Vida Dujmovic, David R. Wood
2005	J	`jnl`	Layout of Graphs with Bounded Tree-Width. SIAM J. Comput. Vida Dujmovic, Pat Morin, David R. Wood
2005	J	`jnl`	On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane. Discret. Comput. Geom. Jan Kára, Attila Pór, David R. Wood
2005	Misc	`conf`	On the Complexity of the Balanced Vertex Ordering Problem. COCOON Jan Kára, Jan Kratochvíl, David R. Wood
2005	J	`jnl`	Queue Layouts of Graph Products and Powers. Discret. Math. Theor. Comput. Sci. David R. Wood
2005	J	`jnl`	Simultaneous Diagonal Flips in Plane Triangulations CoRR Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
2005	J	`jnl`	Stacks, Queues and Tracks: Layouts of Graph Subdivisions. Discret. Math. Theor. Comput. Sci. Vida Dujmovic, David R. Wood
2005	—	`conf`	The Distance Geometry of Deep Rhythms and Scales. CCCG Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2004	J	`jnl`	Bounded degree acyclic decompositions of digraphs. J. Comb. Theory B David R. Wood
2004	J	`jnl`	Characterisations of Intersection Graphs by Vertex Orderings CoRR David R. Wood
2004	J	`jnl`	Dimension-exchange algorithms for token distribution on tree-connected architectures. J. Parallel Distributed Comput. Michael E. Houle, Antonios Symvonis, David R. Wood
2004	J	`jnl`	Layout of Graphs with Bounded Tree-Width CoRR Vida Dujmovic, Pat Morin, David R. Wood
2004	A	`conf`	Layouts of Graph Subdivisions. GD Vida Dujmovic, David R. Wood
2004	J	`jnl`	Light edges in degree-constrained graphs. Discret. Math. Prosenjit Bose, Michiel H. M. Smid, David R. Wood
2004	J	`jnl`	Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout. Algorithmica David R. Wood
2004	A	`conf`	No-Three-in-Line-in-3D. GD Attila Pór, David R. Wood
2004	J	`jnl`	On Linear Layouts of Graphs. Discret. Math. Theor. Comput. Sci. Vida Dujmovic, David R. Wood
2004	A	`conf`	Partitions of Complete Geometric Graphs into Plane Trees. GD Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
2004	A	`conf`	Really Straight Graph Drawings. GD Vida Dujmovic, Matthew Suderman, David R. Wood
2004	J	`jnl`	The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. J. Graph Algorithms Appl. Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood
2004	J	`jnl`	Three-Dimensional 1-Bend Graph Drawings. J. Graph Algorithms Appl. Pat Morin, David R. Wood
2004	—	`conf`	Three-dimensional 1-bend graph drawings. CCCG Pat Morin, David R. Wood
2004	J	`jnl`	Track Layouts of Graphs CoRR Vida Dujmovic, Attila Pór, David R. Wood
2004	J	`jnl`	Track Layouts of Graphs. Discret. Math. Theor. Comput. Sci. Vida Dujmovic, Attila Pór, David R. Wood
2003	J	`jnl`	Geometric thickness in a grid. Discret. Math. David R. Wood
2003	J	`jnl`	Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. J. Graph Algorithms Appl. David R. Wood
2003	J	`jnl`	Optimal three-dimensional orthogonal graph drawing in the general position model. Theor. Comput. Sci. David R. Wood
2003	A	`conf`	Three-Dimensional Grid Drawings with Sub-quadratic Volume. GD Vida Dujmovic, David R. Wood
2003	B	`conf`	Tree-Partitions of k-Trees with Applications in Graph Layout. WG Vida Dujmovic, David R. Wood
2002	—	`conf`	Cost-optimal quadtrees for ray shooting. CCCG Hervé Brönnimann, Marc Glisse, David R. Wood
2002	J	`jnl`	Degree constrained book embeddings. J. Algorithms David R. Wood
2002	B	`conf`	Dimension-Exchange Algorithms for Load Balancing on Trees. SIROCCO Michael E. Houle, Antonios Symvonis, David R. Wood
2002	—	`conf`	Light edges in degree-constrained graphs. CCCG Prosenjit Bose, Michiel H. M. Smid, David R. Wood
2002	J	`jnl`	Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms. Comput. J. Alan Roberts, Antonios Symvonis, David R. Wood
2002	J	`jnl`	On vertex-magic and edge-magic total injections of graphs. Australas. J Comb. David R. Wood
2002	A	`conf`	Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. GD Vida Dujmovic, Pat Morin, David R. Wood
2002	—	`conf`	Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. FSTTCS David R. Wood
2001	A	`conf`	A Fixed-Parameter Approach to Two-Layer Planarization. GD Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
2001	A	`conf`	Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing. GD David R. Wood
2001	J	`jnl`	Geometric Thickness in a Grid of Linear Area. Electron. Notes Discret. Math. David R. Wood
2001	A	`conf`	On the Parameterized Complexity of Layered Graph Drawing. ESA Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
2001	A	`conf`	Orthogonal Drawings with Few Layers. GD Therese Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood
2000	A	`conf`	Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. GD David R. Wood
2000	B	`conf`	Lower bounds for hot-potato permutation routing on trees. SIROCCO Alan Roberts, Antonios Symvonis, David R. Wood
2000	A	`conf`	Refinement of Three-Dimensional Orthogonal Graph Drawings. GD Benjamin Yin-Sun Lynn, Antonios Symvonis, David R. Wood
2000	A	`conf`	Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. GD Therese Biedl, Torsten Thiele, David R. Wood
1999	A	`conf`	Multi-dimensional Orthogonal Graph Drawing with Small Boxes. GD David R. Wood
1998	A	`conf`	An Algorithm for Three-Dimensional Orthogonal Graph Drawing. GD David R. Wood
1997	J	`jnl`	An algorithm for finding a maximum clique in a graph. Oper. Res. Lett. David R. Wood