Graph Drawing 2007



Program


Sunday, September 23, 2007
17:00 - 19:00 Welcome Reception and Registration
Monday, September 24, 2007
9:00 - 9:10 Opening
9:10 - 10:40 Session 1 Chair: Hubert de Fraysseix
9:10 - 9:35 Crossing Number of Graphs with Rotation Systems (Michael J. Pelsmajer, Marcus Schaefer and Daniel Stefankovic.)
9:35 - 10:00 A bipartite strengthening of the Crossing Lemma (Jacob Fox, Janos Pach and Csaba Toth.)
10:00 - 10:20 Short Paper: Improvement on the decay of crossing numbers (Jan Kyncl, Jakub Cerny and Geza Toth.)
10:20 - 10:40 Short Paper: Crossing Numbers and Parameterized Complexity (Michael J. Pelsmajer, Marcus Schaefer and Daniel Stefankovic.)
10:40 - 11:10 Morning Tea
11:10 - 12:40 Session 2 Chair: Giuseppe di Battista
11:10 - 11:35 Characterization of Unlabeled Level Planar Graphs (J. Joseph Fowler and Stephen Kobourov.)
11:35 - 12:00 Cyclic Level Planarity Testing and Embedding (Extended Abstract) (Christian Bachmaier, Wolfgang Brunner and Christof Koenig.)
12:00 - 12:20 Short Paper: Practical Level Planarity Testing and Layout with Embedding Constraints (Martin Harrigan and Patrick Healy.)
12:20 - 12:40 Short Paper: Minimum Level Nonplanar Patterns for Trees (J. Joseph Fowler and Stephen Kobourov.)
12:40 - 14:00 Lunch
14:00 - 15:00 Invited Talk I Chair: Seok-Hee Hong
Computing Symmetries of Combinatorial Objects, Brendan D. McKay (Australian National University)
15:00 - 15:30 Afternoon Tea
15:30 - 17:10 Session 3 Chair: Roberto Tamassia
15:30 - 15:55 Straight-Line Orthogonal Drawings of Binary and Ternary Trees (Fabrizio Frati.)
15:55 - 16:20 Polynomial Area Bounds for MST embeddings of trees (Michael Kaufmann.)
16:20 - 16:45 Moving Vertices to Make Drawings Plane (Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin and Alexander Wolff.)
16:45 - 17:10 Point-Set Embedding of Trees with Edge Constraints (Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer and Stephen Wismath.)
17:30 - 19:00 Graph Drawing Contest
Tuesday, September 25, 2007
9:00 - 10:40 Session 4 Chair: Ioannis G. Tollis
9:00 - 9:25 Representation of Planar Hypergraphs by Contacts of Triangles (Hubert de Fraysseix, Patrice Ossona de Mendez and Pierre Rosenstiehl.)
9:25 - 9:50 The complexity of several realizability problems for abstract topological graphs (Jan Kyncl.)
9:50 - 10:15 Efficient Extraction of Multiple Kuratowski Subdivisions (Markus Chimani, Petra Mutzel and Jens M. Schmidt.)
10:15 - 10:40 Cover Contact Graphs (Nieves Atienza, Natalia de Castro, Carmen Cortes, M. Angeles Garrido, Clara Grima, Gregorio Hernandez, Alberto Marquez, Auxiliadora Moreno, Martin Nollenburg, Jose Ra. Portillo, Pedro Reyes, Jesus Valenzuela, Ma Trinidad Villar and Alexander Wolff. )
10:40 - 11:10 Morning Tea
11:10 - 12:40 Session 5 Chair: Franz. J. Brandenburg
11:10 - 11:35 Matched Drawings of Planar Graphs (Emilio Di Giacomo, Walter Didimo, Marc van Kreveld, Giuseppe Liotta and Bettina Speckmann.)
11:35 - 12:00 Maximum Upward Planar Subgraphs of Embedded Planar Digraphs (Carla Binucci, Walter Didimo and Francesco Giordano.)
12:00 - 12:20 Short Paper: Minimizing the Area for Planar Straight-Line Grid Drawings (Marcus Krug and Dorothea Wagner.)
12:20 - 12:40 Short Paper: On planar polyline drawings (Huaming Zhang and Sadish Sadasivam.)
12:40 - 14:00 Lunch
14:00 - 15:00 Invited Talk II Chair: Takao Nishizeki
Large-Scale Graphics: Digital Nature and Laser Projection, Norishige Chiba (Iwate University, Japan)
15:00 - 15:30 Afternoon Tea
15:30 - 17:10 Session 6 Chair: Giuseppe Liotta
15:30 - 15:55 Constrained Stress Majorization Using Diagonally Scaled Gradient Projection (Tim Dwyer and Kim Marriott.)
15:55 - 16:20 Line Crossing Minimization on Metro Maps (Michael Bekos, Michael Kaufmann, Katerina Potika and Antonios Symvonis.)
16:20 - 16:45 Algorithms for Multi-Criteria One-Sided Boundary Labeling (Marc Benkert, Herman Haverkort, Moritz Kroll and Martin Nollenburg.)
16:45 - 17:10 Multi-Circular Layout of Micro/Macro Graphs (Michael Baur and Ulrik Brandes.)
19:00 - 23:00 Conference Dinner
Wednesday, September 26, 2007
9:00 - 10:40 Session 7 Chair: Hsu-Chun Yen
9:00 - 9:25 Constrained Simultaneous and Near-Simultaneous Embeddings (Fabrizio Frati, Michael Kaufmann and Stephen Kobourov.)
9:25 - 9:50 Simultaneous Geometric Graph Embeddings (Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Juenger, Merijam Percan, Marcus Schaefer and Michael Schulz. )
9:50 - 10:15 Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces (Giuseppe Di Battista and Fabrizio Frati.)
10:15 - 10:40 Clustered Planarity: Small Clusters in Eulerian Graphs(Eva Jelinkova, Jan Kara, Jan Kratochvil, Marin Pergel, Ondrej Suchy and Tomas Vyskocil. )
10:40 - 11:10 Morning Tea
11:10 - 12:40 Session 8 Chair: Dorothea Wagner
11:10 - 11:35 Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge (Emilio Di Giacomo, Giuseppe Liotta and Francesco Trotta.)
11:35 - 12:00 Colorability in Orthogonal Graph Drawing (Jan Stola.)
12:00 - 12:20 Short Paper: A Note on Minimum-Area Straight-line Drawings of Planar Graphs (Fabrizio Frati and Maurizio Patrignani.)
12:20 - 12:40 Short Paper: Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices (Hazel Everett, Lazard Sylvain, Giuseppe Liotta and Steve Wismath.)
12:40 - 14:00 Lunch
14:00 - 15:35 Session 9 Chair: Emden R. Gansner
14:00 - 14:25 LunarVis -- Analytic Visualizations of Large Graphs (Robert Gorke, Marco Gaertler and Dorothea Wagner.)
14:25 - 14:50 Visualizing Internet Evolution on the Autonomous Systems Level (Krists Boitmanis, Ulrik Brandes and Christian Pich.)
14:50 - 15:15 Treemaps for Directed Acyclic Graphs (Vassilis Tsiaras, Sofia Triantafilou and Ioannis G. Tollis.)
15:15 - 15:35 Short Paper: Drawing graphs with GLEE (Lev Nachmanson, George Robertson and Bongshin Lee.)
15:35 - 15:45 Closing Remarks
15:45 - 16:15 Afternoon Tea