GD 2006: Karlsruhe, Germany

Invited Talks

• Emo Welzl:
  The Number of Triangulations on Planar Point Sets. 1-4
  
• Oliver Deussen:
  The Algorithmic Beauty of Digital Nature. 5-7
  

Papers

• Tim Dwyer, Kim Marriott, Michael Wybrow:
  Integrating Edge Routing into Force-Directed Layout. 8-19
  
• Ulrich Lauther:
  Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree. 20-29
  
• Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele:
  SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding. 30-41
  
• Ulrik Brandes, Christian Pich:
  Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. 42-53
  
• Ulrik Brandes, Barbara Schlieper:
  Angle and Distance Constraints on Tree Drawings. 54-65
  
• Joachim Gudmundsson, Marc J. van Kreveld, Damian Merrick:
  Schematisation of Tree Drawings. 66-76
  
• Josiah Carlson, David Eppstein:
  Trees with Convex Faces and Optimal Angles. 77-88
  
• Fabrizio Frati, Giuseppe Di Battista:
  Three-Dimensional Drawings of Bounded Degree Trees. 89-94
  
• Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
  Simultaneous Graph Embedding with Bends and Circular Arcs. 95-107
  
• Fabrizio Frati:
  Embedding Graphs Simultaneously with Fixed Edges. 108-113
  
• Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
  Drawing Cubic Graphs with at Most Five Slopes. 114-125
  
• Carsten Gutwenger, Karsten Klein, Petra Mutzel:
  Planarity Testing and Optimal Edge Insertion with Embedding Constraints. 126-137
  
• Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki:
  Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. 138-149
  
• David R. Wood, Jan Arne Telle:
  Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. 150-161
  
• Petr Hlinený, Gelasio Salazar:
  On the Crossing Number of Almost Planar Graphs. 162-173
  
• Jacob Fox, Csaba D. Tóth:
  On the Decay of Crossing Numbers. 174-183
  
• Helen C. Purchase, Eve E. Hoggan, Carsten Görg:
  How Important Is the "Mental Map"? - An Empirical Investigation of a Dynamic Graph Layout Algorithm. 184-195
  
• Rolf Klein, Martin Kutz:
  Computing Geometric Minimum-Dilation Graphs Is NP-Hard. 196-207
  
• Cornelia Dangelmayr, Stefan Felsner:
  Chordal Graphs as Intersection Graphs of Pseudosegments. 208-219
  
• Charalampos Papamanthou, Ioannis G. Tollis:
  Parameterized st -Orientations of Graphs: Algorithms and Experiments. 220-233
  
• Éric Fusy:
  Straight-Line Drawing of Quadrangulations. 234-239
  
• Katharina Anna Lehmann, Stephan Kottler:
  Visualizing Large and Clustered Networks. 240-251
  
• Martin Siebenhaller:
  Partitioned Drawings. 252-257
  
• Damian Merrick, Joachim Gudmundsson:
  Path Simplification for Metro Map Layout. 258-269
  
• Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff:
  Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. 270-281
  
• David Eppstein:
  Upright-Quad Drawing of st -Planar Learning Spaces. 282-293
  
• Michael B. Dillencourt, David Eppstein, Michael T. Goodrich:
  Choosing Colors for Geometric Graphs Via Color Space Embeddings. 294-305
  
• Stephen G. Kobourov, Matthew Landis:
  Morphing Planar Graphs in Spherical Space. 306-317
  
• Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath:
  k -Colored Point-Set Embeddability of Outerplanar Graphs. 318-329
  
• Stefan Felsner, Mareike Massow:
  Thickness of Bar 1-Visibility Graphs. 330-342
  
• Wilhelm Barth, Petra Mutzel, Canan Yildiz:
  A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. 343-354
  
• Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
  Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. 355-366
  
• Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
  Characterization of Unlabeled Level Planar Trees. 367-379
  
• Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta:
  Drawing Bipartite Graphs on Two Curves. 380-385
  
• Emden R. Gansner, Yehuda Koren:
  Improved Circular Layouts. 386-398
  
• Huamin Qu, Hong Zhou, Yingcai Wu:
  Controllable and Progressive Edge Clustering for Large Networks. 399-404
  
• Michael Hirsch, Henk Meijer, David Rappaport:
  Biclique Edge Cover Graphs and Confluent Drawings. 405-416
  
• Stefan Felsner, Florian Zickfeld:
  Schnyder Woods and Orthogonal Surfaces. 417-429
  
• Therese C. Biedl, Franz-Josef Brandenburg:
  Partitions of Graphs into Trees. 430-439
  

Posters

• Bruno Pinaud, Pascale Kuntz, Fabien Picarougne:
  The Website for Graph Visualization Software References (GVSR). 440-441
  
• Christopher Homan, Andrew Pavlo, Jonathan Schull:
  Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings. 442-445
  

Correction

• Tim Dwyer, Kim Marriott, Peter J. Stuckey:
  Fast Node Overlap Removal - Correction. 446-447
  

Graph Drawing Contest

• Christian A. Duncan, Gunnar W. Klau, Stephen G. Kobourov, Georg Sander:
  Graph-Drawing Contest Report. 448-452