| Invited Talks | |
| The Number of Triangulations on Planar Point Sets | p. 1 |
| The Algorithmic Beauty of Digital Nature | p. 5 |
| Papers | |
| Integrating Edge Routing into Force-Directed Layout | p. 8 |
| Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree | p. 20 |
| SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding | p. 30 |
| Eigensolver Methods for Progressive Multidimensional Scaling of Large Data | p. 42 |
| Angle and Distance Constraints on Tree Drawings | p. 54 |
| Schematisation of Tree Drawings | p. 66 |
| Trees with Convex Faces and Optimal Angles | p. 77 |
| Three-Dimensional Drawings of Bounded Degree Trees | p. 89 |
| Simultaneous Graph Embedding with Bends and Circular Arcs | p. 95 |
| Embedding Graphs Simultaneously with Fixed Edges | p. 108 |
| Drawing Cubic Graphs with at Most Five Slopes | p. 114 |
| Planarity Testing and Optimal Edge Insertion with Embedding Constraints | p. 126 |
| Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs | p. 138 |
| Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor | p. 150 |
| On the Crossing Number of Almost Planar Graphs | p. 162 |
| On the Decay of Crossing Numbers | p. 174 |
| How Important Is the "Mental Map"? - An Empirical Investigation of a Dynamic Graph Layout Algorithm | p. 184 |
| Computing Geometric Minimum-Dilation Graphs Is NP-Hard | p. 196 |
| Chordal Graphs as Intersection Graphs of Pseudosegments | p. 208 |
| Parameterized st-Orientations of Graphs: Algorithms and Experiments | p. 220 |
| Straight-Line Drawing of Quadrangulations | p. 234 |
| Visualizing Large and Clustered Networks | p. 240 |
| Partitioned Drawings | p. 252 |
| Path Simplification for Metro Map Layout | p. 258 |
| Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps | p. 270 |
| Upright-Quad Drawing of st-Planar Learning Spaces | p. 282 |
| Choosing Colors for Geometric Graphs Via Color Space Embeddings | p. 294 |
| Morphing Planar Graphs in Spherical Space | p. 306 |
| k-Colored Point-Set Embeddability of Outerplanar Graphs | p. 318 |
| Thickness of Bar 1-Visibility Graphs | p. 330 |
| A New Approximation Algorithm for Bend Minimization in the Kandinsky Model | p. 343 |
| Radial Drawings of Graphs: Geometric Constraints and Trade-Offs | p. 355 |
| Characterization of Unlabeled Level Planar Trees | p. 367 |
| Drawing Bipartite Graphs on Two Curves | p. 380 |
| Improved Circular Layouts | p. 386 |
| Controllable and Progressive Edge Clustering for Large Networks | p. 399 |
| Biclique Edge Cover Graphs and Confluent Drawings | p. 405 |
| Schnyder Woods and Orthogonal Surfaces | p. 417 |
| Partitions of Graphs into Trees | p. 430 |
| Posters | |
| The Website for Graph Visualization Software References (GVSR) | p. 440 |
| Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings | p. 442 |
| Corrections | |
| Fast Node Overlap Removal-Correction | p. 446 |
| Graph Drawing Contest | |
| Graph-Drawing Contest Report | p. 448 |
| Author Index | p. 453 |
| Table of Contents provided by Ingram. All Rights Reserved. |