Graph Drawing

12th International Symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004, Revised Selected Papers

Editors:

ISBN: 978-3-540-24528-5 (Print) 978-3-540-31843-9 (Online)

Table of contents (57 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Papers

    1. No Access

      Book Chapter

      Pages 1-11

      Reconfiguring Triangulations with Edge Flips and Point Moves

    2. No Access

      Book Chapter

      Pages 12-17

      Drawing Power Law Graphs

    3. No Access

      Book Chapter

      Pages 18-24

      Hexagonal Grid Drawings: Algorithms and Lower Bounds

    4. No Access

      Book Chapter

      Pages 25-35

      Improved Bounds for the Number of (≤ k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K n

    5. No Access

      Book Chapter

      Pages 36-42

      On the Realizable Weaving Patterns of Polynomial Curves in $\mathbb R^3$

    6. No Access

      Book Chapter

      Pages 43-48

      Drawing the AS Graph in 2.5 Dimensions

    7. No Access

      Book Chapter

      Pages 49-59

      Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps

    8. No Access

      Book Chapter

      Pages 60-70

      Convex Drawings of 3-Connected Plane Graphs

    9. No Access

      Book Chapter

      Pages 71-81

      Partitions of Complete Geometric Graphs into Plane Trees

    10. No Access

      Book Chapter

      Pages 82-88

      Additional PC-Tree Planarity Conditions

    11. No Access

      Book Chapter

      Pages 89-99

      GraphML Transformation

    12. No Access

      Book Chapter

      Pages 100-110

      Clustering Cycles into Cycles of Clusters

    13. No Access

      Book Chapter

      Pages 111-121

      Unit Bar-Visibility Layouts of Triangulated Polygons

    14. No Access

      Book Chapter

      Pages 122-132

      Really Straight Graph Drawings

    15. No Access

      Book Chapter

      Pages 133-143

      Layouts of Graph Subdivisions

    16. No Access

      Book Chapter

      Pages 144-154

      Label Number Maximization in the Slider Model

    17. No Access

      Book Chapter

      Pages 155-166

      An Efficient Implementation of Sugiyama’s Algorithm for Layered Graph Drawing

    18. No Access

      Book Chapter

      Pages 167-172

      Random Geometric Graph Diameter in the Unit Disk with ℓ p Metric

    19. No Access

      Book Chapter

      Pages 173-183

      Algorithms for Drawing Media

    20. No Access

      Book Chapter

      Pages 184-194

      Confluent Layered Drawings

previous Page of 3