Graph Drawing

8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20–23, 2000 Proceedings

  • Joe Marks
Conference proceedings GD 2000
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1984)

Table of contents

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

  3. Empirical Studies and Standards

    1. Helen C. Purchase, Jo-Anne Allder, David Carrington
      Pages 5-18
    2. Stina Bridgeman, Roberto Tamassia
      Pages 19-30
    3. Neal Lesh, Joe Marks, Maurizio Patrignani
      Pages 31-36
    4. Gunnar W. Klau, Karsten Klein, Petra Mutzel
      Pages 37-51
    5. Ivan Herman, M. Scott Marshall
      Pages 52-62
  4. Theory I

    1. Joan P. Hutchinson
      Pages 63-76
    2. Carsten Gutwenger, Petra Mutzel
      Pages 77-90
    3. Shin-ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
      Pages 91-102
    4. Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
      Pages 103-114
  5. Applications and Systems

    1. J. D. Boissonnat, F. Cazals, J. Flötotto
      Pages 115-126
    2. Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner
      Pages 127-138
    3. R. Castelló, R. Mili, I. G. Tollis
      Pages 139-149
    4. Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia
      Pages 150-163
    5. François Bertault, Peter Eades
      Pages 164-169
  6. Invited Talk

    1. David Jensen
      Pages 170-170
  7. Force-Directed Layout

About these proceedings

Introduction

This year’s meeting marked the Eighth International Symposium on Graph D- wing. The organizing and program committees worked hard to make this year’s symposium possible, and we were delighted that so many people came to - lonial Williamsburg, Virginia, for three days of the latest results in the eld of graph drawing. As in previous years, the review process was quite competitive. We accepted 30 out of 53 regular-length submissions, and 5 out of 15 short submissions, for a total acceptance ratio of 35 out of 68, or 51%. This year’s program featured several new developments in the eld. Four di erent approaches for handling very large graphs were presented in a session on force-directed layout. Two sessions were devoted to the latest advances in orthogonal graph drawing. And alongside the usual mix of theory and practice papers we had several contributions based on empirical studies of users and of systems. Our invited talks were given by two speakers who were new to most members of the GD community, but who work in areas that are closely related to graph drawing. Professor Colin Ware of the University of New Hampshire told us how knowledge of human visual perception is useful for the design of e ective data visualizations. And Professor David Jensen of the University of Massachusetts at Amherst talked about the process of knowledge discovery from graphs, a process that involves more than just graph drawing and visualization.

Keywords

AES Algorithmic Graphy Theory Diagram Design Graph Graph Computations Graph Drawing Graph Layout Graph Representation Hypergraph Partition Sim Unified Modeling Language (UML) algorithms data structures visualization

Editors and affiliations

  • Joe Marks
    • 1
  1. 1.Mitsubishi Electric Research LaboratoriesCambridgeUSA

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-44541-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-41554-1
  • Online ISBN 978-3-540-44541-8
  • Series Print ISSN 0302-9743
  • About this book