GD 2006:
Karlsruhe,
Germany
Michael Kaufmann, Dorothea Wagner (Eds.):
Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers.
Lecture Notes in Computer Science 4372 Springer 2007, ISBN 978-3-540-70903-9 BibTeX
Invited Talks
Papers
- Tim Dwyer, Kim Marriott, Michael Wybrow:
Integrating Edge Routing into Force-Directed Layout.
8-19
Electronic Edition (link) BibTeX
- Ulrich Lauther:
Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree.
20-29
Electronic Edition (link) BibTeX
- Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele:
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding.
30-41
Electronic Edition (link) BibTeX
- Ulrik Brandes, Christian Pich:
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data.
42-53
Electronic Edition (link) BibTeX
- Ulrik Brandes, Barbara Schlieper:
Angle and Distance Constraints on Tree Drawings.
54-65
Electronic Edition (link) BibTeX
- Joachim Gudmundsson, Marc J. van Kreveld, Damian Merrick:
Schematisation of Tree Drawings.
66-76
Electronic Edition (link) BibTeX
- Josiah Carlson, David Eppstein:
Trees with Convex Faces and Optimal Angles.
77-88
Electronic Edition (link) BibTeX
- Fabrizio Frati, Giuseppe Di Battista:
Three-Dimensional Drawings of Bounded Degree Trees.
89-94
Electronic Edition (link) BibTeX
- Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
Simultaneous Graph Embedding with Bends and Circular Arcs.
95-107
Electronic Edition (link) BibTeX
- Fabrizio Frati:
Embedding Graphs Simultaneously with Fixed Edges.
108-113
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Carsten Gutwenger, Karsten Klein, Petra Mutzel:
Planarity Testing and Optimal Edge Insertion with Embedding Constraints.
126-137
Electronic Edition (link) BibTeX
- Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki:
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs.
138-149
Electronic Edition (link) BibTeX
- David R. Wood, Jan Arne Telle:
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor.
150-161
Electronic Edition (link) BibTeX
- Petr Hlinený, Gelasio Salazar:
On the Crossing Number of Almost Planar Graphs.
162-173
Electronic Edition (link) BibTeX
- Jacob Fox, Csaba D. Tóth:
On the Decay of Crossing Numbers.
174-183
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Rolf Klein, Martin Kutz:
Computing Geometric Minimum-Dilation Graphs Is NP-Hard.
196-207
Electronic Edition (link) BibTeX
- Cornelia Dangelmayr, Stefan Felsner:
Chordal Graphs as Intersection Graphs of Pseudosegments.
208-219
Electronic Edition (link) BibTeX
- Charalampos Papamanthou, Ioannis G. Tollis:
Parameterized st -Orientations of Graphs: Algorithms and Experiments.
220-233
Electronic Edition (link) BibTeX
- Éric Fusy:
Straight-Line Drawing of Quadrangulations.
234-239
Electronic Edition (link) BibTeX
- Katharina Anna Lehmann, Stephan Kottler:
Visualizing Large and Clustered Networks.
240-251
Electronic Edition (link) BibTeX
- Martin Siebenhaller:
Partitioned Drawings.
252-257
Electronic Edition (link) BibTeX
- Damian Merrick, Joachim Gudmundsson:
Path Simplification for Metro Map Layout.
258-269
Electronic Edition (link) BibTeX
- Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff:
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps.
270-281
Electronic Edition (link) BibTeX
- David Eppstein:
Upright-Quad Drawing of st -Planar Learning Spaces.
282-293
Electronic Edition (link) BibTeX
- Michael B. Dillencourt, David Eppstein, Michael T. Goodrich:
Choosing Colors for Geometric Graphs Via Color Space Embeddings.
294-305
Electronic Edition (link) BibTeX
- Stephen G. Kobourov, Matthew Landis:
Morphing Planar Graphs in Spherical Space.
306-317
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath:
k -Colored Point-Set Embeddability of Outerplanar Graphs.
318-329
Electronic Edition (link) BibTeX
- Stefan Felsner, Mareike Massow:
Thickness of Bar 1-Visibility Graphs.
330-342
Electronic Edition (link) BibTeX
- Wilhelm Barth, Petra Mutzel, Canan Yildiz:
A New Approximation Algorithm for Bend Minimization in the Kandinsky Model.
343-354
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Radial Drawings of Graphs: Geometric Constraints and Trade-Offs.
355-366
Electronic Edition (link) BibTeX
- Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
Characterization of Unlabeled Level Planar Trees.
367-379
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta:
Drawing Bipartite Graphs on Two Curves.
380-385
Electronic Edition (link) BibTeX
- Emden R. Gansner, Yehuda Koren:
Improved Circular Layouts.
386-398
Electronic Edition (link) BibTeX
- Huamin Qu, Hong Zhou, Yingcai Wu:
Controllable and Progressive Edge Clustering for Large Networks.
399-404
Electronic Edition (link) BibTeX
- Michael Hirsch, Henk Meijer, David Rappaport:
Biclique Edge Cover Graphs and Confluent Drawings.
405-416
Electronic Edition (link) BibTeX
- Stefan Felsner, Florian Zickfeld:
Schnyder Woods and Orthogonal Surfaces.
417-429
Electronic Edition (link) BibTeX
- Therese C. Biedl, Franz-Josef Brandenburg:
Partitions of Graphs into Trees.
430-439
Electronic Edition (link) BibTeX
Posters
Correction
Graph Drawing Contest
Copyright © Sat May 16 23:13:15 2009
by Michael Ley (ley@uni-trier.de)
