default search action
GD 2013: Bordeaux, France
- Stephen K. Wismath, Alexander Wolff:
Graph Drawing - 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8242, Springer 2013, ISBN 978-3-319-03840-7
Upward Drawings
- Fabrizio Frati
, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood
On the Upward Planarity of Mixed Plane Graphs. 1-12 - Markus Chimani, Robert Zeranski:
Upward Planarity Testing: A Computational Study. 13-24
Planarity
- Christopher Auer, Franz J. Brandenburg, Andreas Gleißner
Characterizing Planarity by the Splittable Deque. 25-36 - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati
Strip Planarity Testing. 37-48 - Patrizio Angelini, Fabrizio Frati
Morphing Planar Graph Drawings Efficiently. 49-60
Invited Talk
- Tamara Munzner:
Graph Drawing through the Lens of a Framework for Analyzing Visualization Methods - (Invited Talk, Extended Abstract). 61-70
Beyond Planarity
- Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer
A Linear-Time Algorithm for Testing Outer-1-Planarity. 71-82 - Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov
Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs. 83-94 - Andrew Suk, Bartosz Walczak
New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs. 95-106 - Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner
Recognizing Outer 1-Planar Graphs in Linear Time. 107-118
Geometric Representations
- Nieke Aerts, Stefan Felsner:
Straight Line Triangle Representations. 119-130 - Steven Chaplick
Extending Partial Representations of Circle Graphs. 131-142 - Stephane Durocher, Debajyoti Mondal:
On Balanced ✛-Contact Representations. 143-154 - J. Joseph Fowler:
Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations. 155-160
3D et al.
- Michael T. Goodrich, Pawel Pszona:
Achieving Good Angular Resolution in 3D Arc Diagrams. 161-172 - Alexander Igamberdiev, André Schulz:
A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes. 173-184 - Marcus Schaefer, Daniel Stefankovic:
Block Additivity of ℤ2-Embeddings. 185-195
Universality
- Stefan Felsner:
Exploiting Air-Pressure to Map Floorplans on Point Sets. 196-207 - Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein:
Superpatterns and Universal Point Sets. 208-219 - Thomas Bläsius, Annette Karrer, Ignaz Rutter:
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. 220-231
Practical Graph Drawing
- Helen C. Purchase
Sketched Graph Drawing: A Lesson in Empirical Studies. 232-243 - Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg
Many-to-One Boundary Labeling with Backbones. 244-255 - Michael T. Goodrich, Pawel Pszona:
Streamed Graph Drawing and the File Maintenance Problem. 256-267 - Emden R. Gansner, Yifan Hu, Shankar Krishnan:
COAST: A Convex Optimization Approach to Stress-Based Embedding. 268-279
Subgraphs
- Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán Adinolfi, Rodrigo I. Silveira
Colored Spanning Graphs for Set Visualization. 280-291 - Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Drawing Non-Planar Graphs with Crossing-Free Subgraphs. 292-303 - Emilio Di Giacomo
Exploring Complex Drawings via Edge Stratification. 304-315 - Tamara Mchedlidze
Drawing Planar Graphs with a Prescribed Inner Face. 316-327
Crossings
- Martin Fink, Sergey Pupyrev:
Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. 328-339 - Michael J. Bannister, David Eppstein, Joseph A. Simons:
Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. 340-351 - David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg
Strict Confluent Drawing. 352-363
Geometric Graphs and Geographic Networks
- Dhruv Mubayi, Andrew Suk:
A Ramsey-Type Result for Geometric ℓ-Hypergraphs. 364-375 - Timothy M. Chan, Hella-Franziska Hoffmann, Stephen Kiazyk, Anna Lubiw:
Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations. 376-387 - Arlind Nocaj, Ulrik Brandes:
Stub Bundling and Confluent Spirals for Geographic Networks. 388-399
Angular Restrictions
- Yi-Jun Chang
On Orthogonally Convex Drawings of Plane Graphs - (Extended Abstract). 400-411 - William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat
Planar and Plane Slope Number of Partial 2-Trees. 412-423 - Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli:
Slanted Orthogonal Drawings. 424-435
Grids
- David Eppstein:
Drawing Arrangement Graphs in Small Grids, or How to Play Planarity. 436-447 - Steve Kieffer, Tim Dwyer, Kim Marriott, Michael Wybrow:
Incremental Grid-Like Layout Using Soft and Hard Constraints. 448-459 - Therese Biedl, Thomas Bläsius
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. 460-471
Curves and Routes
- Jirí Matousek, Eric Sedgwick, Martin Tancer
Untangling Two Systems of Noncrossing Curves. 472-483 - Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Drawing Permutations with Few Corners. 484-495 - Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella:
Dynamic Traceroute Visualization at Multiple Abstraction Levels. 496-507
Graph Drawing Contest
- Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. 508-513
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 2024-11-15 19:45 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: