GD 2005:
Limerick, Ireland
Patrick Healy, Nikola S. Nikolov (Eds.):
Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers.
Lecture Notes in Computer Science 3843 Springer 2006, ISBN 3-540-31425-3 
Papers
- Therese C. Biedl, Franz-Josef Brandenburg, Xiaotie Deng:
Crossings and Permutations.
1-12
- Therese C. Biedl, Anna Lubiw, Michael J. Spriggs:
Morphing Planar Graphs While Preserving Edge Directions.
13-24
- Ulrik Brandes, Daniel Fleischer, Thomas Puppe:
Dynamic Spectral Layout of Small Worlds.
25-36
- Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
Exact Crossing Minimization.
37-48
- Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
On Embedding a Cycle in a Plane Graph.
49-60
- Mark de Berg, Elena Mumford, Bettina Speckmann:
On Rectilinear Duals for Vertex-Weighted Plane Graphs.
61-72
- Alice M. Dean, William Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter:
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness.
73-82
- Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath:
Drawing Kn in Three Dimensions with One Bend Per Edge.
83-88
- Giuseppe Di Battista, Fabrizio Frati:
Small Area Drawings of Outerplanar Graphs.
89-100
- Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Volume Requirements of 3D Upward Drawings.
101-110
- Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
How to Embed a Path onto Two Sets of Points.
111-116
- Walter Didimo, Francesco Giordano, Giuseppe Liotta:
Upward Spirality and Upward Planarity Testing.
117-128
- Vida Dujmovic, David R. Wood:
Graph Treewidth and Geometric Thickness Parameters.
129-140
- Tim Dwyer, Yehuda Koren, Kim Marriott:
Stress Majorization with Orthogonal Ordering Constraints.
141-152
- Tim Dwyer, Kim Marriott, Peter J. Stuckey:
Fast Node Overlap Removal.
153-164
- David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Delta-Confluent Drawings.
165-176
- Éric Fusy:
Transversal Structures on Triangulations, with Application to Straight-Line Drawing.
177-188
- Marco Gaertler, Dorothea Wagner:
A Hybrid Model for Drawing Dynamic and Evolving Graphs.
189-200
- Markus Geyer, Michael Kaufmann, Imrich Vrto:
Two Trees Which Are Self-intersecting When Drawn Simultaneously.
201-210
- Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun:
C-Planarity of Extrovert Clustered Graphs.
211-222
- Carsten Gutwenger, Markus Chimani:
Non-planar Core Reduction of Graphs.
223-234
- Stefan Hachul, Michael Jünger:
An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs.
235-250
- Seok-Hee Hong, Nikola S. Nikolov:
Hierarchical Layouts of Directed Graphs in Three Dimensions.
251-261
- Weidong Huang, Seok-Hee Hong, Peter Eades:
Layout Effects on Sociogram Perception.
262-273
- Jan Kyncl, Pavel Valtr:
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs.
274-284
- Chun-Cheng Lin, Hsu-Chun Yen:
On Balloon Drawings of Rooted Trees.
285-296
- Kazuyuki Miura, Machiko Azuma, Takao Nishizeki:
Convex Drawings of Plane Graphs of Minimum Outer Apices.
297-308
- Andreas Noack:
Energy-Based Clustering of Graphs with Nonuniform Degrees.
309-320
- Martin Nöllenburg, Alexander Wolff:
A Mixed-Integer Program for Drawing High-Quality Metro Maps.
321-333
- János Pach, Géza Tóth:
Crossing Number of Toroidal Graphs.
334-342
- Charis Papadopoulos, Constantinos Voglis:
Drawing Graphs Using Modular Decomposition.
343-354
- Charalampos Papamanthou, Ioannis G. Tollis:
Applications of Parameterized st-Orientations in Graph Drawing Algorithms.
355-367
- Maurizio Patrignani:
Complexity Results for Three-Dimensional Orthogonal Graph Drawing.
368-379
- Maurizio Patrignani:
On Extending a Partial Straight-Line Drawing.
380-385
- Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Odd Crossing Number Is Not Crossing Number.
386-396
- Maurizio Pizzonia:
Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis.
397-408
- Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki:
No-bend Orthogonal Drawings of Series-Parallel Graphs.
409-420
- Ileana Streinu:
Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs.
421-433
- Matthew Suderman:
Proper and Planar Drawings of Graphs on Three Layers.
434-445
- Michael Wybrow, Kim Marriott, Peter J. Stuckey:
Incremental Connector Routing.
446-457
- Huaming Zhang, Xin He:
An Application of Well-Orderly Trees in Graph Drawing.
458-467
Software Demonstrations
- Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu, Joshua Wing Kei Ho, Seok-Hee Hong, Dirk Koschützki, Colin Murray, Nikola S. Nikolov, Ronnie Taib, Alexandre Tarassov, Kai Xu:
GEOMI: GEOmetry for Maximum Insight.
468-479
- Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta:
WhatsOnWeb: Using Graph Drawing to Search the Web.
480-491
- Joshua Wing Kei Ho, Seok-Hee Hong:
Drawing Clustered Graphs in Three Dimensions.
492-502
Posters
- Michael A. Bekos, Antonios Symvonis:
BLer: A Boundary Labeller for Technical Drawings.
503-504
- Mustafa Bilgic, Louis Licamele, Lise Getoor, Ben Shneiderman:
D-Dupe: An Interactive Tool for Entity Resolution in Social Networks.
505-507
- John M. Boyer:
A New Method for Efficiently Generating Planar Graph Visibility Representations.
508-511
- Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele:
SDE: Graph Drawing Using Spectral Distance Embedding.
512-513
- Seok-Hee Hong:
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions.
514-515
- Bongshin Lee, Cynthia Sims Parr, Catherine Plaisant, Benjamin B. Bederson:
Visualizing Graphs as Trees: Plant a Seed and Watch it Grow.
516-518
- Sheung-Hung Poon:
On Straightening Low-Diameter Unit Trees.
519-521
- Martin Siebenhaller, Michael Kaufmann:
Mixed Upward Planarization - Fast and Robust.
522-523
Workshop on Network Analysis and Visualisation
Graph Drawing Contest
Invited Talks
Last update Sat May 18 18:32:35 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
