17th International Symposium on

Graph Drawing

September 22–25, 2009 - Chicago
GD 2009 logo

Program

Hyperlinked pdf version with abstracts:

Tuesday, 22 September 2009

18:00 - 20:30 Reception and Registration at Park Grill in Millenium Park

Wednesday, 23 September 2009

9:00 - 9:10 Opening
9:10 - 10:20 Session 1 Chair: Christian Duncan
9:10 - 9:35 Drawing Hamiltonian Cycles with No Large Angles - Adrian Dumitrescu, János Pach and Geza Toth
9:35 - 9:55 Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta and Henk Meijer
9:55 - 10:20 On the Perspectives Opened by Right Angle Crossing Drawings - Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann and Antonios Symvonis
10:20 - 10:45 Break
10:45 - 12:00 Session 2 Chair: Beppe Liotta
10:45 - 11:10 Drawing 3-Polytopes with Good Vertex Resolution - André Schulz
11:10 - 11:35 Planar Drawings of Higher-Genus Graphs - Christian Duncan, Michael Goodrich and Stephen Kobourov
11:35 - 12:00 Splitting Clusters To Get C-Planarity - Patrizio Angelini, Fabrizio Frati and Maurizio Patrignani
12:00 - 13:30 Lunch
13:30 - 14:30 Invited Talk I
Sponsored by: DePaul University
Why are String Graphs so Beautiful? - János Pach (EPFL Lausanne, Rényi Inst. Budapest)
14:30 - 14:55 Break
14:55 - 16:35 Session 3 Chair: Franz Brandenburg
14:55 - 15:20 On the Characterization of Level Planar Trees by Minimal Patterns - Alejandro Estrella-Balderrama, J. Joseph Fowler and Stephen Kobourov
15:20 - 15:45 Characterization of Unlabeled Radial Level Planar Graphs - J. Joseph Fowler
15:45 - 16:10 Upward Planarization Layout - Markus Chimani, Carsten Gutwenger, Petra Mutzel and Hoi-Ming Wong
16:10 - 16:35 More Flexible Radial Layout - Ulrik Brandes and Christian Pich
16:35 - 17:00 Poster Review
17:00 - 20:00 Graph Drawing Contest

Thursday, 24 September 2009

9:00 - 10:40 Session 4 Chair: Yifan Hu
9:00 - 9:25 WiGis: A Framework for Web-based Interactive Graph Visualizations - Brynjar Gretarsson, Svetlin Bostandjiev, John O'Donovan and Tobias Hollerer
9:25 - 9:50 Port Constraints in Hierarchical Layout of Data Flow Diagrams - Miro Spnemann, Hauke Fuhrmann, Reinhard von Hanxleden and Petra Mutzel
9:50 - 10:15 Fast Edge-Routing for Large Graphs - Tim Dwyer and Lev Nachmanson
10:15 - 10:40 Leftist Canonical Ordering - Melanie Badent, Michael Baur, Ulrik Brandes and Sabine Cornelsen
10:40 - 11:05 Break
11:05 - 12:35 Session 5 Chair: Erin Chambers
11:05 - 11:30 Succinct Greedy Drawings Do Not Always Exist - Patrizio Angelini, Giuseppe Di Battista and Fabrizio Frati
11:30 - 11:55 Geometric Simultaneous Embeddings of a Graph and a Matching - Sergio Cabello, Marc van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann and Kevin Verbeek
11:55 - 12:15 Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs - Ioannis Emiris, Elias Tsigaridas and Antonios Varvitsiotis
12:15 - 12:35 Removing Independently Even Crossings - Michael Pelsmajer, Marcus Schaefer and Daniel Stefankovic
12:35 - 14:00 Lunch
14:00 - 15:15 Session 6 Chair: Therese Biedl
14:00 - 14:25 Geodesic Embedding of Planar Graphs - Bastian Katz, Marcus Krug, Ignaz Rutter and Alexander Wolff
14:25 - 14:50 Orthogonal Connector Routing - Michael Wybrow, Kim Marriott and Peter J. Stuckey
14:50 - 15:15 On Rectilinear Drawing of Graphs - Peter Eades, Seok-Hee Hong and Sheung-Hung Poon
15:15 - 15:45 Break
15:45 - 17:00 Session 7 Chair: Ioannis Tollis
Sponsored by: Tom Sawyer Software
15:45 - 16:10 Semi-Bipartite Graph Visualization for Gene Ontology Networks - Kai Xu, Seok-Hee Hong, Rohan Williams, Qing Liu and Ji Zhang
16:10 - 16:35 On Open Problems in Biological Network Visualization - Mario Albrecht, Andreas Kerren, Karsten Klein, Oliver Kohlbacher, Petra Mutzel, Wolfgang Paul, Falk Schreiber and Michael Wybrow
16:35 - 17:00 A Novel Grid-based Visualization Approach for Metabolic Networks with Advanced Focus & Context View - Markus Rohrschneider, Christian Heine, Andre Reichenbach, Andreas Kerren and Gerik Scheuermann
18:00 - 21:00 Conference Dinner

Friday, 25 September 2009

9:00 - 10:35 Session 8 Chair: Roberto Tamassia
9:00 - 9:25 On Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs - Therese Biedl
9:25 - 9:50 Drawing Trees in a Streaming Model - Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis and Katharina Zweig
9:50 - 10:15 The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree - Vít Jelínek, Eva Jelinkova, Jan Kratochvil, Bernard Lidicky, Marek Tesar and TomᚠVyskocil
10:15 - 10:35 Drawing Planar 3-trees with Given Face-Areas - Therese Biedl and Lesvia Elena Ruiz Velasquez
10:35 - 11:00 Break
11:00 - 12:00 Invited Talk II
Sponsored by: AT&T
The Art of Cheating when Drawing a Graph - Martin Wattenberg (IBM Watson Research)
12:00 - 13:30 Lunch
13:30 - 15:10 Session 9 Chair: Sue Whitesides
13:30 - 13:55 3D Visibility Representations by Regular Polygons - Jan Stola
13:55 - 14:20 Complexity of Some Geometric and Topological Problems - Marcus Schaefer
14:20 - 14:45 On Planar Supports for Hypergraphs - Kevin Buchin, Marc van Kreveld, Henk Meijer, Bettina Speckmann and Kevin Verbeek
14:45 - 15:10 DAGmaps and ε-Visibility Representation of DAGs - Vassilis Tsiaras and Ioannis Tollis
15:10 - 15:35 Break
15:35 - 16:50 Session 10 Chair: Graham Wills
15:35 - 16:00 Drawing Directed Graphs Clockwise - Christian Pich
16:00 - 16:25 An Improved Algorithm for the Metro-Line Crossing Minimization Problem - Martin Nöllenburg
16:25 - 16:60 Layout with Circular and Other Non-Linear Constraints using Procrustes Projection - Tim Dwyer and George Robertson
16:50 - 17:00 Closing Remarks

Gold Sponsors

 AT&T

 Tom Sawyer Software

 DePaul CDM

Silver Sponsors

 DePaul CDM

 IIT College of Science and Letters

 ILOG An IBM Company