Skip to main content
  • Conference proceedings
  • © 2011

Graph Drawing

18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Revised Selected Papers

  • Fast-track conference proceedings

  • State-of-the-art research

  • Up-to-date results

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): GD: International Symposium on Graph Drawing and Network Visualization

Conference proceedings info: GD 2010.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, access via your institution.

Table of contents (44 papers)

  1. Front Matter

  2. Papers

    1. On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles

      • Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth
      Pages 1-12
    2. Monotone Drawings of Graphs

      • Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
      Pages 13-24
    3. Upward Geometric Graph Embeddings into Point Sets

      • Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
      Pages 25-37
    4. On a Tree and a Path with No Geometric Simultaneous Embedding

      • Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth
      Pages 38-49
    5. Difference Map Readability for Dynamic Graphs

      • Daniel Archambault, Helen C. Purchase, Bruno Pinaud
      Pages 50-61
    6. Maximizing the Total Resolution of Graphs

      • Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis
      Pages 62-67
    7. Plane Drawings of Queue and Deque Graphs

      • Christopher Auer, Christian Bachmaier, Franz Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner
      Pages 68-79
    8. An Experimental Evaluation of Multilevel Layout Methods

      • Gereon Bartel, Carsten Gutwenger, Karsten Klein, Petra Mutzel
      Pages 80-91
    9. Orthogonal Graph Drawing with Flexibility Constraints

      • Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner
      Pages 92-104
    10. Drawing Ordered (k − 1)–Ary Trees on k–Grids

      • Wolfgang Brunner, Marco Matzeder
      Pages 105-116
    11. Optimizing Regular Edge Labelings

      • Kevin Buchin, Bettina Speckmann, Sander Verdonschot
      Pages 117-128
    12. Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area

      • Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler
      Pages 129-140
    13. Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints

      • Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong
      Pages 141-152
    14. Drawing Graphs on a Smartphone

      • Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia
      Pages 153-164
    15. Topology-Driven Force-Directed Algorithms

      • Walter Didimo, Giuseppe Liotta, Salvatore A. Romeo
      Pages 165-176
    16. On Graphs Supported by Line Sets

      • Vida Dujmović, William Evans, Stephen Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen Wismath
      Pages 177-182
    17. Drawing Trees with Perfect Angular Resolution and Polynomial Area

      • Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
      Pages 183-194
    18. Lombardi Drawings of Graphs

      • Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
      Pages 195-207
    19. Optimal 3D Angular Resolution for Low-Degree Graphs

      • David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
      Pages 208-219

Other Volumes

  1. Graph Drawing

About this book

This volume constitutes the refereed proceedings of the 18th International Symposium on Graph Drawing, GD 2010, held in Konstanz, Germany, during September 2010. The 30 revised full papers presented together with 5 revised short and 8 poster papers were carefully reviewed and selected from 77 submissions. The volume also contains a detailed report about the 17th Annual Graph Drawing Contest, held as a satellite event of GD 2010. Devoted both to theoretical advances as well as to implemented solutions, the papers are concerned with the geometric representation of graphs and networks and are motivated by those applications where it is crucial to visualize structural information as graphs.

Keywords

  • algorithms
  • clustered graphs
  • data mining
  • data structures
  • drawing algorithm
  • graph algorithms
  • graph drawing
  • graph theory
  • graph visualization
  • orthogonal drawing
  • planar graphs
  • quality
  • rectangular dualization
  • tree drawings
  • triangular grid
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Department of Computer and Information Science, University of Konstanz, Konstanz, Germany

    Ulrik Brandes, Sabine Cornelsen

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access