Abstract is missing.
- The Number of Triangulations on Planar Point SetsEmo Welzl. 1-4 [doi]
- The Algorithmic Beauty of Digital NatureOliver Deussen. 5-7 [doi]
- Integrating Edge Routing into Force-Directed LayoutTim Dwyer, Kim Marriott, Michael Wybrow. 8-19 [doi]
- Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-TreeUlrich Lauther. 20-29 [doi]
- SSDE: Fast Graph Drawing Using Sampled Spectral Distance EmbeddingAli Civril, Malik Magdon-Ismail, Eli Bocek-Rivele. 30-41 [doi]
- Eigensolver Methods for Progressive Multidimensional Scaling of Large DataUlrik Brandes, Christian Pich. 42-53 [doi]
- Angle and Distance Constraints on Tree DrawingsUlrik Brandes, Barbara Schlieper. 54-65 [doi]
- Schematisation of Tree DrawingsJoachim Gudmundsson, Marc J. van Kreveld, Damian Merrick. 66-76 [doi]
- Trees with Convex Faces and Optimal AnglesJosiah Carlson, David Eppstein. 77-88 [doi]
- Three-Dimensional Drawings of Bounded Degree TreesFabrizio Frati, Giuseppe Di Battista. 89-94 [doi]
- Simultaneous Graph Embedding with Bends and Circular ArcsJustin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov. 95-107 [doi]
- Embedding Graphs Simultaneously with Fixed EdgesFabrizio Frati. 108-113 [doi]
- Drawing Cubic Graphs with at Most Five SlopesBalázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth. 114-125 [doi]
- Planarity Testing and Optimal Edge Insertion with Embedding ConstraintsCarsten Gutwenger, Karsten Klein, Petra Mutzel. 126-137 [doi]
- Open Rectangle-of-Influence Drawings of Inner Triangulated Plane GraphsKazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki. 138-149 [doi]
- Planar Decompositions and the Crossing Number of Graphs with an Excluded MinorDavid R. Wood, Jan Arne Telle. 150-161 [doi]
- On the Crossing Number of Almost Planar GraphsPetr Hlinený, Gelasio Salazar. 162-173 [doi]
- On the Decay of Crossing NumbersJacob Fox, Csaba D. Tóth. 174-183 [doi]
- How Important Is the Mental Map ? - An Empirical Investigation of a Dynamic Graph Layout AlgorithmHelen C. Purchase, Eve E. Hoggan, Carsten Görg. 184-195 [doi]
- Computing Geometric Minimum-Dilation Graphs Is NP-HardRolf Klein, Martin Kutz. 196-207 [doi]
- Chordal Graphs as Intersection Graphs of PseudosegmentsCornelia Dangelmayr, Stefan Felsner. 208-219 [doi]
- Parameterized ::::st:::: -Orientations of Graphs: Algorithms and ExperimentsCharalampos Papamanthou, Ioannis G. Tollis. 220-233 [doi]
- Straight-Line Drawing of QuadrangulationsÉric Fusy. 234-239 [doi]
- Visualizing Large and Clustered NetworksKatharina Anna Lehmann, Stephan Kottler. 240-251 [doi]
- Partitioned DrawingsMartin Siebenhaller. 252-257 [doi]
- Path Simplification for Metro Map LayoutDamian Merrick, Joachim Gudmundsson. 258-269 [doi]
- Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation MapsMarc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff. 270-281 [doi]
- Upright-Quad Drawing of ::::st:::: -Planar Learning SpacesDavid Eppstein. 282-293 [doi]
- Choosing Colors for Geometric Graphs Via Color Space EmbeddingsMichael B. Dillencourt, David Eppstein, Michael T. Goodrich. 294-305 [doi]
- Morphing Planar Graphs in Spherical SpaceStephen G. Kobourov, Matthew Landis. 306-317 [doi]
- ::::k:::: -Colored Point-Set Embeddability of Outerplanar GraphsEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath. 318-329 [doi]
- Thickness of Bar 1-Visibility GraphsStefan Felsner, Mareike Massow. 330-342 [doi]
- A New Approximation Algorithm for Bend Minimization in the Kandinsky ModelWilhelm Barth, Petra Mutzel, Canan Yildiz. 343-354 [doi]
- Radial Drawings of Graphs: Geometric Constraints and Trade-OffsEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta. 355-366 [doi]
- Characterization of Unlabeled Level Planar TreesAlejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov. 367-379 [doi]
- Drawing Bipartite Graphs on Two CurvesEmilio Di Giacomo, Luca Grilli, Giuseppe Liotta. 380-385 [doi]
- Improved Circular LayoutsEmden R. Gansner, Yehuda Koren. 386-398 [doi]
- Controllable and Progressive Edge Clustering for Large NetworksHuamin Qu, Hong Zhou, Yingcai Wu. 399-404 [doi]
- Biclique Edge Cover Graphs and Confluent DrawingsMichael Hirsch, Henk Meijer, David Rappaport. 405-416 [doi]
- Schnyder Woods and Orthogonal SurfacesStefan Felsner, Florian Zickfeld. 417-429 [doi]
- Partitions of Graphs into TreesTherese C. Biedl, Franz-Josef Brandenburg. 430-439 [doi]
- The Website for Graph Visualization Software References (GVSR)Bruno Pinaud, Pascale Kuntz, Fabien Picarougne. 440-441 [doi]
- Smoother Transitions Between Breadth-First-Spanning-Tree-Based DrawingsChristopher Homan, Andrew Pavlo, Jonathan Schull. 442-445 [doi]
- Fast Node Overlap Removal - CorrectionTim Dwyer, Kim Marriott, Peter J. Stuckey. 446-447 [doi]
- Graph-Drawing Contest ReportChristian A. Duncan, Gunnar W. Klau, Stephen G. Kobourov, Georg Sander. 448-452 [doi]