The 13th International Symposium on Graph Drawing (GD 2005) was held in Limerick, Ireland, September 12-14, 2005. One hundred and ?fteen participants from 19 countries attended GD 2005. In response to the call for papers the Program Committee received 101 subm- sions, each detailing original research or a system demonstration. Each submission was reviewed by at least three Program Committee members; each referee’s c- ments were returned to the authors. Following extensive discussions, the comm- tee accepted 38 long papers, 3 short papers and 3 long system demos, each of which were presented during one of the conference’s 12 sessions. Eight posters were also accepted and were on display throughout the conference. Two invited speakers, Kurt Mehlhorn and George Robertson, gave fascinating talks during the conference. Prof. Mehlhorn spoke on the use of minimum cycle bases for reconstructing surfaces, while Dr. Robertson gave a perspective, past and present, on the visualization of hierarchies. As is now traditional, a graph drawing contest was held during the conference. The accompanying report, written by Stephen Kobourov, details this year’s c- test. This year a day-long workshop, organized by Seok-Hee Hong and Dorothea Wagner, was held in conjunction with the conference. A report on the “Workshop on Network Analysis and Visualization,” written by Seok-Hee Hong, is included in the proceedings.
Author(s): Therese Biedl, Franz J. Brandenburg, Xiaotie Deng (auth.), Patrick Healy, Nikola S. Nikolov (eds.)
Series: Lecture Notes in Computer Science 3843 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006
Language: English
Pages: 536
Tags: Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Computer Graphics; Data Structures
Front Matter....Pages -
Crossings and Permutations....Pages 1-12
Morphing Planar Graphs While Preserving Edge Directions....Pages 13-24
Dynamic Spectral Layout of Small Worlds....Pages 25-36
Exact Crossing Minimization....Pages 37-48
On Embedding a Cycle in a Plane Graph....Pages 49-60
On Rectilinear Duals for Vertex-Weighted Plane Graphs....Pages 61-72
Bar k -Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness....Pages 73-82
Drawing K n in Three Dimensions with One Bend Per Edge....Pages 83-88
Small Area Drawings of Outerplanar Graphs....Pages 89-100
Volume Requirements of 3D Upward Drawings....Pages 101-110
How to Embed a Path onto Two Sets of Points....Pages 111-116
Upward Spirality and Upward Planarity Testing....Pages 117-128
Graph Treewidth and Geometric Thickness Parameters....Pages 129-140
Stress Majorization with Orthogonal Ordering Constraints....Pages 141-152
Fast Node Overlap Removal....Pages 153-164
Delta-Confluent Drawings....Pages 165-176
Transversal Structures on Triangulations, with Application to Straight-Line Drawing....Pages 177-188
A Hybrid Model for Drawing Dynamic and Evolving Graphs....Pages 189-200
Two Trees Which Are Self–intersecting When Drawn Simultaneously....Pages 201-210
C-Planarity of Extrovert Clustered Graphs....Pages 211-222
Non-planar Core Reduction of Graphs....Pages 223-234
An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs....Pages 235-250
Hierarchical Layouts of Directed Graphs in Three Dimensions....Pages 251-261
Layout Effects on Sociogram Perception....Pages 262-273
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs....Pages 274-284
On Balloon Drawings of Rooted Trees....Pages 285-296
Convex Drawings of Plane Graphs of Minimum Outer Apices....Pages 297-308
Energy-Based Clustering of Graphs with Nonuniform Degrees....Pages 309-320
A Mixed-Integer Program for Drawing High-Quality Metro Maps....Pages 321-333
Crossing Number of Toroidal Graphs....Pages 334-342
Drawing Graphs Using Modular Decomposition....Pages 343-354
Applications of Parameterized st -Orientations in Graph Drawing Algorithms....Pages 355-367
Complexity Results for Three-Dimensional Orthogonal Graph Drawing....Pages 368-379
On Extending a Partial Straight-Line Drawing....Pages 380-385
Odd Crossing Number Is Not Crossing Number....Pages 386-396
Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis....Pages 397-408
No-bend Orthogonal Drawings of Series-Parallel Graphs....Pages 409-420
Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs....Pages 421-433
Proper and Planar Drawings of Graphs on Three Layers....Pages 434-445
Incremental Connector Routing....Pages 446-457
An Application of Well-Orderly Trees in Graph Drawing....Pages 458-467
GEOMI: GEOmetry for Maximum Insight....Pages 468-479
WhatsOnWeb : Using Graph Drawing to Search the Web....Pages 480-491
Drawing Clustered Graphs in Three Dimensions....Pages 492-502
BLer: A B oundary L abell er for Technical Drawings....Pages 503-504
D-Dupe: An Interactive Tool for Entity Resolution in Social Networks....Pages 505-507
A New Method for Efficiently Generating Planar Graph Visibility Representations....Pages 508-511
SDE: Graph Drawing Using Spectral Distance Embedding....Pages 512-513
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions....Pages 514-515
Visualizing Graphs as Trees: Plant a Seed and Watch it Grow....Pages 516-518
On Straightening Low-Diameter Unit Trees....Pages 519-521
Mixed Upward Planarization – Fast and Robust....Pages 522-523
Network Analysis and Visualisation....Pages 524-527
Graph-Drawing Contest Report....Pages 528-531
Minimum Cycle Bases and Surface Reconstruction....Pages 532-532
Hierarchy Visualization: From Research to Practice....Pages 533-533
Back Matter....Pages -
