Graph Drawing

11th International Symposium, GD 2003 Perugia, Italy, September 21-24, 2003 Revised Papers

Editors:

ISBN: 978-3-540-20831-0 (Print) 978-3-540-24595-7 (Online)

Table of contents (55 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Planarity and Planar Drawings

    1. No Access

      Book Chapter

      Pages 1-12

      Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

    2. No Access

      Book Chapter

      Pages 13-24

      An Experimental Study of Crossing Minimization Heuristics

    3. No Access

      Book Chapter

      Pages 25-36

      Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm

    4. No Access

      Book Chapter

      Pages 37-46

      Bounds and Methods for k-Planar Crossing Numbers

  3. Geometric Graph Theory

    1. No Access

      Book Chapter

      Pages 47-58

      How Many Ways Can One Draw a Graph?

    2. No Access

      Book Chapter

      Pages 59-70

      Two Results on Intersection Graphs of Polygons

    3. No Access

      Book Chapter

      Pages 71-85

      Stretching of Jordan Arc Contact Systems

    4. No Access

      Book Chapter

      Pages 86-97

      Noncrossing Hamiltonian Paths in Geometric Graphs

  4. Applications and Systems – Part I

    1. No Access

      Book Chapter

      Pages 98-110

      GraphAEL: Graph Animations with Evolving Layouts

    2. No Access

      Book Chapter

      Pages 111-122

      Visualizing Related Metabolic Pathways in Two and a Half Dimensions

    3. No Access

      Book Chapter

      Pages 123-128

      GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon – System Demonstration

  5. Straight-Line, Circular, and Circular-Arc Drawings

    1. No Access

      Book Chapter

      Pages 129-134

      Area-Efficient Drawings of Outerplanar Graphs

    2. No Access

      Book Chapter

      Pages 135-146

      A Framework for User-Grouped Circular Drawings

    3. No Access

      Book Chapter

      Pages 147-158

      Fixed-Location Circular-Arc Drawing of Planar Graphs

    4. No Access

      Book Chapter

      Pages 159-165

      A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio

  6. Symmetries

    1. No Access

      Book Chapter

      Pages 166-177

      An Integer Programming Approach to Fuzzy Symmetry Detection

    2. No Access

      Book Chapter

      Pages 178-189

      Barycentric Drawings of Periodic Graphs

  7. 3D-Drawings

    1. No Access

      Book Chapter

      Pages 190-201

      Three-Dimensional Grid Drawings with Sub-quadratic Volume

    2. No Access

      Book Chapter

      Pages 202-213

      Laying Out Iterated Line Digraphs Using Queues

    3. No Access

      Book Chapter

      Pages 214-225

      Track Drawings of Graphs with Constant Queue Number

previous Page of 3