Quick Links
- Monday, September 18
- Tuesday, September 19
- Wednesday, September 20
- Program Brochure
- Book of Abstracts
Sunday, September 17, 2006
19:00 - 21:00 Welcome Reception and Registration
Monday, September 18, 2006
8:30 - 9:00 Opening
9:00 - 10:40 Session A
Chair: David Eppstein
Integrating Edge Routing into Force-Directed Layout
Multipole-Based Force Approximation Revisited - a Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
10:40 - 11:10 Coffee Break
11:10 - 12:40 Session B
Chair: Stephen Kobourov
Angle and Distance Constraints on Tree Drawings
Schematisation of Tree Drawings
Trees with Convex Faces and Optimal Angles
Three Dimensional Drawings of Bounded Degree Trees
12:40 - 14:00 Lunch
14:00 Invited Talk
The Number of Crossing-Free Configurations on Planar Point Sets
15:00 - 15:40 Session C
Chair: Michael Kaufmann
Simultaneous Graph Embedding with Bends and Circular Arcs
Embedding Graphs Simultaneously with Fixed Edges
15:40 - 16:10 Coffee Break
16:10 - 17:25 Session D
Chair: Yehuda Koren
Drawing cubic graphs with at most five slopes
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
17:30 - 19:00 Software Demos and Posters
18:00 – 19:00 Graph Drawing Contest
Tuesday, September 19, 2006
9:00 - 10:40 Session E
Chair: Vida Dujmovic
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
On the Crossing Number of Almost Planar Graphs
On the Decay of Crossing Numbers
How Important is the "Mental Map"? -- an Empirical Investigation of a Dynamic Graph Layout Algorithm
10:40 - 11:10 Coffee Break
11:10 - 12:40 Session F
Chair: Takao Nishizeki
Computing Geometric Minimum-Dilation Graphs is NP-Hard
Chordal Graphs as Intersection Graphs of Pseudosegments
Parameterized st-Orientations of Graphs: Algorithms and Experiments
Straight-line drawing of quadrangulations
12:40 - 14:00 Lunch
14:00 Invited Talk
The Algorithmic Beauty of Virtual Nature
15:00 - 15:40 Session G
Chair: Dorothea Wagner
Visualizing Large and Clustered Networks
Partitioned Drawings
15:40 - 16:10 Coffee Break
16:10 - 17:50 Session H
Chair: Walter Didimo
Path Simplification for Metro Map Layout
Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps
Upright-Quad Drawing of st-Planar Learning Spaces
Choosing Colors for Geometric Graphs via Color Space Embeddings
19:00 Conference Dinner in Karlsruhe Palace
Wednesday, September 20, 2006
9:00 - 10:40 Session I
Chair: Alexander Wolff
Morphing Planar Graphs in Spherical Space
k-chromatic point-set embeddability of outerplanar graphs
Thickness of Bar 1-Visibility Graphs
A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
10:40 - 11:10 Coffee Break
11:10 - 12:40 Session J
Chair: Bettina Speckmann
Radial Drawings of Graphs: Geometric Constraints and Trade-offs
Characterization of Unlabeled Level Planar (ULP) Trees
Drawing Bipartite Graphs on Two Curves
Improved circular layouts
12:40 - 14:00 Lunch
14:00 - 15:30 Session K
Chair: David Wood
Controllable and Progressive Edge Clustering for Large Networks
Biclique Edge Cover Graphs and Confluent Drawings
Schnyder Woods and Orthogonal Surfaces
Partitions of Graphs into Trees