Graph Drawing

17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers

  • David Eppstein
  • Emden R. Gansner
Conference proceedings GD 2009

DOI: 10.1007/978-3-642-11805-0

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

Table of contents (48 papers)

  1. Front Matter
  2. Invited Talks

  3. Papers

    1. Drawing Hamiltonian Cycles with No Large Angles
      Adrian Dumitrescu, János Pach, Géza Tóth
      Pages 3-14
    2. Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
      Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
      Pages 15-20
    3. On the Perspectives Opened by Right Angle Crossing Drawings
      Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann et al.
      Pages 21-32
    4. Planar Drawings of Higher-Genus Graphs
      Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
      Pages 45-56
    5. Splitting Clusters to Get C-Planarity
      Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani
      Pages 57-68
    6. On the Characterization of Level Planar Trees by Minimal Patterns
      Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
      Pages 69-80
    7. Upward Planarization Layout
      Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong
      Pages 94-106
    8. More Flexible Radial Layout
      Ulrik Brandes, Christian Pich
      Pages 107-118
    9. WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations
      Brynjar Gretarsson, Svetlin Bostandjiev, John O’Donovan, Tobias Höllerer
      Pages 119-134
    10. Port Constraints in Hierarchical Layout of Data Flow Diagrams
      Miro Spönemann, Hauke Fuhrmann, Reinhard von Hanxleden, Petra Mutzel
      Pages 135-146
    11. Fast Edge-Routing for Large Graphs
      Tim Dwyer, Lev Nachmanson
      Pages 147-158
    12. Leftist Canonical Ordering
      Melanie Badent, Michael Baur, Ulrik Brandes, Sabine Cornelsen
      Pages 159-170
    13. Succinct Greedy Drawings Do Not Always Exist
      Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
      Pages 171-182
    14. Geometric Simultaneous Embeddings of a Graph and a Matching
      Sergio Cabello, Marc van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek
      Pages 183-194
    15. Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
      Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios E. Varvitsiotis
      Pages 195-200

About these proceedings

Keywords

Matching algorithms complexity computer graphics data mining data structures geometric algorithms graph algorithms graph theory graphs and networks

Editors and affiliations

  • David Eppstein
    • 1
  • Emden R. Gansner
    • 2
  1. 1.Computer Science DepartmentUniversity of CaliforniaIrvineUSA
  2. 2.AT&T Labs - ResearchFlorham ParkUSA

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-11804-3
  • Online ISBN 978-3-642-11805-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349