18th Intl. Symp. Graph Drawing U Konstanz



Call for Papers
Important Dates




proGD Satellite Event
GD Challenge
Invited Speakers


Conference Venue
City of Konstanz
Things To Do


You may want to download the final program (in pdf) and the booklet of abstracts (in pdf).

Both the satellite event, proGD, and the main conference will be held in room A703 on campus of the University of Konstanz.

overview Tue, Sep 21 Wed, Sep 22 Thu, Sep 23 Fri, Sep 24
9:00-10:30 tutorial invited talk session session
10:30-11:00 coffee break
11:00-12:15 tutorial session session session
12:30-14:00 lunch
14:00-15:30 tutorial session session session
15:30-16:00 coffee break
16:00-17:15 guided tours session session invited talk
later reception GD challenge conference dinner  

Tuesday, September 21

9:00-17:30proGD 2010
from 18:00Reception and concert in K9 Paulskirche (downtown Konstanz)

Wednesday, September 22

9:00-10:30Welcome and invited talk
Ulrich Rüdiger, Rector of the University of Konstanz. Welcome Address.
Carsten Thomassen. Graph Decomposition.
 Coffee break
11:00-12:15yWorks Session
Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, and Maurizio Patrignani. Monotone Drawings of Graphs.
Christian Duncan, David Eppstein, Michael Goodrich, Stephen Kobourov, and Martin Nöllenburg. Lombardi Drawings of Graphs.
David Richter. How to draw a Tait-colored graph.
12:15-12:30Poster plugs
Giordano Da Lozzo, Giuseppe Di Battista, and Francesco Ingrassia. Drawing Graphs on a Smartphone.
Eyal Ackerman, Radoslav Fulek, and Csaba D. Tóth. On the size of graphs that admit polyline drawings with few bends and crossing angles.
Radoslav Fulek and Janos Pach. A computational approach to Conway's thrackle conjecture.
Marc van Kreveld. The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs.
 Coffee break
Wolfgang Brunner and Marco Matzeder. Drawing Ordered (k-1)-ary Trees on k-Grids.
Christian Duncan, David Eppstein, Michael Goodrich, Stephen Kobourov, and Martin Nöllenburg. Drawing Trees with Perfect Angular Resolution and Polynomial Area.
David Eppstein, Maarten Löffler, Elena Mumford, and Martin Nöllenburg. Optimal 3D Angular Resolution for Low-Degree Graphs.
18:00-19:30GD Challenge

Thursday, September 23

Daniel Archambault, Helen C. Purchase and Bruno Pinaud. Difference Map Readability for Dynamic Graphs.
Karsten Klein, Gereon Bartel, Carsten Gutwenger, and Petra Mutzel. An Experimental Evaluation of Multilevel Layout Methods.
Walter Didimo, Giuseppe Liotta, and Salvatore Agostino Romeo. Topology-driven Force-directed Algorithms.
Evmorfia Argyriou, Michael Bekos, and Antonios Symvonis. Maximizing the Total Resolution of Graphs.
 Coffee break
Lev Nachmanson, Sergey Pupyrev, and Michael Kaufmann. Improving Layered Graph Layouts with Edge Bundling.
Graeme Gange, Peter Stuckey, and Kim Marriott. Optimal k-level Planarization and Crossing Minimization.
Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, and Hoi-Ming Wong. Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints.
12:15-12:30Poster plugs
Daniel Gonçalves, Benjamin Leveque, and Alexandre Pinlou. Triangle contact representations and duality.
Emden Gansner, Yifan Hu, and Stephen Kobourov. On Touching Triangle Graphs.
Erik Jan van Leeuwen and Jan van Leeuwen. Convex Polygon Intersection Graphs.
Vida Dujmovic, William Evans, Stephen Kobourov, Giuseppe Liotta, Christophe Weibel, and Stephen Wismath. On Graphs Supported by Line Sets.
 Coffee break
Kevin Buchin, Bettina Speckmann, and Sander Verdonschot. Optimizing Regular Edge Labelings.
Gianluca Vittorio Quercini and Massimo Ancona. Confluent Drawing Algorithms using Rectangular Dualization.
Yifan Hu, Stephen Kobourov, and Sankar Veeramoni. On Maximum Differential Graph Coloring.
 Conference dinner in Die Bleiche (bus transfer)

Friday, September 24

Rahnuma Islam Nishat, Debajyoti Mondal, and Md. Saidur Rahman. Point-Set Embeddings of Plane 3-Trees.
Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze and Antonios Symvonis. Upward Geometric Graph Embeddings into Point Sets.
Patrizio Angelini, Markus Geyer, Michael Kaufmann, and Daniel Neuwirth. On a Tree and a Path with no Geometric Simultaneous Embedding.
Mereke van Garderen, Giuseppe Liotta, and Henk Meijer. Universal Pointsets for 2-coloured Trees.
 Coffee break
Jan Manuch, Murray Patterson, Sheung-Hung Poon, and Chris Thachuk. Complexity of Finding Non-Planar Rectilinear Drawings of Graphs.
Thomas Bläsius, Marcus Krug, Ignaz Rutter, and Dorothea Wagner. Drawing Orthogonal Graphs with Flexibility Constraints.
Balázs Keszegh, Dömötör Pálvölgyi, and János Pach. Drawing planar graphs of bounded degree with few slopes.
Christopher Auer, Christian Bachmaier, Franz Josef Brandenburg, Wolfgang Brunner, and Andreas Gleißner. Plane Drawings of Queue and Deque Graphs.
Ross J. Kang and Tobias Müller. Dot-product representations of planar graphs.
Erin Chambers, David Eppstein, Michael Goodrich, and Maarten Löffler. Drawing Graphs in the Plane with  a Prescribed Outer Face and Polynomial Area.
Fabrizio Frati. Improved Lower Bounds on the Area Requirements of  Series-Parallel Graphs.
 Coffee break
16:00-17:15Tom Saywer Software Invited Talk and Farewell
Peter Eades. On the Future of Graph Drawing.

Gold Sponsors

Tom Sawyer Software


Silver Sponsors