default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGD 2012: Redmond, WA, USA
- Walter Didimo, Maurizio Patrignani:
Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7704, Springer 2013, ISBN 978-3-642-36762-5
Invited Talks
- Prosenjit Bose
:
Flips. 1 - Ben Shneiderman, Cody Dunne:
Interactive Network Exploration to Derive Insights: Filtering, Clustering, Grouping, and Simplification. 2-18
Papers
- Micha Sharir, Adam Sheffer:
Counting Plane Graphs: Cross-Graph Charging Schemes. 19-30 - Thomas Bläsius, Ignaz Rutter:
Disconnectivity and Relative Positions in Simultaneous Embeddings. 31-42 - Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia:
Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage. 43-54 - Mirza Klimenta, Ulrik Brandes:
Graph Drawing by Classical Multidimensional Scaling: New Perspectives. 55-66 - Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff:
Progress on Partial Edge Drawings. 67-78 - Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista:
Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. 79-89 - Markus Chimani, Karsten Klein:
Shrinking the Search Space for Clustered Planarity. 90-101 - Soroush Alamdari, Therese Biedl:
Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs. 102-113 - Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
The Approximate Rectangle of Influence Drawability Problem. 114-125 - David Eppstein:
Planar Lombardi Drawings for Subcubic Graphs. 126-137 - Michael A. Bekos, Chrysanthi N. Raftopoulou:
Circle-Representations of Simple 4-Regular Planar Graphs. 138-149 - Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis:
Smooth Orthogonal Layouts. 150-161 - Marcus Schaefer:
Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants. 162-173 - Steven Chaplick, Torsten Ueckerdt:
Planar Graphs as VPG-Graphs. 174-186 - David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides:
On Representing Graphs by Touching Cuboids. 187-198 - Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat:
Touching Triangle Representations for 3-Connected Planar Graphs. 199-210 - Md. Jawaherul Alam, Stephen G. Kobourov:
Proportional Contact Representations of 4-Connected Planar Graphs. 211-223 - Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Edge-Weighted Contact Representations of Planar Graphs. 224-235 - Gregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter, Dorothea Wagner:
Column-Based Graph Layouts. 236-247 - Markus Chimani, Robert Zeranski:
Upward Planarity Testing via SAT. 248-259 - Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-approaching Graphs. 260-271 - Kevin Verbeek:
Homotopic $\mathcal{C}$-Oriented Routing. 272-278 - Zahed Rahmati, Sue Whitesides, Valerie King:
Kinetic and Stationary Point-Set Embeddability for Plane Graphs. 279-290 - Fabrizio Frati, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat:
Point-Set Embeddability of 2-Colored Trees. 291-302 - Adrian Dumitrescu, Csaba D. Tóth:
Covering Paths for Planar Point Sets. 303-314 - Martin Balko:
Grid Drawings and the Chromatic Number. 315-326 - Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber:
On the Density of Maximal 1-Planar Graphs. 327-338 - Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). 339-345 - Andres J. Ruiz-Vargas:
Tangles and Degenerate Tangles. 346-351 - Andrew Suk:
Density Theorems for Intersection Graphs of t-Monotone Curves. 352-363 - Gabriel Nivasch, János Pach, Gábor Tardos:
The Visible Perimeter of an Arrangement of Disks. 364-375 - Luca Castelli Aleardi, Olivier Devillers, Éric Fusy:
Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings. 376-387 - J. Joseph Fowler, Stephen G. Kobourov:
Planar Preprocessing for Spring Embedders. 388-399 - Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
StreamEB: Stream Edge Bundling. 400-413 - Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott:
Force-Directed Graph Drawing Using Social Gravity and Scaling. 414-425 - Martin Gronemann, Michael Jünger:
Drawing Clustered Graphs as Topographic Maps. 426-438 - Emden R. Gansner, Yifan Hu, Stephen C. North:
Visualizing Streaming Text Data with Dynamic Graphs and Maps. 439-450 - Helen C. Purchase, John Hamer, Martin Nöllenburg, Stephen G. Kobourov:
On the Usability of Lombardi Graph Drawings. 451-462 - Martin Fink, Herman J. Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff:
Drawing Metro Maps Using Bézier Curves. 463-474 - Daniel Archambault, Helen C. Purchase:
Mental Map Preservation Helps User Orientation in Dynamic Graphs. 475-486 - Arnaud Sallaberry, Chris Muelder, Kwan-Liu Ma:
Clustering, Visualizing, and Navigating for Large Dynamic Graphs. 487-498 - Evgenios M. Kornaropoulos, Ioannis G. Tollis:
DAGView: An Approach for Visualizing Large Graphs. 499-510 - Sandra Bies, Marc J. van Kreveld:
Time-Space Maps from Triangulations. 511-516 - Till Tantau:
Graph Drawing in TikZ. 517-528 - Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Josef Reislhuber:
Optical Graph Recognition. 529-540 - Benjamin Bach, Andre Suslik Spritzer, Evelyne Lutton, Jean-Daniel Fekete:
Interactive Random Graph Generation with Evolutionary Algorithms. 541-552
Posters
- Jan Christoph Athenstädt, Robert Görke, Marcus Krug, Martin Nöllenburg:
Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor. 553-554 - Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer:
On Sparse Maximal 2-Planar Graphs. 555-556 - Christopher Auer, Andreas Gleißner, Kathrin Hanauer, Sebastian Vetter:
Testing Planarity by Switching Trains. 557-558 - Evgenios M. Kornaropoulos, Ioannis G. Tollis:
Weak Dominance Drawings for Directed Acyclic Graphs. 559-560 - Maarten Löffler, Martin Nöllenburg:
Planar Lombardi Drawings of Outerpaths. 561-562 - Khalegh Mamakani, Frank Ruskey:
The First Simple Symmetric 11-Venn Diagram. 563-565 - Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
On the Faithfulness of Graph Visualizations. 566-568 - Michael T. Goodrich, Joseph A. Simons:
More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs. 569-570
Workshop on Theory and Practice of Graph Drawing
- Tim Dwyer, Fabrizio Frati, Seok-Hee Hong, Karsten Klein:
Theory and Practice of Graph Drawing. 571-574
Graph Drawing Contest
- Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. 575-579
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 2025-11-20 00:11 CET 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:
