Graph Drawing

1. Front Matter

   PDF

2. Planarity and Planar Drawings

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

      • Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng

      Pages 1-12

   2. An Experimental Study of Crossing Minimization Heuristics

      • Carsten Gutwenger, Petra Mutzel

      Pages 13-24

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

      • John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista

      Pages 25-36

   4. Bounds and Methods for k-Planar Crossing Numbers

      • Farhad Shahrokhi, Ondrej Sýkora, Laszlo A. Székely, Imrich Vrt’o

      Pages 37-46

3. Geometric Graph Theory

   1. How Many Ways Can One Draw a Graph?

      • János Pach, Géza Tóth

      Pages 47-58

   2. Two Results on Intersection Graphs of Polygons

      • Jan Kratochvíl, Martin Pergel

      Pages 59-70

   3. Stretching of Jordan Arc Contact Systems

      • Hubert de Fraysseix, Patrice Ossona de Mendez

      Pages 71-85

   4. Noncrossing Hamiltonian Paths in Geometric Graphs

      • Jakub Černý, Zdeněk Dvořák, Vít Jelínek, Jan Kára

      Pages 86-97

4. Applications and Systems – Part I

   1. GraphAEL : Graph Animations with Evolving Layouts

      • Cesim Erten, Philip J. Harding, Stephen G. Kobourov, Kevin Wampler, Gary Yee

      Pages 98-110

   2. Visualizing Related Metabolic Pathways in Two and a Half Dimensions

      • Ulrik Brandes, Tim Dwyer, Falk Schreiber

      Pages 111-122

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

      • Carsten Gutwenger, Joachim Kupke, Karsten Klein, Sebastian Leipert

      Pages 123-128

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

   1. Area-Efficient Drawings of Outerplanar Graphs

      • Ashim Garg, Adrian Rusu

      Pages 129-134

   2. A Framework for User-Grouped Circular Drawings

      • Janet M. Six, Ioannis (Yanni) G. Tollis

      Pages 135-146

   3. Fixed-Location Circular-Arc Drawing of Planar Graphs

      • Alon Efrat, Cesim Erten, Stephen G. Kobourov

      Pages 147-158

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

      • Ashim Garg, Adrian Rusu

      Pages 159-165

6. Symmetries

   1. An Integer Programming Approach to Fuzzy Symmetry Detection

      • Christoph Buchheim, Michael Jünger

      Pages 166-177

   2. Barycentric Drawings of Periodic Graphs

      • Olaf Delgado-Friedrichs

      Pages 178-189

7. 3D-Drawings

   1. Three-Dimensional Grid Drawings with Sub-quadratic Volume

      • Vida Dujmović, David R. Wood

      Pages 190-201

   2. Laying Out Iterated Line Digraphs Using Queues

      • Toru Hasunuma

      Pages 202-213

The 11th International Symposium on Graph Drawing (GD 2003) was held on September 21–24, 2003, at the Universit` a degli Studi di Perugia, Perugia, Italy. GD 2003 attracted 93 participants from academic and industrial institutions in 17 countries. In response to the call for papers, the program committee received 88 re- larsubmissionsdescribingoriginalresearchand/orsystemdemonstrations.Each submission was reviewed by at least 4 program committee members and c- ments were returned to the authors. Following extensive e-mail discussions, the program committee accepted 34 long papers (12 pages each in the proceedings) and 11 short papers (6 pages each in the proceedings). Also, 6 posters (2 pages each in the proceedings) were displayed in the conference poster gallery. In addition to the 88 submissions, the program committee also received a submission of special type, one that was not competing with the others for a time slot in the conference program and that collects selected open problems in graph drawing. The aim of this paper, which was refereed with particular care andUNCHANGEDtworoundsofrevisions,istostimulatefutureresearchinthe graph drawing community. The paper presents 42 challenging open problems in di?erentareasofgraphdrawingandcontainsmorethan120references.Although the length of the paper makes it closer to a journal version than to a conference extended abstract, we decided to include it in the conference proceedings so that it could easily reach in a short time the vast majority of the graph drawing community.

• 3D
• Graph
• Graph theory
• Hamiltonian path
• Hypergraph
• Node
• Sim
• algorithmic graph theory
• computational graph theory
• graph algorithms
• graph computations
• graph design
• graph drawing
• information visualization
• visualization
• algorithm analysis and problem complexity

• Dip. di Ingegneria Elettronica e dell’Informazione, Università degli Studi di Perugia,  

  Giuseppe Liotta

Policies and ethics