Advertisement

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

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

Table of contents

  1. Front Matter
    PDF

  2. Invited Talks

    1. Why Are String Graphs So Beautiful?
      János Pach
      Pages 1-1
      PDF
    2. The Art of Cheating When Drawing a Graph
      Martin Wattenberg
      Pages 2-2
      PDF

  3. Papers

    1. Drawing Hamiltonian Cycles with No Large Angles
      Adrian Dumitrescu, János Pach, Géza Tóth
      Pages 3-14
      PDF
    2. Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
      Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
      Pages 15-20
      PDF
    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
      PDF
    4. Drawing 3-Polytopes with Good Vertex Resolution
      André Schulz
      Pages 33-44
      PDF
    5. Planar Drawings of Higher-Genus Graphs
      Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
      Pages 45-56
      PDF
    6. Splitting Clusters to Get C-Planarity
      Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani
      Pages 57-68
      PDF
    7. On the Characterization of Level Planar Trees by Minimal Patterns
      Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
      Pages 69-80
      PDF
    8. Characterization of Unlabeled Radial Level Planar Graphs
      J. Joseph Fowler
      Pages 81-93
      PDF
    9. Upward Planarization Layout
      Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong
      Pages 94-106
      PDF
    10. More Flexible Radial Layout
      Ulrik Brandes, Christian Pich
      Pages 107-118
      PDF
    11. WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations
      Brynjar Gretarsson, Svetlin Bostandjiev, John O’Donovan, Tobias Höllerer
      Pages 119-134
      PDF
    12. Port Constraints in Hierarchical Layout of Data Flow Diagrams
      Miro Spönemann, Hauke Fuhrmann, Reinhard von Hanxleden, Petra Mutzel
      Pages 135-146
      PDF
    13. Fast Edge-Routing for Large Graphs
      Tim Dwyer, Lev Nachmanson
      Pages 147-158
      PDF
    14. Leftist Canonical Ordering
      Melanie Badent, Michael Baur, Ulrik Brandes, Sabine Cornelsen
      Pages 159-170
      PDF
    15. Succinct Greedy Drawings Do Not Always Exist
      Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
      Pages 171-182
      PDF
    16. 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
      PDF
    17. Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
      Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios E. Varvitsiotis
      Pages 195-200
      PDF
    18. Removing Independently Even Crossings
      Michael J. Pelsmajer, Marcus Schaefer, Daniel Štefankovič
      Pages 201-206
      PDF
    19. Manhattan-Geodesic Embedding of Planar Graphs
      Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff
      Pages 207-218
      PDF
    20. Orthogonal Connector Routing
      Michael Wybrow, Kim Marriott, Peter J. Stuckey
      Pages 219-231
      PDF
    21. On Rectilinear Drawing of Graphs
      Peter Eades, Seok-Hee Hong, Sheung-Hung Poon
      Pages 232-243
      PDF
    22. Semi-bipartite Graph Visualization for Gene Ontology Networks
      Kai Xu, Rohan Williams, Seok-Hee Hong, Qing Liu, Ji Zhang
      Pages 244-255
      PDF
    23. On Open Problems in Biological Network Visualization
      Mario Albrecht, Andreas Kerren, Karsten Klein, Oliver Kohlbacher, Petra Mutzel, Wolfgang Paul et al.
      Pages 256-267
      PDF
    24. A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View
      Markus Rohrschneider, Christian Heine, André Reichenbach, Andreas Kerren, Gerik Scheuermann
      Pages 268-279
      PDF
    25. Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs
      Therese Biedl
      Pages 280-291
      PDF
    26. Drawing Trees in a Streaming Model
      Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino et al.
      Pages 292-303
      PDF
    27. The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
      Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesař, Tomáš Vyskočil
      Pages 304-315
      PDF
    28. Drawing Planar 3-Trees with Given Face-Areas
      Therese Biedl, Lesvia Elena Ruiz Velázquez
      Pages 316-322
      PDF
    29. 3D Visibility Representations by Regular Polygons
      Jan Štola
      Pages 323-333
      PDF
    30. Complexity of Some Geometric and Topological Problems
      Marcus Schaefer
      Pages 334-344
      PDF
    31. On Planar Supports for Hypergraphs
      Kevin Buchin, Marc van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek
      Pages 345-356
      PDF
    32. DAGmaps and ε-Visibility Representations of DAGs
      Vassilis Tsiaras, Ioannis G. Tollis
      Pages 357-368
      PDF
    33. Drawing Directed Graphs Clockwise
      Christian Pich
      Pages 369-380
      PDF
    34. An Improved Algorithm for the Metro-line Crossing Minimization Problem
      Martin Nöllenburg
      Pages 381-392
      PDF
    35. Layout with Circular and Other Non-linear Constraints Using Procrustes Projection
      Tim Dwyer, George Robertson
      Pages 393-404
      PDF

  4. Posters

    1. GMap: Drawing Graphs as Maps
      Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
      Pages 405-407
      PDF
    2. Using High Dimensions to Compare Drawings of Graphs
      Stina Bridgeman
      Pages 408-410
      PDF
    3. On ρ-Constrained Upward Topological Book Embeddings
      Tamara Mchedlidze, Antonios Symvonis
      Pages 411-412
      PDF
    4. 4-Labelings and Grid Embeddings of Plane Quadrangulations
      Lali Barrière, Clemens Huemer
      Pages 413-414
      PDF
    5. IBM ILOG Graph Layout for Eclipse
      Jerome Joubert, Stephane Lizeray, Romain Raugi, Georg Sander
      Pages 415-416
      PDF
    6. Layout Techniques Coupled with Web2.0-Based Business Process Modeling
      Philip Effinger, Gero Decker
      Pages 417-418
      PDF
    7. Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles
      Michael Kaufmann, Stephan Kottler
      Pages 419-420
      PDF
    8. Visualization of Complex BPEL Models
      Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler
      Pages 421-423
      PDF
    9. DAGmaps and Dominance Relationships
      Vassilis Tsiaras, Ioannis G. Tollis
      Pages 424-425
      PDF
    10. Scaffold Hunter – Interactive Exploration of Chemical Space
      Karsten Klein, Nils Kriege, Petra Mutzel, Herbert Waldmann, Stefan Wetzel
      Pages 426-427
      PDF

  5. Graph Drawing Contest

    1. Graph Drawing Contest Report
      Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander
      Pages 428-433
      PDF
  6. Back Matter
    PDF

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

  • DOI https://doi.org/10.1007/978-3-642-11805-0
  • 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
  • Buy this book on publisher's site