default search action
GD 2014: Würzburg, Germany
- Christian A. Duncan, Antonios Symvonis
:
Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8871, Springer 2014, ISBN 978-3-662-45802-0
Planar Subgraphs
- Glencora Borradaile, David Eppstein, Pingan Zhu:
Planar Induced Subgraphs of Sparse Graphs. 1-12 - Marcus Schaefer:
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph. 13-24 - Timothy M. Chan, Fabrizio Frati
Drawing Partially Embedded and Simultaneously Planar Graphs. 25-39
Simultaneous Embeddings
- Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. 40-51 - Emilio Di Giacomo
Planar and Quasi Planar Simultaneous Geometric Embedding. 52-63 - Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg
Simultaneous Embeddability of Two Partitions. 64-75
Applications
- Philipp Kindermann
Luatodonotes: Boundary Labeling for Annotations in Texts. 76-88 - Yifan Hu, Lei Shi:
A Coloring Algorithm for Disambiguating Graph and Map Drawings. 89-100 - Arlind Nocaj, Mark Ortmann, Ulrik Brandes:
Untangling Hairballs - From 3 to 14 Degrees of Separation. 101-112 - Michael R. Marner, Ross T. Smith, Bruce H. Thomas, Karsten Klein, Peter Eades, Seok-Hee Hong:
GION: Interactively Untangling Large Graphs on Wall-Sized Displays. 113-124
Contact Representations
- Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov
Balanced Circle Packings for Planar Graphs. 125-136 - Linda Kleist
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D. 137-148 - Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich:
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. 149-161 - Martin Gronemann:
Bitonic st-orderings of Biconnected Planar Graphs. 162-173
k-Planar Graphs
- Emilio Di Giacomo
Drawing Outer 1-planar Graphs with Few Slopes. 174-185 - Carla Binucci, Emilio Di Giacomo
Fan-Planar Graphs: Combinatorial Properties and Complexity Results. 186-197 - Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. 198-209
Crossing Minimization
- Michael J. Bannister, David Eppstein:
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. 210-221 - Eyal Ackerman, Marcus Schaefer:
A Crossing Lemma for the Pair-Crossing Number. 222-233 - Stephen G. Kobourov
Are Crossings Important for Drawing Large Graphs? 234-245
Level Drawings
- Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati
The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity). 246-258 - William Evans, Vincent Kusters, Maria Saumell, Bettina Speckmann
Column Planarity and Partial Simultaneous Geometric Embedding. 259-271 - Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. 272-283
Theory
- Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. Tóth:
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture. 284-293 - Fidel Barrera-Cruz, Penny E. Haxell, Anna Lubiw:
Morphing Schnyder Drawings of Planar Triangulations. 294-305 - Stephane Durocher, Debajyoti Mondal:
Trade-Offs in Planar Polyline Drawings. 306-318
Fixed Edge Directions
- Ulf Rüegg, Steve Kieffer, Tim Dwyer
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports. 319-330 - Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug:
Planar Octilinear Drawings with One Bend Per Edge. 331-342 - Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
On the Complexity of HV-rectilinear Planarity Testing. 343-354 - Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze
Embedding Four-Directional Paths on Convex Point Sets. 355-366
Drawing under Constraints
- Maximilian Aulbach, Martin Fink, Julian Schuhmann, Alexander Wolff:
Drawing Graphs within Restricted Area. 367-379 - Therese Biedl:
Height-Preserving Transformations of Planar Graph Drawings. 380-391 - Stephane Durocher, Debajyoti Mondal:
Drawing Planar Graphs with Reduced Height. 392-403 - Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli:
Anchored Drawings of Planar Graphs. 404-415
Clustered Planarity
- Markus Chimani, Giuseppe Di Battista, Fabrizio Frati
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. 416-427 - Radoslav Fulek, Jan Kyncl
Clustered Planarity Testing Revisited. 428-439 - Thomas Bläsius, Ignaz Rutter:
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. 440-451 - Alon Efrat
MapSets: Visualizing Embedded and Clustered Graphs. 452-463
Greedy Graphs
- Hooman Reisi Dehkordi, Fabrizio Frati
Increasing-Chord Graphs On Point Sets. 464-475 - Martin Nöllenburg
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. 476-487 - Philipp Kindermann
On Monotone Drawings of Trees. 488-500
Graph Drawing Contest
- Carsten Gutwenger, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. 501-506
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:19 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: