Skip to main content
  • Conference proceedings
  • © 2002

Graph Drawing

9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2265)

Conference series link(s): GD: International Symposium on Graph Drawing and Network Visualization

Conference proceedings info: GD 2001.

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (60 papers)

  1. Front Matter

    Pages I-XV
  2. Hierarchical Drawing

    1. A Fixed-Parameter Approach to Two-Layer Planarization

      • V. Dujmović, M. Fellows, M. Hallett, M. Kitching, Giuseppe Liotta, C. McCartin et al.
      Pages 1-15
    2. How to Layer a Directed Acyclic Graph

      • Patrick Healy, Nikola S. Nikolov
      Pages 16-30
    3. Fast and Simple Horizontal Coordinate Assignment

      • Ulrik Brandes, Boris Köpf
      Pages 31-44
    4. Automated Visualization of Process Diagrams

      • Janet M. Six, Ioannis G. Tollis
      Pages 45-59
  3. Planarity

    1. Planarization of Clustered Graphs

      • Giuseppe Di Battista, Walter Didimo, A. Marcandalli
      Pages 60-74
    2. An Algorithm for Finding Large Induced Planar Subgraphs

      • Keith Edwards, Graham Farr
      Pages 75-83
    3. A Characterization of DFS Cotree Critical Graphs

      • Hubert de Fraysseix, Patrice Ossona de Mendez
      Pages 84-95
  4. Crossing Theory

    1. An Improved Lower Bound for Crossing Numbers

      • Hristo Djidjev, Imrich Vrt’o
      Pages 96-101
    2. Crossing-Critical Graphs and Path-Width

      • Petr Hliněný
      Pages 102-114
    3. One Sided Crossing Minimization Is NP-Hard for Sparse Graphs

      • Xavier Muñoz, W. Unger, Imrich Vrt’o
      Pages 115-123
  5. Compaction

    1. Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size

      • Markus Eiglsperger, Michael Kaufmann
      Pages 124-138
    2. Labeling Heuristics for Orthogonal Drawings

      • Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
      Pages 139-153
  6. Planar Graphs

    1. Untangling a Polygon

      • János Pach, Gábor Tardos
      Pages 154-161
    2. Drawing with Fat Edges

      • Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk
      Pages 162-177
  7. Symmetries

    1. Detecting Symmetries by Branch & Cut

      • Christoph Buchheim, Michael Jünger
      Pages 178-188
  8. Interactive Drawing

    1. User Hints for Directed Graph Drawing

      • Hugo A. D. Nascimento, Peter Eades
      Pages 205-219
    2. Graph Drawing in Motion II

      • Carsten Friedrich, Michael E. Houle
      Pages 220-231
    3. Online Hierarchical Graph Drawing

      • Stephen C. North, Gordon Woodhull
      Pages 232-246

Other Volumes

  1. Graph Drawing

Editors and Affiliations

  • Abteilung für Algorithmen und Datenstrukturen Institut für Computergraphik und Algorithmen, Technische Universität Wien, Wien, Austria

    Petra Mutzel

  • Institut für Informatik, Universität zu Köln, Köln, Germany

    Michael Jünger

  • caesar - center of advanced european studies and research, Bonn, Germany

    Sebastian Leipert

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access