GD 2007:
Sydney,
NSW,
Australia
Seok-Hee Hong, Takao Nishizeki, Wu Quan (Eds.):
Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers.
Lecture Notes in Computer Science 4875 Springer 2008, ISBN 978-3-540-77536-2 BibTeX
Invited Talks
Papers
- Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Crossing Number of Graphs with Rotation Systems.
3-12
Electronic Edition (link) BibTeX
- Jacob Fox, János Pach, Csaba D. Tóth:
A Bipartite Strengthening of the Crossing Lemma.
13-24
Electronic Edition (link) BibTeX
- Jakub Cerný, Jan Kyncl, Géza Tóth:
Improvement on the Decay of Crossing Numbers.
25-30
Electronic Edition (link) BibTeX
- Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Crossing Numbers and Parameterized Complexity.
31-36
Electronic Edition (link) BibTeX
- J. Joseph Fowler, Stephen G. Kobourov:
Characterization of Unlabeled Level Planar Graphs.
37-49
Electronic Edition (link) BibTeX
- Christian Bachmaier, Wolfgang Brunner, Christof König:
Cyclic Level Planarity Testing and Embedding.
50-61
Electronic Edition (link) BibTeX
- Martin Harrigan, Patrick Healy:
Practical Level Planarity Testing and Layout with Embedding Constraints.
62-68
Electronic Edition (link) BibTeX
- J. Joseph Fowler, Stephen G. Kobourov:
Minimum Level Nonplanar Patterns for Trees.
69-75
Electronic Edition (link) BibTeX
- Fabrizio Frati:
Straight-Line Orthogonal Drawings of Binary and Ternary Trees.
76-87
Electronic Edition (link) BibTeX
- Michael Kaufmann:
Polynomial Area Bounds for MST Embeddings of Trees.
88-100
Electronic Edition (link) BibTeX
- Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff:
Moving Vertices to Make Drawings Plane.
101-112
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Point-Set Embedding of Trees with Edge Constraints.
113-124
Electronic Edition (link) BibTeX
- Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl:
Representation of Planar Hypergraphs by Contacts of Triangles.
125-136
Electronic Edition (link) BibTeX
- Jan Kyncl:
The Complexity of Several Realizability Problems for Abstract Topological Graphs.
137-158
Electronic Edition (link) BibTeX
- Markus Chimani, Petra Mutzel, Jens M. Schmidt:
Efficient Extraction of Multiple Kuratowski Subdivisions.
159-170
Electronic Edition (link) BibTeX
- Nieves Atienza, Natalia de Castro, Carmen Cortés, Maria Angeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff:
Cover Contact Graphs.
171-182
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann:
Matched Drawings of Planar Graphs.
183-194
Electronic Edition (link) BibTeX
- Carla Binucci, Walter Didimo, Francesco Giordano:
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs.
195-206
Electronic Edition (link) BibTeX
- Marcus Krug, Dorothea Wagner:
Minimizing the Area for Planar Straight-Line Grid Drawings.
207-212
Electronic Edition (link) BibTeX
- Huaming Zhang, Sadish Sadasivam:
On Planar Polyline Drawings.
213-218
Electronic Edition (link) BibTeX
- Tim Dwyer, Kim Marriott:
Constrained Stress Majorization Using Diagonally Scaled Gradient Projection.
219-230
Electronic Edition (link) BibTeX
- Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Line Crossing Minimization on Metro Maps.
231-242
Electronic Edition (link) BibTeX
- Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg:
Algorithms for Multi-criteria One-Sided Boundary Labeling.
243-254
Electronic Edition (link) BibTeX
- Michael Baur, Ulrik Brandes:
Multi-circular Layout of Micro/Macro Graphs.
255-267
Electronic Edition (link) BibTeX
- Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov:
Constrained Simultaneous and Near-Simultaneous Embeddings.
268-279
Electronic Edition (link) BibTeX
- Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz:
Simultaneous Geometric Graph Embeddings.
280-290
Electronic Edition (link) BibTeX
- Giuseppe Di Battista, Fabrizio Frati:
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.
291-302
Electronic Edition (link) BibTeX
- Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Eulerian Graphs.
303-314
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge.
315-326
Electronic Edition (link) BibTeX
- Jan Stola:
Colorability in Orthogonal Graph Drawing.
327-338
Electronic Edition (link) BibTeX
- Fabrizio Frati, Maurizio Patrignani:
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs.
339-344
Electronic Edition (link) BibTeX
- Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath:
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices.
345-351
Electronic Edition (link) BibTeX
- Robert Görke, Marco Gaertler, Dorothea Wagner:
LunarVis - Analytic Visualizations of Large Graphs.
352-364
Electronic Edition (link) BibTeX
- Krists Boitmanis, Ulrik Brandes, Christian Pich:
Visualizing Internet Evolution on the Autonomous Systems Level.
365-376
Electronic Edition (link) BibTeX
- Vassilis Tsiaras, Sofia Triantafilou, Ioannis G. Tollis:
Treemaps for Directed Acyclic Graphs.
377-388
Electronic Edition (link) BibTeX
- Lev Nachmanson, George G. Robertson, Bongshin Lee:
Drawing Graphs with GLEE.
389-394
Electronic Edition (link) BibTeX
Graph Drawing Contest
Copyright © Wed Aug 20 19:59:15 2008
by Michael Ley (ley@uni-trier.de)
