Quick Links

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

Tim Dwyer, Kim Marriott and 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 and Eli-Bocek Rivele

Eigensolver Methods for Progressive Multidimensional Scaling of Large Data

Ulrik Brandes and Christian Pich

10:40 - 11:10 Coffee Break

11:10 - 12:40 Session B

Chair: Stephen Kobourov

Angle and Distance Constraints on Tree Drawings

Ulrik Brandes and Barbara Schlieper

Schematisation of Tree Drawings

Joachim Gudmundsson, Marc van Kreveld and Damian Merrick

Trees with Convex Faces and Optimal Angles

Josiah Carlson and David Eppstein

Three Dimensional Drawings of Bounded Degree Trees

Fabrizio Frati and Giuseppe Di Battista

12:40 - 14:00 Lunch

14:00 Invited Talk

The Number of Crossing-Free Configurations on Planar Point Sets

Emo Welzl (ETH Zürich)

15:00 - 15:40 Session C

Chair: Michael Kaufmann

Simultaneous Graph Embedding with Bends and Circular Arcs

Justin Cappos, Alejandro Estrella-Balderrama, Joe Fowler and Stephen Kobourov

Embedding Graphs Simultaneously with Fixed Edges

Fabrizio Frati

15:40 - 16:10 Coffee Break

16:10 - 17:25 Session D

Chair: Yehuda Koren

Drawing cubic graphs with at most five slopes

Balázs Keszegh, János Pach, Dömötör Pálvölgyi and Géza Tóth

Planarity Testing and Optimal Edge Insertion with Embedding Constraints

Carsten Gutwenger, Karsten Klein and Petra Mutzel

Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs

Kazuyuki Miura, Tetsuya Matsuno and Takao Nishizeki

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

David Wood and Jan Arne Telle

On the Crossing Number of Almost Planar Graphs

Petr Hlineny and Gelasio Salazar

On the Decay of Crossing Numbers

Jacob Fox and Csaba Toth

How Important is the "Mental Map"? -- an Empirical Investigation of a Dynamic Graph Layout Algorithm

Helen C. Purchase, Eve Hoggan and Carsten Goerg

10:40 - 11:10 Coffee Break

11:10 - 12:40 Session F

Chair: Takao Nishizeki

Computing Geometric Minimum-Dilation Graphs is NP-Hard

Rolf Klein and Martin Kutz

Chordal Graphs as Intersection Graphs of Pseudosegments

Cornelia Dangelmayr and Stefan Felsner

Parameterized st-Orientations of Graphs: Algorithms and Experiments

Charalampos Papamanthou and Ioannis G. Tollis

Straight-line drawing of quadrangulations

Eric Fusy

12:40 - 14:00 Lunch

14:00 Invited Talk

The Algorithmic Beauty of Virtual Nature

Oliver Deussen (Universität Konstanz)

15:00 - 15:40 Session G

Chair: Dorothea Wagner

Visualizing Large and Clustered Networks

Katharina Anna Lehmann and Stephan Kottler

Partitioned Drawings

Martin Siebenhaller

15:40 - 16:10 Coffee Break

16:10 - 17:50 Session H

Chair: Walter Didimo

Path Simplification for Metro Map Layout

Damian Merrick and Joachim Gudmundsson

Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps

Marc Benkert, Martin Nöllenburg, Takeaki Uno and Alexander Wolff

Upright-Quad Drawing of st-Planar Learning Spaces

David Eppstein

Choosing Colors for Geometric Graphs via Color Space Embeddings

Michael B. Dillencourt, David Eppstein and Michael T. Goodrich

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

Stephen Kobourov and Matthew Landis

k-chromatic point-set embeddability of outerplanar graphs

Stephen Wismath, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer and Francesco Trotta

Thickness of Bar 1-Visibility Graphs

Mareike Massow and Stefan Felsner

A New Approximation Algorithm for Bend Minimization in the Kandinsky Model

Canan Yildiz, Petra Mutzel and Wilhelm Barth

10:40 - 11:10 Coffee Break

11:10 - 12:40 Session J

Chair: Bettina Speckmann

Radial Drawings of Graphs: Geometric Constraints and Trade-offs

Emilio Di Giacomo, Walter Didimo and Giuseppe Liotta

Characterization of Unlabeled Level Planar (ULP) Trees

Alejandro Estrella-Balderrama, Joe Fowler and Stephen Kobourov

Drawing Bipartite Graphs on Two Curves

Emilio Di Giacomo, Luca Grilli and Giuseppe Liotta

Improved circular layouts

Emden R. Gansner and Yehuda Koren

12:40 - 14:00 Lunch

14:00 - 15:30 Session K

Chair: David Wood

Controllable and Progressive Edge Clustering for Large Networks

Huamin Qu, Hong Zhou and Yingcai Wu

Biclique Edge Cover Graphs and Confluent Drawings

Michael Hirsch, Henk Meijer and David Rappaport

Schnyder Woods and Orthogonal Surfaces

Stefan Felsner and Florian Zickfeld

Partitions of Graphs into Trees

Therese Biedl and Franz J. Brandenburg

16:30 - 18:00 Visit to the ZKM