Graph Drawing

Papers

1. Drawing of Two-Dimensional Irregular Meshes

   • Alok Aggarwal, S. Rao Kosaraju, Mihai Pop

   Pages 1-14

2. Quasi-Upward Planarity

   • Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo

   Pages 15-29

3. Three Approaches to 3D-Orthogonal Box-Drawings

   • Therese C. Biedl

   Pages 30-43

4. Using Graph Layout to Visualize Train Interconnection Data

   • Ulrik Brandes, Dorothea Wagner

   Pages 44-56

5. Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms

   • Stina Bridgeman, Roberto Tamassia

   Pages 57-71

6. Upward Planarity Checking: “Faces Are More than Polygons”

   • Giuseppe Di Battista, Giuseppe Liotta

   Pages 72-86

7. A Split&Push Approach to 3D Orthogonal Drawing

   • Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu

   Pages 87-101

8. Geometric Thickness of Complete Graphs

   • Michael B. Dillencourt, David Eppstein, DanielS. Hirschberg

   Pages 102-110

9. Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs

   • Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov

   Pages 111-124

10. On Improving Orthogonal Drawings: The 4M-Algorithm

    • Ulrich Fößmeier, Carsten Heß, Michael Kaufmann

    Pages 125-137

11. Algorithmic Patterns for Orthogonal Graph Drawing

    • Natasha Gelfand, Roberto Tamassia

    Pages 138-152

12. A Framework for Drawing Planar Graphs with Curves and Polylines

    • Michael T. Goodrich, Christopher G. Wagner

    Pages 153-166

13. Planar Polyline Drawings with Good Angular Resolution

    • Carsten Gutwenger, Petra Mutzel

    Pages 167-182

14. A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order

    • Kunihiko Hayashi, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara

    Pages 183-197

15. Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions

    • Seok-Hee Hong, Peter Eades, Aaron Quigley, Sang-Ho Lee

    Pages 198-209

16. Approximation Algorithms for Finding Best Viewpoints

    • Michael E. Houle, Richard Webber

    Pages 210-223

17. Level Planarity Testing in Linear Time

    • Michael Jünger, Sebastian Leipert, Petra Mutzel

    Pages 224-237

18. Crossing Number of Abstract Topological Graphs

    • Jan Kratochvíl

    Pages 238-245

19. Self-Organizing Graphs — A Neural Network Perspective of Graph Layout

    • Bernd Meyer

    Pages 246-262