Graph Drawing 2007
Accepted Papers
Long Papers
- Michael J. Pelsmajer, Marcus Schaefer and Daniel Stefankovic. Crossing Number of Graphs with Rotation Systems
- Hubert de Fraysseix, Patrice Ossona de Mendez and Pierre Rosenstiehl. Representation of Planar Hypergraphs by Contacts of Triangles
- Robert Gorke, Marco Gaertler and Dorothea Wagner. LunarVis -- Analytic Visualizations of Large Graphs
- Tim Dwyer and Kim Marriott. Constrained Stress Majorization Using Diagonally Scaled Gradient Projection
- Jan Kyncl. The complexity of several realizability problems for abstract topological graphs
- Fabrizio Frati. Straight-Line Orthogonal Drawings of Binary and Ternary Trees
- Fabrizio Frati, Michael Kaufmann and Stephen Kobourov. Constrained Simultaneous and Near-Simultaneous Embeddings
- Michael Kaufmann. Polynomial Area Bounds for MST embeddings of trees
- Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Juenger, Merijam Percan, Marcus Schaefer and Michael Schulz. Simultaneous Geometric Graph Embeddings
- Krists Boitmanis, Ulrik Brandes and Christian Pich. Visualizing Internet Evolution on the Autonomous Systems Level
- Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin and Alexander Wolff. Moving Vertices to Make Drawings Plane
- Markus Chimani, Petra Mutzel and Jens M. Schmidt. Efficient Extraction of Multiple Kuratowski Subdivisions
- J. Joseph Fowler and Stephen Kobourov. Characterization of Unlabeled Level Planar Graphs
- Emilio Di Giacomo, Giuseppe Liotta and Francesco Trotta. Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
- Emilio Di Giacomo, Walter Didimo, Marc van Kreveld, Giuseppe Liotta and Bettina Speckmann. Matched Drawings of Planar Graphs
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer and Stephen Wismath. Point-Set Embedding of Trees with Edge Constraints
- Carla Binucci, Walter Didimo and Francesco Giordano. Maximum Upward Planar Subgraphs of Embedded Planar Digraphs
- Michael Bekos, Michael Kaufmann, Katerina Potika and Antonios Symvonis. Line Crossing Minimization on Metro Maps
- 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. Cover Contact Graphs
- Giuseppe Di Battista and Fabrizio Frati. Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Eva Jelinkova, Jan Kara, Jan Kratochvil, Marin Pergel, Ondrej Suchy and Tomas Vyskocil. Clustered Planarity: Small Clusters in Eulerian Graphs
- Vassilis Tsiaras, Sofia Triantafilou and Ioannis G. Tollis. Treemaps for Directed Acyclic Graphs
- Jan Stola. Colorability in Orthogonal Graph Drawing
- marc benkert, Herman Haverkort, Moritz Kroll and Martin Nollenburg. Fast Algorithms for One-Sided Boundary Labeling
- Jacob Fox, Janos Pach and Csaba Toth. A bipartite strengthening of the Crossing Lemma
- Michael Baur and Ulrik Brandes. Multi-Circular Layout of Micro/Macro Graphs
- Christian Bachmaier, Wolfgang Brunner and Christof Koenig. Cyclic Level Planarity Testing and Embedding (Extended Abstract)
Short Papers
- Jan Kyncl, Jakub Cerny and Geza Toth. Improvement on the decay of crossing numbers
- Michael J. Pelsmajer, Marcus Schaefer and Daniel Stefankovic. Crossing Numbers and Parameterized Complexity
- Lev Nachmanson, George Robertson and Bongshin Lee. Drawing graphs with GLEE
- Marcus Krug and Dorothea Wagner. Minimizing the Area for Planar Straight-Line Drawings
- Fabrizio Frati and Maurizio Patrignani. A Note on Minimum-Area Straight-line Drawings of Planar Graphs
- Martin Harrigan and Patrick Healy. Practical Level Planarity Testing and Layout with Embedding Constraints
- J. Joseph Fowler and Stephen Kobourov. Minimum Level Nonplanar Patterns for Trees
- Huaming Zhang and Sadish Sadasivam. On planar polyline drawings
- Hazel Everett, Lazard Sylvain, Giuseppe Liotta and Steve Wismath. Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices