Graph Drawing
15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers
Published on 28. January 2008
Book
Paperback/Softback
XIII, 401 pages
978-3-540-77536-2 (ISBN)
Description
This comprehensive new Springer publication constitutes the thoroughly refereed post-conference proceedings of the 15th International Symposium on Graph Drawing, GD 2007, held in Sydney, Australia, in September of 2007. The 27 full papers and 9 short papers presented together with 2 invited talks, and a report on the symposium's graph drawing contest were carefully selected from 74 initial submissions. All of the current hot topics in graph drawing are addressed here.
More details
Series
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XIII, 401 p.
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
646 gr
ISBN-13
978-3-540-77536-2 (9783540775362)
DOI
10.1007/978-3-540-77537-9
Schweitzer Classification
Content
Invited Talks.- Computing Symmetries of Combinatorial Objects.- Large-Scale Graphics: Digital Nature and Laser Projection.- Papers.- Crossing Number of Graphs with Rotation Systems.- A Bipartite Strengthening of the Crossing Lemma.- Improvement on the Decay of Crossing Numbers.- Crossing Numbers and Parameterized Complexity.- Characterization of Unlabeled Level Planar Graphs.- Cyclic Level Planarity Testing and Embedding.- Practical Level Planarity Testing and Layout with Embedding Constraints.- Minimum Level Nonplanar Patterns for Trees.- Straight-Line Orthogonal Drawings of Binary and Ternary Trees.- Polynomial Area Bounds for MST Embeddings of Trees.- Moving Vertices to Make Drawings Plane.- Point-Set Embedding of Trees with Edge Constraints.- Representation of Planar Hypergraphs by Contacts of Triangles.- The Complexity of Several Realizability Problems for Abstract Topological Graphs.- Efficient Extraction of Multiple Kuratowski Subdivisions.- Cover Contact Graphs.- Matched Drawings of Planar Graphs.- Maximum Upward Planar Subgraphs of Embedded Planar Digraphs.- Minimizing the Area for Planar Straight-Line Grid Drawings.- On Planar Polyline Drawings.- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection.- Line Crossing Minimization on Metro Maps.- Algorithms for Multi-criteria One-Sided Boundary Labeling.- Multi-circular Layout of Micro/Macro Graphs.- Constrained Simultaneous and Near-Simultaneous Embeddings.- Simultaneous Geometric Graph Embeddings.- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.- Clustered Planarity: Small Clusters in Eulerian Graphs.- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge.- Colorability in Orthogonal Graph Drawing.- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs.- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices.- LunarVis - Analytic Visualizations of Large Graphs.- Visualizing Internet Evolution on the Autonomous Systems Level.- Treemaps for Directed Acyclic Graphs.- Drawing Graphs with GLEE.- Graph Drawing Contest.- Graph Drawing Contest Report.