Skip to main content
  • Conference proceedings
  • © 2007

Graph Drawing

14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006, Revised Papers

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

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 2006.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

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

Table of contents (45 papers)

  1. Front Matter

  2. Invited Talks

    1. The Algorithmic Beauty of Digital Nature

      • Oliver Deussen
      Pages 5-7
  3. Papers

    1. Integrating Edge Routing into Force-Directed Layout

      • Tim Dwyer, Kim Marriott, Michael Wybrow
      Pages 8-19
    2. SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding

      • Ali Çivril, Malik Magdon-Ismail, Eli Bocek-Rivele
      Pages 30-41
    3. Angle and Distance Constraints on Tree Drawings

      • Ulrik Brandes, Barbara Schlieper
      Pages 54-65
    4. Schematisation of Tree Drawings

      • Joachim Gudmundsson, Marc van Kreveld, Damian Merrick
      Pages 66-76
    5. Trees with Convex Faces and Optimal Angles

      • Josiah Carlson, David Eppstein
      Pages 77-88
    6. Three-Dimensional Drawings of Bounded Degree Trees

      • Fabrizio Frati, Giuseppe Di Battista
      Pages 89-94
    7. Simultaneous Graph Embedding with Bends and Circular Arcs

      • Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
      Pages 95-107
    8. Drawing Cubic Graphs with at Most Five Slopes

      • Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
      Pages 114-125
    9. Planarity Testing and Optimal Edge Insertion with Embedding Constraints

      • Carsten Gutwenger, Karsten Klein, Petra Mutzel
      Pages 126-137
    10. Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs

      • Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki
      Pages 138-149
    11. On the Crossing Number of Almost Planar Graphs

      • Petr Hliněný, Gelasio Salazar
      Pages 162-173
    12. On the Decay of Crossing Numbers

      • Jacob Fox, Csaba D. Tóth
      Pages 174-183

Other Volumes

  1. Graph Drawing

Keywords

  • Graph
  • Layout
  • Node
  • Sim
  • algorithmic graph theory
  • algorithms
  • computational graph theory
  • constrained optimization
  • corssing-critical graphs
  • diagram design
  • geometric network
  • graph algorithms
  • graph design
  • graph drawing
  • visualization
  • algorithm analysis and problem complexity
  • data structures

Bibliographic Information

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions