Skip to main content
  • Conference proceedings
  • © 2008

Graph Drawing

15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers

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

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

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 (39 papers)

  1. Front Matter

  2. Invited Talks

  3. Papers

    1. Crossing Number of Graphs with Rotation Systems

      • Michael J. Pelsmajer, Marcus Schaefer, Daniel Štefankovič
      Pages 3-12
    2. A Bipartite Strengthening of the Crossing Lemma

      • Jacob Fox, János Pach, Csaba D. Tóth
      Pages 13-24
    3. Improvement on the Decay of Crossing Numbers

      • Jakub Černý, Jan Kynčl, Géza Tóth
      Pages 25-30
    4. Crossing Numbers and Parameterized Complexity

      • Michael J. Pelsmajer, Marcus Schaefer, Daniel Štefankovič
      Pages 31-36
    5. Characterization of Unlabeled Level Planar Graphs

      • J. Joseph Fowler, Stephen G. Kobourov
      Pages 37-49
    6. Cyclic Level Planarity Testing and Embedding

      • Christian Bachmaier, Wolfgang Brunner, Christof König
      Pages 50-61
    7. Minimum Level Nonplanar Patterns for Trees

      • J. Joseph Fowler, Stephen G. Kobourov
      Pages 69-75
    8. Moving Vertices to Make Drawings Plane

      • Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
      Pages 101-112
    9. Point-Set Embedding of Trees with Edge Constraints

      • Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
      Pages 113-124
    10. Representation of Planar Hypergraphs by Contacts of Triangles

      • Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl
      Pages 125-136
    11. Efficient Extraction of Multiple Kuratowski Subdivisions

      • Markus Chimani, Petra Mutzel, Jens M. Schmidt
      Pages 159-170
    12. Cover Contact Graphs

      • Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández et al.
      Pages 171-182
    13. Matched Drawings of Planar Graphs

      • Emilio Di Giacomo, Walter Didimo, Marc van Kreveld, Giuseppe Liotta, Bettina Speckmann
      Pages 183-194

Other Volumes

  1. Graph Drawing

Keywords

  • Graph
  • Layout
  • Sim
  • algorithmic graph theory
  • algorithms
  • complexity
  • computational graph theory
  • constrained optimization
  • crossing-critical graphs
  • geometric network
  • graph coloring
  • graph design
  • graph drawing
  • graph layout
  • vertices
  • 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