Invited Talks |
The Number of Triangulations on Planar Point Sets / Emo Welzl |
The Algorithmic Beauty of Digital Nature / Oliver Deussen |
Papers |
Integrating Edge Routing into Force-Directed Layout / Tim Dwyer ; Kim Marriott ; Michael Wybrow |
Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree / Ulrich Lauther |
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding / Ali Civril ; Malik Magdon-Ismail ; Eli Bocek-Rivele |
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data / Ulrik Brandes ; Christian Pich |
Angle and Distance Constraints on Tree Drawings / Barbara Schlieper |
Schematisation of Tree Drawings / Joachim Gudmundsson ; Marc van Kreveld ; Damian Merrick |
Trees with Convex Faces and Optimal Angles / Josiah Carlson ; David Eppstein |
Three-Dimensional Drawings of Bounded Degree Trees / Fabrizio Frati ; Giuseppe Di Battista |
Simultaneous Graph Embedding with Bends and Circular Arcs / Justin Cappos ; Alejandro Estrella-Balderrama ; J. Joseph Fowler ; Stephen G. Kobourov |
Embedding Graphs Simultaneously with Fixed Edges |
Drawing Cubic Graphs with at Most Five Slopes / Balazs Keszegh ; Janos Pach ; Domotor Palvolgyi ; Geza Toth |
Planarity Testing and Optimal Edge Insertion with Embedding Constraints / Carsten Gutwenger ; Karsten Klein ; Petra Mutzel |
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs / Kazuyuki Miura ; Tetsuya Matsuno ; Takao Nishizeki |
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor / David R. Wood ; Jan Arne Telle |
On the Crossing Number of Almost Planar Graphs / Petr Hlineny ; Gelasio Salazar |
On the Decay of Crossing Numbers / Jacob Fox ; Csaba D. Toth |
How Important Is the "Mental Map"? - An Empirical Investigation of a Dynamic Graph Layout Algorithm / Helen C. Purchase ; Eve Hoggan ; Carsten Gorg |
Computing Geometric Minimum-Dilation Graphs Is NP-Hard / Rolf Klein ; Martin Kutz |
Chordal Graphs as Intersection Graphs of Pseudosegments / Cornelia Dangelmayr ; Stefan Felsner |
Parameterized st-Orientations of Graphs: Algorithms and Experiments / Charalampos Papamanthou ; Ioannis G. Tollis |
Straight-Line Drawing of Quadrangulations / Eric Fusy |
Visualizing Large and Clustered Networks / Katharina A. Lehmann ; Stephan Kottler |
Partitioned Drawings / Martin Siebenhaller |
Path Simplification for Metro Map Layout |
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps / Marc Benkert ; Martin Nollenburg ; Takeaki Uno ; Alexander Wolff |
Upright-Quad Drawing of st-Planar Learning Spaces |
Choosing Colors for Geometric Graphs Via Color Space Embeddings / Michael B. Dillencourt ; Michael T. Goodrich |
Morphing Planar Graphs in Spherical Space / Matthew Landis |
k-Colored Point-Set Embeddability of Outerplanar Graphs / Emilio Di Giacomo ; Walter Didimo ; Giuseppe Liotta ; Henk Meijer ; Francesco Trotta ; Stephen K. Wismath |
Thickness of Bar 1-Visibility Graphs / Mareike Massow |
A New Approximation Algorithm for Bend Minimization in the Kandinsky Model / Wilhelm Barth ; Canan Yildiz |
Radial Drawings of Graphs: Geometric Constraints and Trade-Offs |
Characterization of Unlabeled Level Planar Trees |
Drawing Bipartite Graphs on Two Curves / Luca Grilli |
Improved Circular Layouts / Emden R. Gansner ; Yehuda Koren |
Controllable and Progressive Edge Clustering for Large Networks / Huamin Qu ; Hong Zhou ; Yingcai Wu |
Biclique Edge Cover Graphs and Confluent Drawings / Michael Hirsch ; David Rappaport |
Schnyder Woods and Orthogonal Surfaces / Florian Zickfeld |
Partitions of Graphs into Trees / Therese Biedl ; Franz J. Brandenburg |
Posters |
The Website for Graph Visualization Software References (GVSR) / Bruno Pinaud ; Pascale Kuntz ; Fabien Picarougne |
Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings / Christopher Homan ; Andrew Pavlo ; Jonathan Schull |
Corrections |
Fast Node Overlap Removal-Correction / Peter J. Stuckey |
Graph Drawing Contest |
Graph-Drawing Contest Report / Christian A. Duncan ; Gunnar Klau ; Georg Sander| |
Author Index |
Invited Talks |
The Number of Triangulations on Planar Point Sets / Emo Welzl |
The Algorithmic Beauty of Digital Nature / Oliver Deussen |
Papers |
Integrating Edge Routing into Force-Directed Layout / Tim Dwyer ; Kim Marriott ; Michael Wybrow |
Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree / Ulrich Lauther |