Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
David R. Wood
2010 – today
- 2013
[j81]Vida Dujmovic, Gwenaël Joret, Fabrizio Frati, David R. Wood: Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. Electr. J. Comb. 20(1): P51 (2013)- [j80]Gwenaël Joret, David R. Wood: Complete graph minors and the graph minor structure theorem. J. Comb. Theory, Ser. B 103(1): 61-74 (2013)
- [j79]David R. Wood: Treewidth of Cartesian Products of Highly Connected Graphs. Journal of Graph Theory 73(3): 318-321 (2013)
- 2012
- [j78]Michael S. Payne, Attila Pór, Pavel Valtr, David R. Wood: On the Connectivity of Visibility Graphs. Discrete & Computational Geometry 48(3): 669-681 (2012)
- [j77]Jaroslav Nesetril, Patrice Ossona de Mendez, David R. Wood: Characterisations and examples of graph classes with bounded expansion. Eur. J. Comb. 33(3): 350-373 (2012)
- [j76]Bruce A. Reed, David R. Wood: Polynomial treewidth forces a large grid-like-minor. Eur. J. Comb. 33(3): 374-379 (2012)
- [j75]
- [j74]Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood: Small minors in dense graphs. Eur. J. Comb. 33(6): 1226-1245 (2012)
- [j73]Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood: Token Graphs. Graphs and Combinatorics 28(3): 365-380 (2012)
- [j72]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood: PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geometry Appl. 22(5): 439-470 (2012)
- [j71]Ruy Fabila Monroy, David R. Wood: Colouring the triangles determined by a point set. JoCG 3(1): 86-101 (2012)
- [j70]Vida Dujmovic, Gwenaël Joret, David R. Wood: An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains. SIAM J. Discrete Math. 26(3): 1068-1075 (2012)
- [c32]
- [i24]Vida Dujmovic, Fabrizio Frati, Gwenaël Joret, David R. Wood: Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours. CoRR abs/1202.1569 (2012)
- [i23]Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood: A linear-time algorithm for finding a complete graph minor in a dense graph. CoRR abs/1202.2624 (2012)
- [i22]Michael S. Payne, Jens M. Schmidt, David R. Wood: Which point sets admit a k-angulation? CoRR abs/1203.3618 (2012)
- [i21]Samuel Fiorini, Gwenaël Joret, David R. Wood: Excluded Forest Minors and the Erdős-Pósa Property. CoRR abs/1204.5192 (2012)
- [i20]
- [i19]János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood: Empty pentagons in point sets with collinearities. CoRR abs/1207.3633 (2012)
- [i18]Michael S. Payne, David R. Wood: On the general position subset selection problem. CoRR abs/1208.5289 (2012)
- 2011
- [j69]János Barát, Gwenaël Joret, David R. Wood: Disproof of the List Hadwiger Conjecture. Electr. J. Comb. 18(1) (2011)
- [j68]David R. Wood, Vida Dujmovic: On the Book Thickness of k-Trees. Discrete Mathematics & Theoretical Computer Science 13(3): 39-44 (2011)
- [j67]Vida Dujmovic, Gasper Fijavz, Gwenaël Joret, Thom Sulanke, David R. Wood: On the maximum number of cliques in a graph embedded in a surface. Eur. J. Comb. 32(8): 1244-1252 (2011)
- [j66]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood: Every Large Point Set contains Many Collinear Points or an Empty Pentagon. Graphs and Combinatorics 27(1): 47-60 (2011)
- [i17]
- [i16]David R. Wood: Treewidth of Cartesian Products of Highly Connected Graphs. CoRR abs/1105.1586 (2011)
- [i15]Ruy Fabila Monroy, David R. Wood: The chromatic number of the convex segment disjointness graph. CoRR abs/1105.4931 (2011)
- [i14]
- [i13]Ruy Fabila Monroy, David R. Wood: Colouring the Triangles Determined by a Point Set. CoRR abs/1109.3218 (2011)
- [i12]János Barát, Gwenaël Joret, David R. Wood: Disproof of the List Hadwiger Conjecture. CoRR abs/1110.2272 (2011)
- [i11]Vida Dujmovic, Gwenaël Joret, David R. Wood: Nonrepetitive Colouring via Entropy Compression. CoRR abs/1112.5524 (2011)
- 2010
- [j65]
- [j64]M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood: Extremal Graph Theory for Metric Dimension and Diameter. Electr. J. Comb. 17(1) (2010)
- [j63]Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood: Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discrete Mathematics & Theoretical Computer Science 12(1): 75-86 (2010)
- [j62]
- [j61]Gwenaël Joret, David R. Wood: Irreducible triangulations are small. J. Comb. Theory, Ser. B 100(5): 446-455 (2010)
- [j60]
- [j59]David R. Wood, Svante Linusson: Thomassen's Choosability Argument Revisited. SIAM J. Discrete Math. 24(4): 1632-1637 (2010)
- [i10]David R. Wood: Partitions and Coverings of Trees by Bounded-Degree Subtrees. CoRR abs/1008.3190 (2010)
- [i9]Ferran Hurtado, Giuseppe Liotta, David R. Wood: Proximity Drawings of High-Degree Trees. CoRR abs/1008.3193 (2010)
2000 – 2009
- 2009
- [j58]Attila Pór, David R. Wood: Colourings of the cartesian product of graphs and multiplicative Sidon sets. Combinatorica 29(4): 449-466 (2009)
- [j57]Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The distance geometry of music. Comput. Geom. 42(5): 429-454 (2009)
- [j56]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: Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009)
- [j55]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood: A Polynomial Bound for Untangling Geometric Planar Graphs. Discrete & Computational Geometry 42(4): 570-585 (2009)
- [j54]Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood, Jorge Urrutia: On the Chromatic Number of some Flip Graphs. Discrete Mathematics & Theoretical Computer Science 11(2): 47-56 (2009)
- [j53]
- [j52]Bruce A. Reed, David R. Wood: A linear-time algorithm to find a separator in a graph excluding a minor. ACM Transactions on Algorithms 5(4) (2009)
- [c31]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott D. Kominers, Stefan Langerman, Attila Pór, David R. Wood: Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CCCG 2009: 99-102
- 2008
- [j51]Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008)
- [j50]
- [j49]Drago Bokal, Gasper Fijavz, David R. Wood: The Minor Crossing Number of Graphs with an Excluded Minor. Electr. J. Comb. 15(1) (2008)
- [j48]Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood: Distinct Distances in Graph Drawings. Electr. J. Comb. 15(1) (2008)
- [j47]David R. Wood: Bounded-Degree Graphs have Arbitrarily Large Queue-Number. Discrete Mathematics & Theoretical Computer Science 10(1) (2008)
- [j46]Gasper Fijavz, David R. Wood: Minimum Degree and Graph Minors. Electronic Notes in Discrete Mathematics 31: 79-83 (2008)
- [j45]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: Compatible Geometric Matchings. Electronic Notes in Discrete Mathematics 31: 201-206 (2008)
- [j44]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin, Stefan Langerman, David R. Wood: A Polynomial Bound for Untangling Geometric Planar Graphs. Electronic Notes in Discrete Mathematics 31: 213-218 (2008)
- [j43]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer: A Characterization of the degree sequences of 2-trees. Journal of Graph Theory 58(3): 191-209 (2008)
- [c30]Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood: Improved upper bounds on the crossing number. Symposium on Computational Geometry 2008: 375-384
- 2007
- [j42]
- [j41]David R. Wood: On the oriented chromatic number of dense graphs. Contributions to Discrete Mathematics 2(2) (2007)
- [j40]Vida Dujmovic, Matthew Suderman, David R. Wood: Graph drawings with few slopes. Comput. Geom. 38(3): 181-193 (2007)
- [j39]Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood: Drawings of planar graphs with few slopes and segments. Comput. Geom. 38(3): 194-212 (2007)
- [j38]Vida Dujmovic, David R. Wood: Graph Treewidth and Geometric Thickness Parameters. Discrete & Computational Geometry 37(4): 641-670 (2007)
- [j37]Jan Kára, Jan Kratochvíl, David R. Wood: On the Complexity of the Balanced Vertex Ordering Problem. Discrete Mathematics & Theoretical Computer Science 9(1) (2007)
- [j36]David R. Wood: Independent Sets in Graphs with an Excluded Clique Minor. Discrete Mathematics & Theoretical Computer Science 9(1) (2007)
- [j35]Attila Pór, David R. Wood: Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets. Electronic Notes in Discrete Mathematics 28: 33-40 (2007)
- [j34]M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood: Extremal Graph Theory for Metric Dimension and Diameter. Electronic Notes in Discrete Mathematics 29: 339-343 (2007)
- [j33]David R. Wood: On the Maximum Number of Cliques in a Graph. Graphs and Combinatorics 23(3): 337-352 (2007)
- [j32]Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood: Simultaneous diagonal flips in plane triangulations. Journal of Graph Theory 54(4): 307-330 (2007)
- [j31]José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara, David R. Wood: On the Metric Dimension of Cartesian Products of Graphs. SIAM J. Discrete Math. 21(2): 423-441 (2007)
- [c29]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer: A Characterization of the Degree Sequences of 2-trees. ANALCO 2007: 232-241
- [i8]Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The Distance Geometry of Music. CoRR abs/0705.4085 (2007)
- [i7]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood: A polynomial bound for untangling geometric planar graphs. CoRR abs/0710.1641 (2007)
- 2006
- [j30]Therese C. Biedl, Torsten Thiele, David R. Wood: Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Algorithmica 44(3): 233-255 (2006)
- [j29]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: A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006)
- [j28]Prosenjit Bose, Vida Dujmovic, David R. Wood: Induced Subgraphs of Bounded Degree and Bounded Treewidth. Contributions to Discrete Mathematics 1(1) (2006)
- [j27]János Barát, Jirí Matousek, David R. Wood: Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. Electr. J. Comb. 13(1) (2006)
- [j26]
- [j25]Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood: Partitions of complete geometric graphs into plane trees. Comput. Geom. 34(2): 116-125 (2006)
- [j24]
- [j23]Vida Dujmovic, David R. Wood: Upward Three-Dimensional Grid Drawings of Graphs. Order 23(1): 1-20 (2006)
- [c28]David R. Wood, Jan Arne Telle: Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. Graph Drawing 2006: 150-161
- [c27]Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood: Simultaneous diagonal flips in plane triangulations. SODA 2006: 212-221
- [i6]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer: A Characterization of the Degree Sequences of 2-Trees. CoRR abs/cs/0605011 (2006)
- 2005
- [j22]
- [j21]Therese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood: Balanced vertex-orderings of graphs. Discrete Applied Mathematics 148(1): 27-48 (2005)
- [j20]Jan Kára, Attila Pór, David R. Wood: On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane. Discrete & Computational Geometry 34(3): 497-506 (2005)
- [j19]David R. Wood: Acyclic, Star and Oriented Colourings of Graph Subdivisions. Discrete Mathematics & Theoretical Computer Science 7(1): 37-50 (2005)
- [j18]Vida Dujmovic, David R. Wood: Stacks, Queues and Tracks: Layouts of Graph Subdivisions. Discrete Mathematics & Theoretical Computer Science 7(1): 155-202 (2005)
- [j17]David R. Wood: Queue Layouts of Graph Products and Powers. Discrete Mathematics & Theoretical Computer Science 7(1): 255-268 (2005)
- [j16]Vida Dujmovic, Pat Morin, David R. Wood: Layout of Graphs with Bounded Tree-Width. SIAM J. Comput. 34(3): 553-579 (2005)
- [c26]Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The Distance Geometry of Deep Rhythms and Scales. CCCG 2005: 163-166
- [c25]Jan Kára, Jan Kratochvíl, David R. Wood: On the Complexity of the Balanced Vertex Ordering Problem. COCOON 2005: 849-858
- [c24]Vida Dujmovic, David R. Wood: Graph Treewidth and Geometric Thickness Parameters. Graph Drawing 2005: 129-140
- [c23]Prosenjit Bose, Vida Dujmovic, David R. Wood: Induced Subgraphs of Bounded Degree and Bounded Treewidth. WG 2005: 175-186
- [i5]
- [i4]Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood: Simultaneous Diagonal Flips in Plane Triangulations. CoRR abs/math/0509478 (2005)
- 2004
- [j15]David R. Wood: Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout. Algorithmica 39(3): 235-253 (2004)
- [j14]Prosenjit Bose, Michiel H. M. Smid, David R. Wood: Light edges in degree-constrained graphs. Discrete Mathematics 282(1-3): 35-41 (2004)
- [j13]Vida Dujmovic, David R. Wood: On Linear Layouts of Graphs. Discrete Mathematics & Theoretical Computer Science 6(2): 339-358 (2004)
- [j12]Vida Dujmovic, Attila Pór, David R. Wood: Track Layouts of Graphs. Discrete Mathematics & Theoretical Computer Science 6(2): 497-522 (2004)
- [j11]David R. Wood: Bounded degree acyclic decompositions of digraphs. J. Comb. Theory, Ser. B 90(2): 309-313 (2004)
- [j10]Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood: The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. J. Graph Algorithms Appl. 8: 21-26 (2004)
- [j9]Pat Morin, David R. Wood: Three-Dimensional 1-Bend Graph Drawings. J. Graph Algorithms Appl. 8(2): 357-366 (2004)
- [j8]Michael E. Houle, Antonios Symvonis, David R. Wood: Dimension-exchange algorithms for token distribution on tree-connected architectures. J. Parallel Distrib. Comput. 64(5): 591-605 (2004)
- [c22]
- [c21]Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood: Partitions of Complete Geometric Graphs into Plane Trees. Graph Drawing 2004: 71-81
- [c20]Vida Dujmovic, Matthew Suderman, David R. Wood: Really Straight Graph Drawings. Graph Drawing 2004: 122-132
- [c19]
- [c18]
- [i3]David R. Wood: Characterisations of Intersection Graphs by Vertex Orderings. CoRR cs.DM/0404031 (2004)
- [i2]Vida Dujmovic, Pat Morin, David R. Wood: Layout of Graphs with Bounded Tree-Width. CoRR cs.DM/0406024 (2004)
- [i1]
- 2003
- [j7]
- [j6]David R. Wood: Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. J. Graph Algorithms Appl. 7(1): 33-77 (2003)
- [j5]David R. Wood: Optimal three-dimensional orthogonal graph drawing in the general position model. Theor. Comput. Sci. 1-3(299): 151-178 (2003)
- [c17]Vida Dujmovic, David R. Wood: Three-Dimensional Grid Drawings with Sub-quadratic Volume. Graph Drawing 2003: 190-201
- [c16]Vida Dujmovic, David R. Wood: Tree-Partitions of k-Trees with Applications in Graph Layout. WG 2003: 205-217
- 2002
- [j4]Alan Roberts, Antonios Symvonis, David R. Wood: Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms. Comput. J. 45(4): 423-435 (2002)
- [j3]
- [c15]Hervé Brönnimann, Marc Glisse, David R. Wood: Cost-optimal quadtrees for ray shooting. CCCG 2002: 109-112
- [c14]Prosenjit Bose, Michiel H. M. Smid, David R. Wood: Light edges in degree-constrained graphs. CCCG 2002: 142-145
- [c13]
- [c12]Vida Dujmovic, Pat Morin, David R. Wood: Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. Graph Drawing 2002: 42-53
- [c11]Michael E. Houle, Antonios Symvonis, David R. Wood: Dimension-Exchange Algorithms for Load Balancing on Trees. SIROCCO 2002: 181-196
- 2001
- [j2]David R. Wood: Geometric Thickness in a Grid of Linear Area. Electronic Notes in Discrete Mathematics 10: 291-296 (2001)
- [c10]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: On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499
- [c9]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: A Fixed-Parameter Approach to Two-Layer Planarization. Graph Drawing 2001: 1-15
- [c8]Therese C. Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood: Orthogonal Drawings with Few Layers. Graph Drawing 2001: 297-311
- [c7]David R. Wood: Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing. Graph Drawing 2001: 312-327
- 2000
- [c6]David R. Wood: Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. Graph Drawing 2000: 259-271
- [c5]Therese C. Biedl, Torsten Thiele, David R. Wood: Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Graph Drawing 2000: 284-295
- [c4]Benjamin Yin-Sun Lynn, Antonios Symvonis, David R. Wood: Refinement of Three-Dimensional Orthogonal Graph Drawings. Graph Drawing 2000: 308-320
- [c3]Alan Roberts, Antonios Symvonis, David R. Wood: Lower bounds for hot-potato permutation routing on trees. SIROCCO 2000: 281-295
1990 – 1999
- 1999
- [c2]David R. Wood: Multi-dimensional Orthogonal Graph Drawing with Small Boxes. Graph Drawing 1999: 311-322
- 1998
- [c1]David R. Wood: An Algorithm for Three-Dimensional Orthogonal Graph Drawing. Graph Drawing 1998: 332-346
- 1997
- [j1]David R. Wood: An algorithm for finding a maximum clique in a graph. Oper. Res. Lett. 21(5): 211-217 (1997)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-14 21:43 CEST by the dblp team