Graph Drawing

1. Papers

   1. Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs

      • Fabrizio Frati

      Pages 220-225

   2. A Computational Approach to Conway’s Thrackle Conjecture

      • Radoslav Fulek, János Pach

      Pages 226-237

   3. Optimal k-Level Planarization and Crossing Minimization

      • Graeme Gange, Peter J. Stuckey, Kim Marriott

      Pages 238-249

   4. On Touching Triangle Graphs

      • Emden R. Gansner, Yifan Hu, Stephen G. Kobourov

      Pages 250-261

   5. Triangle Contact Representations and Duality

      • Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou

      Pages 262-273

   6. On Maximum Differential Graph Coloring

      • Yifan Hu, Stephen Kobourov, Sankar Veeramoni

      Pages 274-286

   7. Dot Product Representations of Planar Graphs

      • Ross J. Kang, Tobias Müller

      Pages 287-292

   8. Drawing Planar Graphs of Bounded Degree with Few Slopes

      • Balázs Keszegh, János Pach, Dömötör Pálvölgyi

      Pages 293-304

   9. Complexity of Finding Non-Planar Rectilinear Drawings of Graphs

      • Ján Maňuch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk

      Pages 305-316

   10. Point-Set Embeddings of Plane 3-Trees

       • Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur Rahman

       Pages 317-328

   11. Improving Layered Graph Layouts with Edge Bundling

       • Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann

       Pages 329-340

   12. Confluent Drawing Algorithms Using Rectangular Dualization

       • Gianluca Quercini, Massimo Ancona

       Pages 341-352

   13. How to Draw a Tait-Colorable Graph

       • David A. Richter

       Pages 353-364

   14. Universal Pointsets for 2-Coloured Trees

       • Mereke van Garderen, Giuseppe Liotta, Henk Meijer

       Pages 365-370

   15. The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs

       • Marc van Kreveld

       Pages 371-376

   16. Convex Polygon Intersection Graphs

       • Erik Jan van Leeuwen, Jan van Leeuwen

       Pages 377-388

2. Posters

   1. GraphML-Based Exploration and Evaluation of Efficient Parallelization Alternatives for Automation Firmware

      • Jürgen Bregenzer

      Pages 389-390

   2. Automatic Generation of Route Sketches

      • Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter

      Pages 391-392

   3. Visualizing Differences between Two Large Graphs

      • Markus Geyer, Michael Kaufmann, Robert Krug

      Pages 393-394

   4. Placing Edge Labels by Modifying an Orthogonal Graph Drawing

      • Konstantinos G. Kakoulis, Ioannis G. Tollis

      Pages 395-396

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.

• 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

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

  Ulrik Brandes, Sabine Cornelsen

Policies and ethics