Graph Drawing

11th International Symposium, GD 2003 Perugia, Italy, September 21-24, 2003 Revised Papers

  • Giuseppe Liotta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2912)

Table of contents

  1. Front Matter
  2. Planarity and Planar Drawings

    1. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
      Pages 1-12
    2. Carsten Gutwenger, Petra Mutzel
      Pages 13-24
    3. John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista
      Pages 25-36
    4. Farhad Shahrokhi, Ondrej Sýkora, Laszlo A. Székely, Imrich Vrt’o
      Pages 37-46
  3. Geometric Graph Theory

    1. János Pach, Géza Tóth
      Pages 47-58
    2. Jan Kratochvíl, Martin Pergel
      Pages 59-70
    3. Hubert de Fraysseix, Patrice Ossona de Mendez
      Pages 71-85
    4. Jakub Černý, Zdeněk Dvořák, Vít Jelínek, Jan Kára
      Pages 86-97
  4. Applications and Systems – Part I

    1. Cesim Erten, Philip J. Harding, Stephen G. Kobourov, Kevin Wampler, Gary Yee
      Pages 98-110
    2. Ulrik Brandes, Tim Dwyer, Falk Schreiber
      Pages 111-122
    3. Carsten Gutwenger, Joachim Kupke, Karsten Klein, Sebastian Leipert
      Pages 123-128
  5. Straight-Line, Circular, and Circular-Arc Drawings

    1. Ashim Garg, Adrian Rusu
      Pages 129-134
    2. Janet M. Six, Ioannis (Yanni) G. Tollis
      Pages 135-146
    3. Alon Efrat, Cesim Erten, Stephen G. Kobourov
      Pages 147-158
  6. Symmetries

    1. Christoph Buchheim, Michael Jünger
      Pages 166-177
    2. Olaf Delgado-Friedrichs
      Pages 178-189
  7. 3D-Drawings

About these proceedings

Introduction

The 11th International Symposium on Graph Drawing (GD 2003) was held on September 21–24, 2003, at the Universit` a degli Studi di Perugia, Perugia, Italy. GD 2003 attracted 93 participants from academic and industrial institutions in 17 countries. In response to the call for papers, the program committee received 88 re- larsubmissionsdescribingoriginalresearchand/orsystemdemonstrations.Each submission was reviewed by at least 4 program committee members and c- ments were returned to the authors. Following extensive e-mail discussions, the program committee accepted 34 long papers (12 pages each in the proceedings) and 11 short papers (6 pages each in the proceedings). Also, 6 posters (2 pages each in the proceedings) were displayed in the conference poster gallery. In addition to the 88 submissions, the program committee also received a submission of special type, one that was not competing with the others for a time slot in the conference program and that collects selected open problems in graph drawing. The aim of this paper, which was refereed with particular care andUNCHANGEDtworoundsofrevisions,istostimulatefutureresearchinthe graph drawing community. The paper presents 42 challenging open problems in di?erentareasofgraphdrawingandcontainsmorethan120references.Although the length of the paper makes it closer to a journal version than to a conference extended abstract, we decided to include it in the conference proceedings so that it could easily reach in a short time the vast majority of the graph drawing community.

Keywords

3D Graph Graph theory Hamiltonian path Hypergraph Node Sim algorithmic graph theory computational graph theory graph algorithms graph computations graph design graph drawing information visualization visualization

Editors and affiliations

  • Giuseppe Liotta
    • 1
  1. 1.Dip. di Ingegneria Elettronica e dell’InformazioneUniversità degli Studi di Perugia 

Bibliographic information

  • DOI https://doi.org/10.1007/b94919
  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-20831-0
  • Online ISBN 978-3-540-24595-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book