|
Monday, September 12 |
|
|
|
|
|
08:30 |
Conference Opening |
|
Tuesday, September 13 |
|
Wednesday, September 14 |
|
09:00 |
Invited talk |
|
09:00 |
Invited talk |
|
09:00 |
Non-Planar Core Reduction of Graphs by Carsten Gutwenger, Markus
Chimani |
|
00:00 |
Certifying Algorithms by Kurt Mehlhorn,
Max-Plank-Institut für Informatik |
|
00:00 |
Hierarchy Visualization: From Research to Practice
by George Robertson, Microsoft Research |
|
09:25 |
Graph Treewidth and Geometric Thickness Parameters by Vida Dujmović,
David R. Wood |
|
10:00 |
Crossing number of toroidal graphs by János Pach, Geza Toth |
|
10:00 |
C-Planarity of Extrovert Clustered Graphs by Michael T. Goodrich,
George S. Lueker, Jonathan Z. Sun |
|
09:50 |
Odd Crossing Number Is Not Crossing Number by Michael J. Pelsmajer,
Marcus Schaefer, Daniel Stefankovic |
|
10:25 |
Exact Crossing Minimization by Christoph Buchheim, Dietmar Ebner,
Michael Jünger, Gunnar W. Klau, Petra Mutzel, Rene Weiskircher |
|
10:25 |
On Embedding a Cycle in a Plane Graph by Pier Francesco Cortese,
Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia |
|
10:15 |
On edges crossing few other edges in simple topological complete graphs
by Jan Kynčl, Pavel Valtr |
|
10:50 |
Morning Coffee |
|
10:50 |
Morning Coffee |
|
10:40 |
Morning Coffee |
|
11:20 |
Hierarchical Layouts of Directed Graphs in Three Dimensions by
Seok-Hee Hong, Nikola S. Nikolov |
|
11:20 |
Delta-confluent Drawings by David Eppstein, Michael T. Goodrich,
Jeremy Y. Meng |
|
11:10 |
Proper and Planar Drawings of Graphs on Three Layers by Matthew
Suderman |
|
11:45 |
Volume Requirements of 3D Upward Drawings by Emilio Di Giacomo,
Giuseppe Liotta, Henk Meijer, Stephen K Wismath |
|
11:45 |
Small Area Drawings of Outerplanar Graphs by Giuseppe Di Battista,
Fabrizio Frati |
|
11:35 |
Convex Drawings of Plane Graphs of Minimum Outer Apices by Kazuyuki
Miura, Machiko Azuma, Takao Nishizeki |
|
12:10 |
Complexity Results for Three-dimensional Orthogonal Graph Drawing by
Maurizio Patrignani |
|
12:10 |
Morphing Planar Graphs While Preserving Edge Directions by Therese
Biedl, Anna Lubiw, Michael Spriggs |
|
12:00 |
Upward Spirality and Upward Planarity Testing by Walter Didimo,
Francesco Giordano, Giuseppe Liotta |
|
12:35 |
Drawing Kn in Three Dimensions with One Bend per Edge
by Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva,
Stephen Wismath (short paper) |
|
12:35 |
Applications of Parameterized st-Orientations in Graph Drawing
Algorithms by Charalampos Papamanthou, Ioannis G. Tollis |
|
12:25 |
Transversal structures on triangulations, with application to
straight-line drawing by Éric Fusy |
|
12:50 |
Lunch |
|
13:00 |
Lunch |
|
12:50 |
Lunch |
|
14:00 |
No-Bend Orthogonal Drawings of Series-Parallel Graphs by Md. Saidur
Rahman, Noritsugu Egi, Takao Nishizeki |
|
14:30 |
Energy-Based Clustering of Graphs with Nonuniform Degrees by Andreas
Noack |
|
14:20 |
Two trees which are self-intersecting when drawn simultaneously by
Michael Kaufmann, Imrich Vrt'o, Markus Geyer |
|
14:25 |
On Rectilinear Duals for Vertex-Weighted Plane Graphs by Mark de
Berg, Elena Mumford, Bettina Speckmann |
|
14:55 |
Drawing Graphs using Modular Decomposition by Charis Papadopoulos,
Constantinos Voglis |
|
14:45 |
A Mixed-Integer Program for Drawing High-Quality Metro Maps by
Martin Nöllenburg, Alexander Wolff |
|
14:50 |
An Application of Well-Orderly Trees in Graph Drawing by Huaming
Zhang, Xin He |
|
15:20 |
Dynamic Spectral Layout of Small Worlds by Ulrik Brandes, Daniel
Fleischer, Thomas Puppe |
|
15:10 |
Fast Node Overlap Removal by Tim Dwyer, Kim Marriott, Peter Stuckey |
|
15:15 |
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic
Number, and Thickness by Alice M. Dean, William Evans, Ellen Gethner,
Joshua D. Laison, Mohammad Ali Safari, William T. Trotter |
|
15:45 |
Stress Majorization with Orthogonal Ordering Constraints by Tim
Dwyer, Yehuda Koren, Kim Marriott |
|
15:35 |
Incremental Connector Routing by Michael Wybrow, Kim Marriott, Peter
J. Stuckey |
|
15:40 |
Afternoon Tea |
|
16:10 |
Afternoon Tea |
|
16:00 |
Afternoon Tea |
|
16:10 |
A Hybrid Model for Drawing Dynamic and Evoling Graphs by Marco
Gaertler, Dorothea Wagner |
|
16:40 |
On Balloon Drawings of Rooted Trees by Chun-Cheng Lin, Hsu-Chun Yen |
|
16:30 |
Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar
Graphs by Ileana Streinu |
|
16:35 |
Drawing Clustered Graphs in Three Dimensions by Joshua Ho, Seok-Hee
Hong |
|
17:05 |
Layout effects on sociogram perception by Weidong Huang, Seok-Hee
Hong, Peter Eades |
|
16:55 |
Crossings and Permutations by Therese Biedl, Franz J. Brandenburg,
Xiaotie Deng |
|
17:00 |
GEOMI: GEOmetry for Maximum Insight by
Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu, Joshua
Ho, Seok-Hee Hong, Dirk Koschützki, Colin Murray, Nikola S. Nikolov, Ronnie
Taib, Alexandre Tarassov, and Kai Xu |
|
17:30 |
Minimum Depth Graph Embeddings and Quality of the Drawings: an
Experimental Analysis by Maurizio Pizzonia |
|
17:20 |
How to Embed a Path onto Two Sets of Points by Emilio Di Giacomo,
Giuseppe Liotta, Francesco Trotta (short paper) |
|
17:25 |
WhatsOnWeb: Using Graph Drawing to Search the Web by Emilio Di
Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta |
|
17:55 |
An Experimental Comparison of Fast Algorithms for Drawing General Large
Graphs by Stefan Hachul, Michael Jünger |
|
17:35 |
On Extending a Partial Straight-Line Drawing by Maurizio Patrignani
(short paper) |
|
17:50 |
Demo time |
|
18:20 |
Bus to dinner |
|
17:50 |
Close |
Final Program Brochure