Skip to main content
SpringerLink
Log in
Book cover

Graph Drawing

7th International Symposium, GD'99, Stirin Castle, Czech Republic, September 15-19, 1999 Proceedings

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Jan Kratochvíyl

    1. Faculty of Mathematics and Physics School of Computer Science, Department of Applied Mathematics, Charles University, Prague 1, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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

Licence this eBook for your library

Institutional subscriptions

Table of contents (44 papers)

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  2. Invited Talk

    1. The Anatomy of a Geometric Algorithm

      • Jiří Matoušek
      Pages 1-7

  3. Orthogonality I

    1. Turn-Regularity and Planar Orthogonal Drawings

      • Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara
      Pages 8-26

    2. Combining Graph Labeling and Compaction

      • Gunnar W. Klau, Petra Mutzel
      Pages 27-37

    3. Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time

      • Ashim Garg, Giuseppe Liotta
      Pages 38-48

    4. Fully Dynamic 3-Dimensional Orthogonal Graph Drawing

      • M. Closson, S. Gartshore, J. Johansen, S. K. Wismath
      Pages 49-58

  4. Levels I

    1. An E log E Line Crossing Algorithm for Levelled Graphs

      • Vance Waddle, Ashok Malhotra
      Pages 59-71

    2. Level Planar Embedding in Linear Time

      • Michael Jünger, Sebastian Leipert
      Pages 72-81

    3. Higres — Visualization System for Clustered Graphs and Graph Algorithms

      • Ivan A. Lisitsyn, Victor N. Kasyanov
      Pages 82-89

  5. Clusters I

    1. Partitioning Approach to Visualization of Large Graphs

      • Vladimir Batagelj, Andrej Mrvar, Matjaž Zaveršnik
      Pages 90-97

    2. Graph Clustering Using Distance-k Cliques

      • Jubin Edachery, Arunabha Sen, Franz J. Brandenburg
      Pages 98-106

  6. Drawing I

    1. A Framework for Circular Drawings of Networks

      • Janet M. Six, Ioannis G. Tollis
      Pages 107-116

    2. Drawing Planar Graphs with Circular Arcs

      • C. C. Cheng, C. A. Duncan, M. T. Goodrich, S. G. Kobourov
      Pages 117-126

    3. Drawing Graphs in the Hyperbolic Plane

      • Bojan Mohar
      Pages 127-136

  7. Invited Talk

    1. Graph Planarity and Related Topics

      • Robin Thomas
      Pages 137-144

  8. Planarity

    1. Grid Drawings of Four-Connected Plane Graphs

      • Kazuyuki Miura, Shin-ichi Nakano, Takao Nishizeki
      Pages 145-154

    2. Graph Embedding with Topological Cycle-Constraints

      • Christoph Dornheim
      Pages 155-164

    3. Embedding Vertices at Points: Few Bends Suffice for Planar Graphs

      • Michael Kaufmann, Roland Wiese
      Pages 165-174

    4. The Constrained Crossing Minimization Problem

      • Petra Mutzel, Thomas Ziegler
      Pages 175-185

  9. Clusters II

    1. Planarity-Preserving Clustering and Embedding for Large Planar Graphs

      • Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
      Pages 186-196
Back to top

Keywords

About this book

The range of issues considered in graph drawing includes algorithms, graph theory, geometry, topology, order theory, graphic languages, perception, app- cations, and practical systems. Much research is motivated by applications to systems for viewing and interacting with graphs. The interaction between th- retical advances and implemented solutions is an important part of the graph drawing eld. The annually organized graph drawing symposium is a forum for researchers, practitioners, developers, and users working on all aspects of graph visualization and representations. The preceding symposia were held in M- treal (GD’98), Rome (GD’97), Berkeley (GD’96), Passau (GD’95), Princeton (GD’94), and Paris (GD’93). The Seventh International Symposium on Graph Drawing GD’99 was or- nized at Sti r n Castle, in the vicinity of Prague, Czech Republic. This baroque castle recently restored as a hotel and conference center provided a secluded place for the participants, who made good use of the working atmosphere of the conference. In total the symposium had 83 registered participants from 16 countries.

Editors and Affiliations

  • Faculty of Mathematics and Physics School of Computer Science, Department of Applied Mathematics, Charles University, Prague 1, Czech Republic

    Jan Kratochvíyl

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation