- COMBINATORICA Bolyai Society Springer-Verlag
- Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
- Vertex Partitions of Chordal Graphs
- Multi-dimensional Orthogonal Graph Drawing with Small Boxes
- On vertex-magic and edge-magic total injections of graphs
- Three-Dimensional 1-Bend Graph Drawings Pat Morin David R. Wood
- The University of Melbourne Department of Mathematics and Statistics
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 171176 Independent Sets in Graphs
- Discrete Mathematics and Theoretical Computer Science 7, 2005, 37--50 Acyclic, Star and Oriented Colourings of
- Three-Dimensional Orthogonal Engineering
- Re nement of Three-Dimensional Orthogonal Graph Drawings
- DOI: 10.1007/s00454-007-1318-7 Discrete Comput Geom 37:641670 (2007) Discrete & Computational
- Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing
- Fault-Tolerant Metric Dimension of Graphs Carmen Hernando (a)
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. 7, 2005, 255268 Queue Layouts of Graph Products and
- Operations Research Letters 21 (1997) 211--217 An algorithm for #nding a maximum clique in a graph
- Volume 2, Number 2, Pages 145152 ISSN 1715-0868
- Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. 10:1, 2008, 2734 Bounded-Degree Graphs have
- Available online at www.sciencedirect.com Discrete Mathematics 282 (2004) 3541
- arXiv:0802.2467v2[math.CO]25Feb2008 FOLDING = COLOURING
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. 7, 2005, 155--202 Stacks, Queues and Tracks
- Computational Geometry 30 (2005) 2528 www.elsevier.com/locate/comgeo
- ON THE MAXIMUM NUMBER OF CLIQUES IN A GRAPH EMBEDDED IN A SURFACE
- Drawing a Graph in a Hypercube David R. Wood
- Discrete Mathematics and Theoretical Computer Science 6, 2004, 339--358 On Linear Layouts of Graphs +
- COMPLETE GRAPH MINORS AND THE GRAPH MINOR STRUCTURE THEOREM
- Computational Geometry 34 (2006) 116125 www.elsevier.com/locate/comgeo
- Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing
- On Pseudo Vertex-Magic and Edge-Magic Total-Labellings
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics
- ARTICLE IN PRESS COMGEO:989 Please cite this article in press as: O. Aichholzer et al., Compatible geometric matchings, Computational Geometry (2009),
- Simultaneous Diagonal Flips in Plane
- Discrete Comput Geom (2009) 42: 570585 DOI 10.1007/s00454-008-9125-3
- Cost-Optimal Quadtrees for Ray Shooting Herv e Bronnimann y Marc Glisse y David R. Wood z
- Three-Dimensional Orthogonal Graph Drawing
- Three-Dimensional Orthogonal Graph Drawing
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. 7, 2005, 255--268 Queue Layouts of Graph Products and
- Geometric Thickness in a Grid of Linear Area ?
- Three-Dimensional Orthogonal Engineering
- BLOCKING COLOURED POINT SETS GREG ALOUPIS, BRAD BALLINGER, SEBASTIEN COLLETTE, STEFAN LANGERMAN, ATTILA POR,
- Drawing a Graph in a Hypercube David R. Wood
- Multidimensional Orthogonal Graph Drawing with Small Boxes
- ARTICLE IN PRESS European Journal of Combinatorics ( )
- 6. Orthogonal Graph Drawing Markus Eiglsperger, Sandor P. Fekete, and Gunnar W. Klau
- Graph Minors and Minimum Degree Gasper Fijavz
- Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
- Simultaneous Diagonal Flips in Plane Triangulations Prosenjit Bose
- http://www.elsevier.com/locate/jctb Journal of Combinatorial Theory, Series B 90 (2004) 309313
- Theoretical Computer Science (2003) www.el/xI,,/ll,/l,,/,
- Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 8, no. 1, pp. 2126 (2004)
- DOI: 10.1007/s00453-004-1091-4 Algorithmica (2004) 39: 235253
- The University of Melbourne Department of Mathematics and Statistics
- Computational Geometry 42 (2009) 429454 Contents lists available at ScienceDirect
- A Linear-Time Algorithm to Find a Separator in a Graph Excluding a Minor
- The Academic Family Tree of John M. Hammersley (19202004)
- arXiv:submit/0260182[math.CO]5Jun2011 TREEWIDTH OF CARTESIAN PRODUCTS
- ROOTED K4-MINORS RUY FABILA-MONROY AND DAVID R. WOOD
- PARTITIONS AND COVERINGS OF TREES BY BOUNDED-DEGREE SUBTREES
- arXiv:submit/0091298[math.CO]13Aug2010 COLOURING THE SQUARE OF THE
- SMALL MINORS IN DENSE GRAPHS SAMUEL FIORINI, GWENAEL JORET, DIRK OLIVER THEIS, AND DAVID R. WOOD
- arXiv:0711.1189v3[math.CO]9Dec2009 CLIQUE MINORS IN CARTESIAN PRODUCTS OF GRAPHS
- arXiv:0809.0724v3[math.CO]17Sep2008 POLYNOMIAL TREEWIDTH FORCES
- Journal of Computational Geometry jocg.org ON VISIBILITY AND BLOCKERS
- Journal of Combinatorial Theory, Series B 100 (2010) 446455 Contents lists available at ScienceDirect
- Extremal Graph Theory for Metric Dimension and Diameter
- The Minor Crossing Number of Graphs with an Excluded Minor
- Computational Geometry 38 (2007) 181193 www.elsevier.com/locate/comgeo
- Computational Geometry 38 (2007) 194212 www.elsevier.com/locate/comgeo
- New York Journal of Mathematics New York J. Math. 13 (2007) 117146.
- Order (2006) 23: 120 DOI 10.1007/s11083-006-9028-y
- DOI: 10.1007/s00453-005-1181-y Algorithmica (2006) 45: 159182
- DOI: 10.1007/s00453-005-1148-z Algorithmica (2006) 44: 233255
- Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. 7, 2005, 155202 Stacks, Queues and Tracks
- Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 8, no. 3, pp. 357366 (2004)
- A NOTE ON COLOURING THE PLANE GRID
- J. Parallel Distrib. Comput. 64 (2004) 591605 Dimension-exchange algorithms for token distribution
- Discrete Mathematics 273 (2003) 221234 www.elsevier.com/locate/disc
- Operations Research Letters 21 (1997) 211217 An algorithm for nding a maximum clique in a graph
- Partitions of Complete Geometric Graphs into Plane Trees
- No-Three-in-Line-in-3D Attila Por1
- Really Straight Graph Drawings Vida Dujmovic1,2
- Orthogonal Drawings with Few Layers Therese Biedl1,
- An Algorithm for Three-Dimensional Orthogonal Graph Drawing
- The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
- Length 2 and 3 paths from Paul Erdos
- The University of Melbourne Department of Mathematics and Statistics
- The University of Melbourne Department of Mathematics and Statistics
- Discrete Mathematics and Theoretical Computer Science 7, 2005, 3750 Acyclic, Star and Oriented Colourings of
- ARTICLE IN PRESS European Journal of Combinatorics ( )
- Journal of Algorithms 45 (2002) 144154 www.academicpress.com
- Digital Object Identifier (DOI) 10.1007/s00373-007-0738-8 Graphs and Combinatorics (2007) 23:116
- On the Complexity of the Balanced Vertex Ordering Problem
- Theoretical Computer Science 299 (2003) 151178 www.elsevier.com/locate/tcs
- Three-Dimensional Orthogonal Graph Drawing
- Three-Dimensional Orthogonal Graph Drawing
- An Algorithm for ThreeDimensional Orthogonal Graph Drawing
- Volume 1, Number 1, Pages 88105 ISSN 1715-0868
- DOI: 10.1007/s00453-006-0158-9 Algorithmica (2007) 47: 481488
- The University of Sydney Basser Department of Computer Science
- DimensionExchange Algorithms for Load Balancing on Trees
- of Algorithms (2002) 144--154 www.academicpress.com Degree constrained book embeddings
- SIAM J. DISCRETE MATH. c 2007 Society for Industrial and Applied Mathematics Vol. 21, No. 2, pp. 423441
- A SIMPLE PROOF OF THE FARY-WAGNER THEOREM DAVID R. WOOD
- A Polynomial Bound for Untangling Geometric Planar Graphs
- Queue Layouts, TreeWidth, and ThreeDimensional Graph Drawing
- arXiv:0910.4774v1[math.CO]25Oct2009 Token Graphs
- A SIMPLE PROOF OF THE F ARYWAGNER THEOREM
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- DOI: 10.1007/s00454-005-1177-z Discrete Comput Geom 34:497506 (2005) Discrete & Computational
- arXiv:0812.1064v1[math.CO]5Dec2008 GRAPH MINORS AND MINIMUM DEGREE
- The University of Melbourne Department of Mathematics and Statistics
- arXiv:submit/0226589[math.CO]7Apr2011 ON THE NUMBER OF MAXIMAL
- Induced Subgraphs of Bounded Degree and Bounded Treewidth
- The Importance of the P versus NP Question STEPHEN COOK
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES FERRAN HURTADO, GIUSEPPE LIOTTA, AND DAVID R. WOOD
- ThreeDimensional Orthogonal Graph Drawing with Optimal Volume #
- A Minimum Spanning Tree Algorithm with Inverse-Ackermann Type Complexity
- ON THE CONNECTIVITY OF VISIBILITY GRAPHS MICHAEL S. PAYNE, ATTILA POR, PAVEL VALTR, AND DAVID R. WOOD
- arXiv:1107.1073v1[math.NT]6Jul2011 On Multiplicative Sidon Sets
- NORDHAUS-GADDUM FOR TREEWIDTH GWENAEL JORET AND DAVID R. WOOD
- European Journal of Combinatorics 32 (2011) 12441252 Contents lists available at ScienceDirect
- arXiv:1108.2949v1[math.CO]15Aug2011 Cliques in Odd-Minor-Free Graphs
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. 13:2, 2011, 109112 Colouring the Square of the
- arXiv:submit/0335290[math.CO]11Oct2011 Disproof of the List Hadwiger Conjecture
- AN IMPROVED BOUND FOR FIRST-FIT ON POSETS WITHOUT TWO LONG INCOMPARABLE CHAINS
- arXiv:1109.3508v1[math.CO]15Sep2011 DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS
- arXiv:1109.3218v1[math.CO]14Sep2011 Colouring the Triangles Determined by a Point Set
- European Journal of Combinatorics ( ) Contents lists available at SciVerse ScienceDirect
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. 13:3, 2011, 3944 On the Book Thickness of k-Trees
- New York Journal of Mathematics New York J. Math. 17 (2011) 627682.
- Nonrepetitive Colourings of Planar Graphs with O(log n) Colours
- arXiv:1202.2624v1[math.CO]13Feb2012 A linear-time algorithm for finding a complete
- European Journal of Combinatorics 33 (2012) 488490 Contents lists available at SciVerse ScienceDirect
- arXiv:submit/0386426[math.CO]23Dec2011 Nonrepetitive Colouring via Entropy Compression
- Proximity graphs: E, , , and Prosenjit Bose
