2008 | ||
---|---|---|
79 | EE | Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood: Improved upper bounds on the crossing number. Symposium on Computational Geometry 2008: 375-384 |
78 | EE | 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) |
77 | EE | Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, 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) |
76 | EE | 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) |
75 | EE | Gasper Fijavz, David R. Wood: Minimum Degree and Graph Minors. Electronic Notes in Discrete Mathematics 31: 79-83 (2008) |
74 | EE | 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) |
2007 | ||
73 | EE | Attila Pór, David R. Wood: No-Three-in-Line-in-3D. Algorithmica 47(4): 481-488 (2007) |
72 | EE | 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) |
71 | EE | 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) |
70 | EE | Vida Dujmovic, Matthew Suderman, David R. Wood: Graph drawings with few slopes. Comput. Geom. 38(3): 181-193 (2007) |
69 | EE | 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) |
68 | EE | Vida Dujmovic, David R. Wood: Graph Treewidth and Geometric Thickness Parameters. Discrete & Computational Geometry 37(4): 641-670 (2007) |
67 | EE | 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) |
66 | EE | 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) |
65 | EE | 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) |
64 | EE | 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) |
2006 | ||
63 | EE | David R. Wood, Jan Arne Telle: Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. Graph Drawing 2006: 150-161 |
62 | EE | Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood: Simultaneous diagonal flips in plane triangulations. SODA 2006: 212-221 |
61 | EE | Therese C. Biedl, Torsten Thiele, David R. Wood: Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Algorithmica 44(3): 233-255 (2006) |
60 | EE | 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) |
59 | EE | 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) |
58 | EE | 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) |
57 | EE | János Barát, Jirí Matousek, David R. Wood: Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. Electr. J. Comb. 13(1): (2006) |
56 | EE | David R. Wood: Drawing a Graph in a Hypercube. Electr. J. Comb. 13(1): (2006) |
55 | EE | David R. Wood: Vertex partitions of chordal graphs. Journal of Graph Theory 53(2): 167-172 (2006) |
54 | EE | Vida Dujmovic, David R. Wood: Upward Three-Dimensional Grid Drawings of Graphs. Order 23(1): 1-20 (2006) |
2005 | ||
53 | EE | 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 |
52 | EE | Jan Kára, Jan Kratochvíl, David R. Wood: On the Complexity of the Balanced Vertex Ordering Problem. COCOON 2005: 849-858 |
51 | EE | Vida Dujmovic, David R. Wood: Graph Treewidth and Geometric Thickness Parameters. Graph Drawing 2005: 129-140 |
50 | EE | Prosenjit Bose, Vida Dujmovic, David R. Wood: Induced Subgraphs of Bounded Degree and Bounded Treewidth. WG 2005: 175-186 |
49 | EE | David R. Wood: A Simple Proof of the F{á}ry-Wagner Theorem CoRR abs/cs/0505047: (2005) |
48 | EE | Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood: Simultaneous Diagonal Flips in Plane Triangulations CoRR abs/math/0509478: (2005) |
47 | EE | David R. Wood: Grid drawings of k-colourable graphs. Comput. Geom. 30(1): 25-28 (2005) |
46 | EE | 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) |
45 | EE | 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) |
44 | EE | Vida Dujmovic, David R. Wood: Stacks, Queues and Tracks: Layouts of Graph Subdivisions. Discrete Mathematics & Theoretical Computer Science 7(1): 155-202 (2005) |
43 | EE | David R. Wood: Queue Layouts of Graph Products and Powers. Discrete Mathematics & Theoretical Computer Science 7(1): 255-268 (2005) |
42 | EE | David R. Wood: Acyclic, Star and Oriented Colourings of Graph Subdivisions. Discrete Mathematics & Theoretical Computer Science 7(1): 37-50 (2005) |
41 | EE | Vida Dujmovic, Pat Morin, David R. Wood: Layout of Graphs with Bounded Tree-Width. SIAM J. Comput. 34(3): 553-579 (2005) |
2004 | ||
40 | EE | Pat Morin, David R. Wood: Three-dimensional 1-bend graph drawings. CCCG 2004: 40-43 |
39 | EE | Vida Dujmovic, Matthew Suderman, David R. Wood: Really Straight Graph Drawings. Graph Drawing 2004: 122-132 |
38 | EE | Vida Dujmovic, David R. Wood: Layouts of Graph Subdivisions. Graph Drawing 2004: 133-143 |
37 | EE | Attila Pór, David R. Wood: No-Three-in-Line-in-3D. Graph Drawing 2004: 395-402 |
36 | EE | Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood: Partitions of Complete Geometric Graphs into Plane Trees. Graph Drawing 2004: 71-81 |
35 | EE | 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) |
34 | EE | David R. Wood: Characterisations of Intersection Graphs by Vertex Orderings CoRR cs.DM/0404031: (2004) |
33 | EE | Vida Dujmovic, Pat Morin, David R. Wood: Layout of Graphs with Bounded Tree-Width CoRR cs.DM/0406024: (2004) |
32 | EE | Vida Dujmovic, Attila Pór, David R. Wood: Track Layouts of Graphs CoRR cs.DM/0407033: (2004) |
31 | EE | Prosenjit Bose, Michiel H. M. Smid, David R. Wood: Light edges in degree-constrained graphs. Discrete Mathematics 282(1-3): 35-41 (2004) |
30 | EE | Vida Dujmovic, David R. Wood: On Linear Layouts of Graphs. Discrete Mathematics & Theoretical Computer Science 6(2): 339-358 (2004) |
29 | EE | Vida Dujmovic, Attila Pór, David R. Wood: Track Layouts of Graphs. Discrete Mathematics & Theoretical Computer Science 6(2): 497-522 (2004) |
28 | EE | David R. Wood: Bounded degree acyclic decompositions of digraphs. J. Comb. Theory, Ser. B 90(2): 309-313 (2004) |
27 | EE | 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) |
26 | EE | Pat Morin, David R. Wood: Three-Dimensional 1-Bend Graph Drawings. J. Graph Algorithms Appl. 8(2): 357-366 (2004) |
25 | EE | 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) |
2003 | ||
24 | EE | Vida Dujmovic, David R. Wood: Three-Dimensional Grid Drawings with Sub-quadratic Volume. Graph Drawing 2003: 190-201 |
23 | EE | Vida Dujmovic, David R. Wood: Tree-Partitions of k-Trees with Applications in Graph Layout. WG 2003: 205-217 |
22 | EE | David R. Wood: Geometric thickness in a grid. Discrete Mathematics 273(1-3): 221-234 (2003) |
21 | EE | 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) |
20 | EE | David R. Wood: Optimal three-dimensional orthogonal graph drawing in the general position model. Theor. Comput. Sci. 1-3(299): 151-178 (2003) |
2002 | ||
19 | EE | Hervé Brönnimann, Marc Glisse, David R. Wood: Cost-optimal quadtrees for ray shooting. CCCG 2002: 109-112 |
18 | EE | Prosenjit Bose, Michiel H. M. Smid, David R. Wood: Light edges in degree-constrained graphs. CCCG 2002: 142-145 |
17 | EE | David R. Wood: Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. FSTTCS 2002: 348-359 |
16 | EE | Vida Dujmovic, Pat Morin, David R. Wood: Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. Graph Drawing 2002: 42-53 |
15 | Michael E. Houle, Antonios Symvonis, David R. Wood: Dimension-Exchange Algorithms for Load Balancing on Trees. SIROCCO 2002: 181-196 | |
14 | EE | 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) |
13 | EE | David R. Wood: Degree constrained book embeddings. J. Algorithms 45(2): 144-154 (2002) |
2001 | ||
12 | EE | 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 |
11 | EE | 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 |
10 | EE | Therese C. Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood: Orthogonal Drawings with Few Layers. Graph Drawing 2001: 297-311 |
9 | EE | David R. Wood: Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing. Graph Drawing 2001: 312-327 |
8 | EE | David R. Wood: Geometric Thickness in a Grid of Linear Area. Electronic Notes in Discrete Mathematics 10: 291-296 (2001) |
2000 | ||
7 | EE | David R. Wood: Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. Graph Drawing 2000: 259-271 |
6 | EE | Therese C. Biedl, Torsten Thiele, David R. Wood: Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Graph Drawing 2000: 284-295 |
5 | EE | Benjamin Yin-Sun Lynn, Antonios Symvonis, David R. Wood: Refinement of Three-Dimensional Orthogonal Graph Drawings. Graph Drawing 2000: 308-320 |
4 | Alan Roberts, Antonios Symvonis, David R. Wood: Lower bounds for hot-potato permutation routing on trees. SIROCCO 2000: 281-295 | |
1999 | ||
3 | EE | David R. Wood: Multi-dimensional Orthogonal Graph Drawing with Small Boxes. Graph Drawing 1999: 311-322 |
1998 | ||
2 | EE | David R. Wood: An Algorithm for Three-Dimensional Orthogonal Graph Drawing. Graph Drawing 1998: 332-346 |
1997 | ||
1 | EE | David R. Wood: An algorithm for finding a maximum clique in a graph. Oper. Res. Lett. 21(5): 211-217 (1997) |