Graph Drawing 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Hong, Seok-Hee (Επιμελητής έκδοσης), Nishizeki, Takao (Επιμελητής έκδοσης), Quan, Wu (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 4875
• Θέματα: Computer science.; Data structures (Computer science).; Algorithms.; Computer science > Mathematics.; Computer graphics.; Computer Science.; Discrete Mathematics in Computer Science.; Algorithm Analysis and Problem Complexity.; Computer Graphics.; Data Structures.

Πίνακας περιεχομένων:

• 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.