default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGD 2007: Sydney, NSW, Australia
- Seok-Hee Hong, Takao Nishizeki, Wu Quan:
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
Invited Talks
- Brendan D. McKay:
Computing Symmetries of Combinatorial Objects. 1 - Norishige Chiba:
Large-Scale Graphics: Digital Nature and Laser Projection. 2
Papers
- Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
:
Crossing Number of Graphs with Rotation Systems. 3-12 - Jacob Fox, János Pach, Csaba D. Tóth:
A Bipartite Strengthening of the Crossing Lemma. 13-24 - Jakub Cerný, Jan Kyncl, Géza Tóth:
Improvement on the Decay of Crossing Numbers. 25-30 - Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Crossing Numbers and Parameterized Complexity. 31-36 - J. Joseph Fowler, Stephen G. Kobourov:
Characterization of Unlabeled Level Planar Graphs. 37-49 - Christian Bachmaier, Wolfgang Brunner, Christof König:
Cyclic Level Planarity Testing and Embedding. 50-61 - Martin Harrigan, Patrick Healy:
Practical Level Planarity Testing and Layout with Embedding Constraints. 62-68 - J. Joseph Fowler, Stephen G. Kobourov:
Minimum Level Nonplanar Patterns for Trees. 69-75 - Fabrizio Frati:
Straight-Line Orthogonal Drawings of Binary and Ternary Trees. 76-87 - Michael Kaufmann:
Polynomial Area Bounds for MST Embeddings of Trees. 88-100 - Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff:
Moving Vertices to Make Drawings Plane. 101-112 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Point-Set Embedding of Trees with Edge Constraints. 113-124 - Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl:
Representation of Planar Hypergraphs by Contacts of Triangles. 125-136 - Jan Kyncl:
The Complexity of Several Realizability Problems for Abstract Topological Graphs. 137-158 - Markus Chimani, Petra Mutzel, Jens M. Schmidt:
Efficient Extraction of Multiple Kuratowski Subdivisions. 159-170 - Nieves Atienza, Natalia de Castro, Carmen Cortés, María Ángeles Garrido, Clara I. Grima, Carlos G. Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff:
Cover Contact Graphs. 171-182 - Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann:
Matched Drawings of Planar Graphs. 183-194 - Carla Binucci, Walter Didimo, Francesco Giordano:
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs. 195-206 - Marcus Krug, Dorothea Wagner:
Minimizing the Area for Planar Straight-Line Grid Drawings. 207-212 - Huaming Zhang, Sadish Sadasivam:
On Planar Polyline Drawings. 213-218 - Tim Dwyer, Kim Marriott:
Constrained Stress Majorization Using Diagonally Scaled Gradient Projection. 219-230 - Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Line Crossing Minimization on Metro Maps. 231-242 - Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg:
Algorithms for Multi-criteria One-Sided Boundary Labeling. 243-254 - Michael Baur, Ulrik Brandes:
Multi-circular Layout of Micro/Macro Graphs. 255-267 - Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov:
Constrained Simultaneous and Near-Simultaneous Embeddings. 268-279 - Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz:
Simultaneous Geometric Graph Embeddings. 280-290 - Giuseppe Di Battista, Fabrizio Frati:
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. 291-302 - 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 - Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. 315-326 - Jan Stola:
Colorability in Orthogonal Graph Drawing. 327-338 - Fabrizio Frati, Maurizio Patrignani:
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. 339-344 - 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 - Robert Görke, Marco Gaertler, Dorothea Wagner:
LunarVis - Analytic Visualizations of Large Graphs. 352-364 - Krists Boitmanis, Ulrik Brandes, Christian Pich:
Visualizing Internet Evolution on the Autonomous Systems Level. 365-376 - Vassilis Tsiaras, Sofia Triantafilou, Ioannis G. Tollis:
Treemaps for Directed Acyclic Graphs. 377-388 - Lev Nachmanson, George G. Robertson, Bongshin Lee:
Drawing Graphs with GLEE. 389-394
Graph Drawing Contest
- Christian A. Duncan, Stephen G. Kobourov, Georg Sander:
Graph Drawing Contest Report. 395-400
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-04 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
