Graph Drawing

17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers

Editors:

ISBN: 978-3-642-11804-3 (Print) 978-3-642-11805-0 (Online)

Table of contents (48 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-1

      Why Are String Graphs So Beautiful?

    2. No Access

      Book Chapter

      Pages 2-2

      The Art of Cheating When Drawing a Graph

  3. Papers

    1. No Access

      Book Chapter

      Pages 3-14

      Drawing Hamiltonian Cycles with No Large Angles

    2. No Access

      Book Chapter

      Pages 15-20

      Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings

    3. No Access

      Book Chapter

      Pages 21-32

      On the Perspectives Opened by Right Angle Crossing Drawings

    4. No Access

      Book Chapter

      Pages 33-44

      Drawing 3-Polytopes with Good Vertex Resolution

    5. No Access

      Book Chapter

      Pages 45-56

      Planar Drawings of Higher-Genus Graphs

    6. No Access

      Book Chapter

      Pages 57-68

      Splitting Clusters to Get C-Planarity

    7. No Access

      Book Chapter

      Pages 69-80

      On the Characterization of Level Planar Trees by Minimal Patterns

    8. No Access

      Book Chapter

      Pages 81-93

      Characterization of Unlabeled Radial Level Planar Graphs

    9. No Access

      Book Chapter

      Pages 94-106

      Upward Planarization Layout

    10. No Access

      Book Chapter

      Pages 107-118

      More Flexible Radial Layout

    11. No Access

      Book Chapter

      Pages 119-134

      WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations

    12. No Access

      Book Chapter

      Pages 135-146

      Port Constraints in Hierarchical Layout of Data Flow Diagrams

    13. No Access

      Book Chapter

      Pages 147-158

      Fast Edge-Routing for Large Graphs

    14. No Access

      Book Chapter

      Pages 159-170

      Leftist Canonical Ordering

    15. No Access

      Book Chapter

      Pages 171-182

      Succinct Greedy Drawings Do Not Always Exist

    16. No Access

      Book Chapter

      Pages 183-194

      Geometric Simultaneous Embeddings of a Graph and a Matching

    17. No Access

      Book Chapter

      Pages 195-200

      Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs

    18. No Access

      Book Chapter

      Pages 201-206

      Removing Independently Even Crossings

previous Page of 3