Graph Drawing

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

Editors:

ISBN: 978-3-540-77536-2 (Print) 978-3-540-77537-9 (Online)

Table of contents (39 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-1

      Computing Symmetries of Combinatorial Objects

    2. No Access

      Book Chapter

      Pages 2-2

      Large-Scale Graphics: Digital Nature and Laser Projection

  3. Papers

    1. No Access

      Book Chapter

      Pages 3-12

      Crossing Number of Graphs with Rotation Systems

    2. No Access

      Book Chapter

      Pages 13-24

      A Bipartite Strengthening of the Crossing Lemma

    3. No Access

      Book Chapter

      Pages 25-30

      Improvement on the Decay of Crossing Numbers

    4. No Access

      Book Chapter

      Pages 31-36

      Crossing Numbers and Parameterized Complexity

    5. No Access

      Book Chapter

      Pages 37-49

      Characterization of Unlabeled Level Planar Graphs

    6. No Access

      Book Chapter

      Pages 50-61

      Cyclic Level Planarity Testing and Embedding

    7. No Access

      Book Chapter

      Pages 62-68

      Practical Level Planarity Testing and Layout with Embedding Constraints

    8. No Access

      Book Chapter

      Pages 69-75

      Minimum Level Nonplanar Patterns for Trees

    9. No Access

      Book Chapter

      Pages 76-87

      Straight-Line Orthogonal Drawings of Binary and Ternary Trees

    10. No Access

      Book Chapter

      Pages 88-100

      Polynomial Area Bounds for MST Embeddings of Trees

    11. No Access

      Book Chapter

      Pages 101-112

      Moving Vertices to Make Drawings Plane

    12. No Access

      Book Chapter

      Pages 113-124

      Point-Set Embedding of Trees with Edge Constraints

    13. No Access

      Book Chapter

      Pages 125-136

      Representation of Planar Hypergraphs by Contacts of Triangles

    14. No Access

      Book Chapter

      Pages 137-158

      The Complexity of Several Realizability Problems for Abstract Topological Graphs

    15. No Access

      Book Chapter

      Pages 159-170

      Efficient Extraction of Multiple Kuratowski Subdivisions

    16. No Access

      Book Chapter

      Pages 171-182

      Cover Contact Graphs

    17. No Access

      Book Chapter

      Pages 183-194

      Matched Drawings of Planar Graphs

    18. No Access

      Book Chapter

      Pages 195-206

      Maximum Upward Planar Subgraphs of Embedded Planar Digraphs

previous Page of 2