What is included with this book?
Invited Talks | |
Computing Symmetries of Combinatorial Objects (Abstract) | p. 1 |
Large-Scale Graphics: Digital Nature and Laser Projection (Abstract) | p. 2 |
Papers | |
Crossing Number of Graphs with Rotation Systems | p. 3 |
A Bipartite Strengthening of the Crossing Lemma | p. 13 |
Improvement on the Decay of Crossing Numbers | p. 25 |
Crossing Numbers and Parameterized Complexity | p. 31 |
Characterization of Unlabeled Level Planar Graphs | p. 37 |
Cyclic Level Planarity Testing and Embedding (Extended Abstract) | p. 50 |
Practical Level Planarity Testing and Layout with Embedding Constraints | p. 62 |
Minimum Level Nonplanar Patterns for Trees | p. 69 |
Straight-Line Orthogonal Drawings of Binary and Ternary Trees | p. 76 |
Polynomial Area Bounds for MST Embeddings of Trees | p. 88 |
Moving Vertices to Make Drawings Plane | p. 101 |
Point-Set Embedding of Trees with Edge Constraints (Extended Abstract) | p. 113 |
Representation of Planar Hypergraphs by Contacts of Triangles | p. 125 |
The Complexity of Several Realizability Problems for Abstract Topological Graphs (Extended Abstract) | p. 137 |
Efficient Extraction of Multiple Kuratowski Subdivisions | p. 159 |
Cover Contact Graphs | p. 171 |
Matched Drawings of Planar Graphs | p. 183 |
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs | p. 195 |
Minimizing the Area for Planar Straight-Line Grid Drawings | p. 207 |
On Planar Polyline Drawings | p. 213 |
Constrained Stress Majorization Using Diagonally Scaled Gradient Projection | p. 219 |
Line Crossing Minimization on Metro Maps | p. 231 |
Algorithms for Multi-criteria One-Sided Boundary Labeling | p. 243 |
Multi-circular Layout of Micro/Macro Graphs | p. 255 |
Constrained Simultaneous and Near-Simultaneous Embeddings | p. 268 |
Simultaneous Geometric Graph Embeddings | p. 280 |
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces | p. 291 |
Clustered Planarity: Small Clusters in Eulerian Graphs | p. 303 |
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge | p. 315 |
Colorability in Orthogonal Graph Drawing | p. 327 |
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs | p. 339 |
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices | p. 345 |
Lunar Vis - Analytic Visualizations of Large Graphs | p. 352 |
Visualizing Internet Evolution on the Autonomous Systems Level | p. 365 |
Treemaps for Directed Acyclic Graphs | p. 377 |
Drawing Graphs with GLEE | p. 389 |
Graph Drawing Contest | |
Graph Drawing Contest Report | p. 395 |
Author Index | p. 401 |
Table of Contents provided by Blackwell. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.