Seok-Hee Hong / Takao Nishizeki / Wu Quan (eds.)
Graph Drawing
15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers
Herausgegeben:Hong, Seok-Hee; Nishizeki, Takao; Quan, Wu
Seok-Hee Hong / Takao Nishizeki / Wu Quan (eds.)
Graph Drawing
15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers
Herausgegeben:Hong, Seok-Hee; Nishizeki, Takao; Quan, Wu
- Broschiertes Buch
Andere Kunden interessierten sich auch für
- János Pach (Volume ed.)Graph Drawing100,92 €
- Guiseppe Liotta (ed.)Graph Drawing83,99 €
- Ioannis G. Tollis / Maurizio Patrignani (Volume editor)Graph Drawing37,99 €
- Jan Kratochvil (ed.)Graph Drawing42,99 €
- Stephen G. Kobourov / Michael T. Goodrich (eds.)Graph Drawing42,99 €
- Andrea Corradini / Hartmut Ehrig / Ugo Montanari / Leila Ribeiro / Grzegorz Rozenberg (eds.)Graph Transformations42,99 €
- Petra Mutzel / Michael Jünger / Sebastian Leipert (eds.)Graph Drawing83,99 €
-
-
-
Produktdetails
- Theoretical Computer Science and General Issues 4875
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 978-3-540-77536-2
- Seitenzahl: 401
- Englisch
- Abmessung: 22mm x 155mm x 235mm
- Gewicht: 640g
- ISBN-13: 9783540775362
- ISBN-10: 3540775366
- Artikelnr.: 23413059
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
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.
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.