Graph Drawing

7th International Symposium, GD’99 Štiřín Castle, Czech Republic September 15–19, 1999 Proceedings

  • Jan Kratochvíyl
Conference proceedings GD 1999
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)

Table of contents

  1. Front Matter
    Pages I-XIII
  2. Invited Talk

    1. Jiří Matoušek
      Pages 1-7
  3. Orthogonality I

    1. Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara
      Pages 8-26
    2. Gunnar W. Klau, Petra Mutzel
      Pages 27-37
    3. M. Closson, S. Gartshore, J. Johansen, S. K. Wismath
      Pages 49-58
  4. Levels I

    1. Vance Waddle, Ashok Malhotra
      Pages 59-71
    2. Michael Jünger, Sebastian Leipert
      Pages 72-81
    3. Ivan A. Lisitsyn, Victor N. Kasyanov
      Pages 82-89
  5. Clusters I

    1. Vladimir Batagelj, Andrej Mrvar, Matjaž Zaveršnik
      Pages 90-97
    2. Jubin Edachery, Arunabha Sen, Franz J. Brandenburg
      Pages 98-106
  6. Drawing I

    1. Janet M. Six, Ioannis G. Tollis
      Pages 107-116
    2. C. C. Cheng, C. A. Duncan, M. T. Goodrich, S. G. Kobourov
      Pages 117-126
    3. Bojan Mohar
      Pages 127-136
  7. Invited Talk

    1. Robin Thomas
      Pages 137-144
  8. Planarity

    1. Kazuyuki Miura, Shin-ichi Nakano, Takao Nishizeki
      Pages 145-154
    2. Christoph Dornheim
      Pages 155-164
    3. Michael Kaufmann, Roland Wiese
      Pages 165-174
    4. Petra Mutzel, Thomas Ziegler
      Pages 175-185
  9. Clusters II

    1. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
      Pages 186-196

About these proceedings

Introduction

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.

Keywords

Algorithmic Graph Theory Computational Geometry Diagram Design Graph Graph Computations Graph Drawing Layout Partition Sim algorithms calculus vertices visualization

Editors and affiliations

  • Jan Kratochvíyl
    • 1
  1. 1.Faculty of Mathematics and Physics School of Computer Science, Department of Applied MathematicsCharles UniversityPrague 1Czech Republic

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-46648-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66904-3
  • Online ISBN 978-3-540-46648-2
  • Series Print ISSN 0302-9743