The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David R. Wood: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Prosenjit Bose, Michiel H. M. Smid, David R. Wood
    Light edges in degree-constrained graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:142-145 [Conf]
  2. Hervé Brönnimann, Marc Glisse, David R. Wood
    Cost-optimal quadtrees for ray shooting. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:109-112 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:163-166 [Conf]
  4. Pat Morin, David R. Wood
    Three-dimensional 1-bend graph drawings. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:40-43 [Conf]
  5. Jan Kára, Jan Kratochvíl, David R. Wood
    On the Complexity of the Balanced Vertex Ordering Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:849-858 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:488-499 [Conf]
  7. David R. Wood
    Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:348-359 [Conf]
  8. Therese C. Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood
    Orthogonal Drawings with Few Layers. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:297-311 [Conf]
  9. Therese C. Biedl, Torsten Thiele, David R. Wood
    Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:284-295 [Conf]
  10. Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
    Partitions of Complete Geometric Graphs into Plane Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:71-81 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:1-15 [Conf]
  12. Vida Dujmovic, Pat Morin, David R. Wood
    Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:42-53 [Conf]
  13. Vida Dujmovic, Matthew Suderman, David R. Wood
    Really Straight Graph Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:122-132 [Conf]
  14. Vida Dujmovic, David R. Wood
    Three-Dimensional Grid Drawings with Sub-quadratic Volume. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:190-201 [Conf]
  15. Vida Dujmovic, David R. Wood
    Layouts of Graph Subdivisions. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:133-143 [Conf]
  16. Vida Dujmovic, David R. Wood
    Graph Treewidth and Geometric Thickness Parameters. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:129-140 [Conf]
  17. Benjamin Yin-Sun Lynn, Antonios Symvonis, David R. Wood
    Refinement of Three-Dimensional Orthogonal Graph Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:308-320 [Conf]
  18. Attila Pór, David R. Wood
    No-Three-in-Line-in-3D. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:395-402 [Conf]
  19. David R. Wood
    Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:259-271 [Conf]
  20. David R. Wood
    Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:312-327 [Conf]
  21. David R. Wood
    An Algorithm for Three-Dimensional Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:332-346 [Conf]
  22. David R. Wood
    Multi-dimensional Orthogonal Graph Drawing with Small Boxes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:311-322 [Conf]
  23. David R. Wood, Jan Arne Telle
    Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:150-161 [Conf]
  24. Michael E. Houle, Antonios Symvonis, David R. Wood
    Dimension-Exchange Algorithms for Load Balancing on Trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:181-196 [Conf]
  25. Alan Roberts, Antonios Symvonis, David R. Wood
    Lower bounds for hot-potato permutation routing on trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:281-295 [Conf]
  26. Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
    Simultaneous diagonal flips in plane triangulations. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:212-221 [Conf]
  27. Prosenjit Bose, Vida Dujmovic, David R. Wood
    Induced Subgraphs of Bounded Degree and Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:175-186 [Conf]
  28. Vida Dujmovic, David R. Wood
    Tree-Partitions of k-Trees with Applications in Graph Layout. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:205-217 [Conf]
  29. Therese C. Biedl, Torsten Thiele, David R. Wood
    Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:3, pp:233-255 [Journal]
  30. David R. Wood
    Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:3, pp:235-253 [Journal]
  31. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:159-182 [Journal]
  32. Alan Roberts, Antonios Symvonis, David R. Wood
    Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2002, v:45, n:4, pp:423-435 [Journal]
  33. Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
    Partitions of complete geometric graphs into plane trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:116-125 [Journal]
  34. David R. Wood
    Grid drawings of k-colourable graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:1, pp:25-28 [Journal]
  35. David R. Wood
    Characterisations of Intersection Graphs by Vertex Orderings [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  36. Vida Dujmovic, Pat Morin, David R. Wood
    Layout of Graphs with Bounded Tree-Width [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  37. Vida Dujmovic, Attila Pór, David R. Wood
    Track Layouts of Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  38. Therese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood
    Balanced vertex-orderings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:148, n:1, pp:27-48 [Journal]
  39. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:3, pp:497-506 [Journal]
  40. Prosenjit Bose, Michiel H. M. Smid, David R. Wood
    Light edges in degree-constrained graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:35-41 [Journal]
  41. David R. Wood
    Geometric thickness in a grid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:221-234 [Journal]
  42. David R. Wood
    Degree constrained book embeddings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:144-154 [Journal]
  43. David R. Wood
    Bounded degree acyclic decompositions of digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:2, pp:309-313 [Journal]
  44. Pat Morin, David R. Wood
    Three-Dimensional 1-Bend Graph Drawings. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:2, pp:357-366 [Journal]
  45. Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood
    The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:, pp:21-26 [Journal]
  46. David R. Wood
    Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:1, pp:33-77 [Journal]
  47. Michael E. Houle, Antonios Symvonis, David R. Wood
    Dimension-exchange algorithms for token distribution on tree-connected architectures. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:5, pp:591-605 [Journal]
  48. Vida Dujmovic, David R. Wood
    Upward Three-Dimensional Grid Drawings of Graphs. [Citation Graph (0, 0)][DBLP]
    Order, 2006, v:23, n:1, pp:1-20 [Journal]
  49. David R. Wood
    An algorithm for finding a maximum clique in a graph. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:5, pp:211-217 [Journal]
  50. Vida Dujmovic, Pat Morin, David R. Wood
    Layout of Graphs with Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:553-579 [Journal]
  51. David R. Wood
    Optimal three-dimensional orthogonal graph drawing in the general position model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:151-178 [Journal]
  52. David R. Wood
    Vertex partitions of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:2, pp:167-172 [Journal]
  53. Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
    Simultaneous diagonal flips in plane triangulations. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:4, pp:307-330 [Journal]
  54. Attila Pór, David R. Wood
    No-Three-in-Line-in-3D. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:481-488 [Journal]
  55. Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood
    Drawings of planar graphs with few slopes and segments. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:3, pp:194-212 [Journal]
  56. Vida Dujmovic, Matthew Suderman, David R. Wood
    Graph drawings with few slopes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:3, pp:181-193 [Journal]
  57. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  58. Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer
    A Characterization of the Degree Sequences of 2-Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  59. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood
    A polynomial bound for untangling geometric planar graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  60. Vida Dujmovic, David R. Wood
    Graph Treewidth and Geometric Thickness Parameters. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:4, pp:641-670 [Journal]
  61. Vida Dujmovic, Attila Pór, David R. Wood
    Track Layouts of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:497-522 [Journal]
  62. Vida Dujmovic, David R. Wood
    On Linear Layouts of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:339-358 [Journal]
  63. Vida Dujmovic, David R. Wood
    Stacks, Queues and Tracks: Layouts of Graph Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:155-202 [Journal]
  64. David R. Wood
    Acyclic, Star and Oriented Colourings of Graph Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:37-50 [Journal]
  65. David R. Wood
    Queue Layouts of Graph Products and Powers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:255-268 [Journal]

  66. Every Large Point Set contains Many Collinear Points or an Empty Pentagon. [Citation Graph (, )][DBLP]


  67. Improved upper bounds on the crossing number. [Citation Graph (, )][DBLP]


  68. On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]


  69. Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. [Citation Graph (, )][DBLP]


  70. Drawing a Graph in a Hypercube. [Citation Graph (, )][DBLP]


  71. Compatible geometric matchings. [Citation Graph (, )][DBLP]


  72. The distance geometry of music. [Citation Graph (, )][DBLP]


  73. A Simple Proof of the F{á}ry-Wagner Theorem [Citation Graph (, )][DBLP]


  74. Simultaneous Diagonal Flips in Plane Triangulations [Citation Graph (, )][DBLP]


  75. Proximity Drawings of High-Degree Trees [Citation Graph (, )][DBLP]


  76. Partitions and Coverings of Trees by Bounded-Degree Subtrees [Citation Graph (, )][DBLP]


  77. A Polynomial Bound for Untangling Geometric Planar Graphs. [Citation Graph (, )][DBLP]


  78. Independent Sets in Graphs with an Excluded Clique Minor. [Citation Graph (, )][DBLP]


  79. On the Complexity of the Balanced Vertex Ordering Problem. [Citation Graph (, )][DBLP]


  80. Bounded-Degree Graphs have Arbitrarily Large Queue-Number. [Citation Graph (, )][DBLP]


  81. On tree-partition-width. [Citation Graph (, )][DBLP]


  82. Contractibility and the Hadwiger Conjecture. [Citation Graph (, )][DBLP]


Search in 0.138secs, Finished in 0.140secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002