Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers

Front Matter....Pages I-XIV
Networks in Biology – From Identification, Analysis to Interpretation....Pages 1-1
Graph Drawing for Security Visualization....Pages 2-13
Succinct Greedy Graph Drawing in the Hyperbolic Plane....Pages 14-25
An Algorithm to Construct Greedy Drawings of Triangulations....Pages 26-37
Crossing and Weighted Crossing Number of Near-Planar Graphs....Pages 38-49
Cubic Graphs Have Bounded Slope Parameter....Pages 50-60
Unimaximal Sequences of Pairs in Rectangle Visibility Drawing....Pages 61-66
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights....Pages 67-77
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing....Pages 78-89
Rapid Multipole Graph Drawing on the GPU....Pages 90-101
Clustered Planarity: Clusters with Few Outgoing Edges....Pages 102-113
Computing Maximum C-Planar Subgraphs....Pages 114-120
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters....Pages 121-132
Visual Analysis of One-to-Many Matched Graphs....Pages 133-144
Topological Morphing of Planar Graphs....Pages 145-156
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges....Pages 157-168
Graph Simultaneous Embedding Tool, GraphSET....Pages 169-180
Hamiltonian Alternating Paths on Bicolored Double-Chains....Pages 181-192
The Binary Stress Model for Graph Drawing....Pages 193-205
Efficient Node Overlap Removal Using a Proximity Stress Model....Pages 206-217
An Experimental Study on Distance-Based Graph Drawing....Pages 218-229
Topology Preserving Constrained Graph Layout....Pages 230-241
Embeddability Problems for Upward Planar Digraphs....Pages 242-253
A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs....Pages 254-265
On the Hardness of Orthogonal-Order Preserving Graph Drawing....Pages 266-277
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints....Pages 278-283
Placing Text Boxes on Graphs....Pages 284-295
Removing Node Overlaps Using Multi-sphere Scheme....Pages 296-301
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing....Pages 302-312
Connected Rectilinear Graphs on Point Sets....Pages 313-318
3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces....Pages 319-323
Drawing (Complete) Binary Tanglegrams....Pages 324-335
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem....Pages 336-347
Cyclic Leveling of Directed Graphs....Pages 348-359
Constrained Point-Set Embeddability of Planar Graphs....Pages 360-371
Tree Drawings on the Hexagonal Grid....Pages 372-383
Isometric Diamond Subgraphs....Pages 384-389
Non-convex Representations of Graphs....Pages 390-395
Subdivision Drawings of Hypergraphs....Pages 396-407
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three....Pages 408-419
Dunnart: A Constraint-Based Network Diagram Authoring Tool....Pages 420-431
Approximating the Crossing Number of Apex Graphs....Pages 432-434
Policy-Aware Visualization of Internet Dynamics....Pages 435-436
Enhancing Visualizations of Business Processes....Pages 437-438
A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs....Pages 439-440
Visualizing the Results of Metabolic Pathway Queries....Pages 441-442
Visual Specification of Layout....Pages 443-444
Spine Crossing Minimization in Upward Topological Book Embeddings....Pages 445-446
ILOG Elixir....Pages 447-448
DAGmap View....Pages 449-450
Brain Network Analyzer....Pages 451-452
Graph Drawing Contest Report....Pages 453-458
Back Matter....Pages -