Graph Drawing and Network Visualization: 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers

Front Matter....Pages I-XX
Front Matter....Pages 1-1
A Distributed Multilevel Force-Directed Algorithm....Pages 3-17
A Sparse Stress Model....Pages 18-32
Node Overlap Removal by Growing a Tree....Pages 33-43
Placing Arrows in Directed Graph Drawings....Pages 44-51
Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-Off....Pages 52-64
Front Matter....Pages 65-65
Twins in Subdivision Drawings of Hypergraphs....Pages 67-80
Multi-colored Spanning Graphs....Pages 81-93
C-Planarity of Embedded Cyclic c-Graphs....Pages 94-106
Computing NodeTrix Representations of Clustered Graphs....Pages 107-120
Front Matter....Pages 121-121
1-Bend Upward Planar Drawings of SP-Digraphs....Pages 123-130
Non-aligned Drawings of Planar Graphs....Pages 131-143
Snapping Graph Drawings to the Grid Optimally....Pages 144-151
Drawing Planar Graphs with Many Collinear Vertices....Pages 152-165
Drawing Graphs on Few Lines and Few Planes....Pages 166-180
Front Matter....Pages 181-181
Algorithms for Visualizing Phylogenetic Networks....Pages 183-195
A Generalization of the Directed Graph Layering Problem....Pages 196-208
Compact Layered Drawings of General Directed Graphs....Pages 209-221
Bitonic st-orderings for Upward Planar Graphs....Pages 222-235
Low Ply Drawings of Trees....Pages 236-248
Front Matter....Pages 249-249
Visibility Representations of Boxes in 2.5 Dimensions....Pages 251-265
Front Matter....Pages 249-249
The Partial Visibility Representation Extension Problem....Pages 266-279
Ortho-Polygon Visibility Representations of Embedded Graphs....Pages 280-294
Obstructing Visibilities with One Obstacle....Pages 295-308
Front Matter....Pages 309-309
On the Size of Planarly Connected Crossing Graphs....Pages 311-320
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time....Pages 321-334
1-Bend RAC Drawings of 1-Planar Graphs....Pages 335-343
On the Density of Non-simple 3-Planar Graphs....Pages 344-356
A Note on the Practicality of Maximal Planar Subgraph Algorithms....Pages 357-364
Front Matter....Pages 365-365
Crossing Minimization in Storyline Visualization....Pages 367-381
Block Crossings in Storyline Visualizations....Pages 382-398
The Bundled Crossing Number....Pages 399-412
Approximating the Rectilinear Crossing Number....Pages 413-426
The Crossing Number of the Cone of a Graph....Pages 427-438
Front Matter....Pages 439-439
Topological Drawings of Complete Bipartite Graphs....Pages 441-453
A Direct Proof of the Strong Hanani–Tutte Theorem on the Projective Plane....Pages 454-467
Hanani-Tutte for Radial Planarity II....Pages 468-481
Beyond Level Planarity....Pages 482-495
Front Matter....Pages 497-497
Track Layout Is Hard....Pages 499-510
Stack and Queue Layouts via Layered Separators....Pages 511-518
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition....Pages 519-531
Front Matter....Pages 497-497
Simultaneous Orthogonal Planarity....Pages 532-545
Monotone Simultaneous Embeddings of Paths in d Dimensions....Pages 546-553
Front Matter....Pages 555-555
Evaluation of Two Interaction Techniques for Visualization of Dynamic Graphs....Pages 557-571
Offline Drawing of Dynamic Trees: Algorithmics and Document Integration....Pages 572-586
Front Matter....Pages 587-587
Graph Drawing Contest Report....Pages 589-595
Back Matter....Pages 597-642