| Invited talk | |
| 9:00 - 10:00 | J. Matousek: The Anatomy of a Geometric Algorithm |
| 10:00 - 10:30 | coffee break |
| Orthogonality I : | |
| 10:30 - 10:55 | Turn-Regularity and Planar Orthogonal Drawings |
| S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia and L. Vismara | |
| 10:55 - 11:20 | Combining Graph Labeling and Compaction |
| Gunnar W. Klau and Petra Mutzel | |
| 11:20 - 11:45 | Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time |
| Ashim Garg and Giuseppe Liotta | |
| 11:45 - 12:10 | Fully Dynamic 3-Dimensional Orthogonal Graph Drawing |
| M. Closson, S. Gartshore, J. Johansen, S.K. Wismath | |
| 12:10 | lunch |
| Levels I : | |
| 14:00 - 14:25 | An E LOG E Line Crossing Algorithm for Leveled Graphs |
| Vance Waddle and Ashok Malhotra | |
| 14:25 - 14:50 | Level Planar Embedding in Linear Time |
| Michael Jünger and Sebastian Leipert | |
| Clusters I : | |
| 14:50 - 15:10 | Higres - Visualization System for Clustered Graphs and Graph Algorithms (demo) |
| Ivan A. Lisitsyn and Victor N. Kasyanov | |
| 15:10 - 15:30 | Partitioning Approach to Visualization of Large Networks (demo) |
| V. Batagelj, A. Mrvar, M. Zaversnik | |
| 15:30 - 15:50 | Graph Clustering Using Distance-k Cliques (demo) |
| J. Edachery, A. Sen, F. J. Brandenburg | |
| 15:50 - 16:20 | coffee break |
| Drawing I : | |
| 16:20 - 16:45 | A Framework for Circular Drawings of Networks |
| Janet M. Six and Ioannis G. Tollis | |
| 16:45 - 17:10 | Drawing Planar Graphs with Circular Arcs |
| C. C. Cheng, C. A. Duncan, M. T. Goodrich and S. G. Kobourov | |
| 17:10 - 17:35 | Drawing graphs in the hyperbolic plane |
| Bojan Mohar |
| Invited talk | |
| 9:00 - 10:00 | R. Thomas: Graph Planarity and Related Topics |
| 10:00 - 10:30 | coffee break |
| Planarity : | |
| 10:30 - 10:55 | Grid Drawings of Four-Connected Plane Graphs |
| K. Miura, S. Nakano and T. Nishizeki | |
| 10:55 - 11:20 | Graph Embedding with Topological Cycle-Constraints |
| Christoph Dornheim | |
| 11:20 - 11:45 | Embedding Vertices at Points: Few Bends suffice for Planar Graphs |
| Michael Kaufmann and Roland Wiese | |
| 11:45 - 12:10 | The Constrained Crossing Minimization Problem |
| Petra Mutzel and Thomas Ziegler | |
| 12:10 | lunch |
| Clusters II : | |
| 14:00 - 14:25 | Planarity-Preserving Clustering and Embedding for Large Planar Graphs |
| C.A. Duncan, M.T. Goodrich, S.G. Kobourov | |
| 14:25 - 14:45 | An Algorithm for Drawing Compound Graphs |
| François Bertault and Mirka Miller | |
| Levels II : | |
| 14:45 - 15:10 | The Vertex-Exchange Graph: a New Tool for Multi-Level Crossing Minimization |
| Patrick Healy and Ago Kuusik | |
| 15:10 - 15:30 | Using Sifting For k-Layer Straightline Crossing Minimization |
| C. Matuszewski, R. Schönfeld, P. Molitor | |
| 15:30 - 15:55 | On 3-Layer Crossings and Pseudo Arrangements |
| Farhad Shahrokhi and Imrich Vrto | |
| 15:55 - 16:25 | coffee break |
| Applications : | |
| 16:25 - 16:45 | Visualizing Algorithms for the Design and Analysis of Survivable Networks (demo) |
| Ala Eddine Barouni, Ali Jaoua and Nejib Zaguia | |
| 16:45 - 17:05 | LayoutShow: a Signed Applet/Application for Graph Drawing and Experimentation (demo) |
| Lila Behzadi | |
| 17:05 - 17:25 | Centrality in Policy Network Drawings (demo) |
| Ulrik Brandes, Patrick Kenis and Dorothea Wagner | |
| 17:25 - 17:45 | Straight-Line Drawings of Protein Interactions (demo) |
| Wojciech Basalaj and Karen Eilbeck |
| Invited talk | |
| 9:00 - 10:00 | J. Nesetril: Art of Drawing |
| 10:00 - 10:30 | coffee break |
| Symmetry : | |
| 10:30 - 10:55 | An Heuristic for Graph Symmetry Detection |
| Hubert de Fraysseix | |
| 10:55 - 11:20 | Isomorphic Subgraphs |
| Sabine Bachl | |
| Orthogonality : | |
| 11:20 - 11:45 | Orthogonal and Quasi-Upward Drawings with Vertices of Arbitrary Size |
| G. Di Battista, W. Didimo, M. Patrignani, M. Pizzonia | |
| 11:45 - 12:10 | Multi-Dimensional Orthogonal Graph Drawing with Small Boxes |
| David R. Wood | |
| 12:10 | lunch |
| Representations : | |
| 14:00 - 14:25 | Geometric Realization of Simplicial Complexes |
| Patrice Ossona de Mendez | |
| 14:25 - 14:45 | Visibility Representations of Complete Graphs |
| R. Babilon, H. Nyklová, O. Pangrác and J. Vondrák | |
| 14:45 - 15:10 | Triangle-Free Planar Graphs as Segment Intersection Graphs |
| N. de Castro, F. J Cobos, J.C. Dana, A. Márquez and M. Noy | |
| Drawing II : | |
| 15:10 - 15:30 | A Force-Directed Algorithm that Preserves Edge Crossing Properties |
| François Bertault | |
| 15:30 - 15:50 | Two Extensions to Force-directed Placement for General Graphs (demo) |
| X. Tang, M. Sherwood-Smith, D.-W. Sun and H. Wu | |
| 15:50 - 16:20 | coffee break |
| Proximity and trees : | |
| 16:20 - 16:45 | Rectangle of Influence Drawings of Graphs without Filled 3-Cycles |
| Therese Biedl, Anna Bretscher and Henk Meijer | |
| 16:45 - 17:10 | Voronoi Drawings of Trees |
| Giuseppe Liotta and Henk Meijer | |
| 17:10 - 17:35 | Infinite Trees and the Future |
| C. Demetrescu, G. Di Battista, I. Finocchi, G. Liotta, M. Patrignani, M. Pizzonia | |
| 17:35 - 17:55 | Latour - a Tree Visualisation System (demo) |
| I. Herman, G. Melançon, M.M. de Ruiter and M. Delest |