Graph Drawing: 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers

Front Matter....Pages -
Planar Induced Subgraphs of Sparse Graphs....Pages 1-12
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph....Pages 13-24
Drawing Partially Embedded and Simultaneously Planar Graphs....Pages 25-39
Drawing Simultaneously Embedded Graphs with Few Bends....Pages 40-51
Planar and Quasi Planar Simultaneous Geometric Embedding....Pages 52-63
Simultaneous Embeddability of Two Partitions....Pages 64-75
Luatodonotes: Boundary Labeling for Annotations in Texts....Pages 76-88
A Coloring Algorithm for Disambiguating Graph and Map Drawings....Pages 89-100
Untangling Hairballs....Pages 101-112
GION: Interactively Untangling Large Graphs on Wall-Sized Displays....Pages 113-124
Balanced Circle Packings for Planar Graphs....Pages 125-136
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D....Pages 137-148
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings....Pages 149-161
Bitonic st -orderings of Biconnected Planar Graphs....Pages 162-173
Drawing Outer 1-planar Graphs with Few Slopes....Pages 174-185
Fan-Planar Graphs: Combinatorial Properties and Complexity Results....Pages 186-197
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs....Pages 198-209
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth....Pages 210-221
A Crossing Lemma for the Pair-Crossing Number....Pages 222-233
Are Crossings Important for Drawing Large Graphs?....Pages 234-245
The Importance of Being Proper....Pages 246-258
Column Planarity and Partial Simultaneous Geometric Embedding....Pages 259-271
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths....Pages 272-283
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture....Pages 284-293
Morphing Schnyder Drawings of Planar Triangulations....Pages 294-305
Trade-Offs in Planar Polyline Drawings....Pages 306-318
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports....Pages 319-330
Planar Octilinear Drawings with One Bend Per Edge....Pages 331-342
On the Complexity of HV-rectilinear Planarity Testing....Pages 343-354
Embedding Four-Directional Paths on Convex Point Sets....Pages 355-366
Drawing Graphs within Restricted Area....Pages 367-379
Height-Preserving Transformations of Planar Graph Drawings....Pages 380-391
Drawing Planar Graphs with Reduced Height....Pages 392-403
Anchored Drawings of Planar Graphs....Pages 404-415
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs....Pages 416-427
Clustered Planarity Testing Revisited....Pages 428-439
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem....Pages 440-451
MapSets: Visualizing Embedded and Clustered Graphs....Pages 452-463
Increasing-Chord Graphs On Point Sets....Pages 464-475
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs....Pages 476-487
On Monotone Drawings of Trees....Pages 488-500
Graph Drawing Contest Report....Pages 501-506
Back Matter....Pages -