default search action
GD 2018: Barcelona, Spain
- Therese Biedl, Andreas Kerren:
Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings. Lecture Notes in Computer Science 11282, Springer 2018, ISBN 978-3-030-04413-8
Invited Talk
- Alexandru C. Telea:
Image-Based Graph Visualization: Advances and Challenges. 3-19
Planarity Variants
- Pier Francesco Cortese, Maurizio Patrignani:
Clustered Planarity = Flat Clustered Planarity. 23-38 - Guido Brückner, Ignaz Rutter
, Peter Stumpf:
Level Planarity: Transitivity vs. Even Crossings. 39-52 - Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg
Short Plane Supports for Spatial Hypergraphs. 53-66 - Patrizio Angelini
Turning Cliques into Paths to Achieve Planarity. 67-74
Upward Drawings
- Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
Universal Slope Sets for Upward Planar Drawings. 77-91 - Giordano Da Lozzo
Upward Planar Morphs. 92-105 - Maya Olszewski
Visualizing the Template of a Chaotic Attractor. 106-119
RAC Drawings
- Patrizio Angelini
On RAC Drawings of Graphs with One Bend per Edge. 123-136 - Steven Chaplick
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. 137-151 - Philipp Kindermann
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. 152-166
Best Paper Track 2
- Moritz Klammler, Tamara Mchedlidze
Aesthetic Discrimination of Graph Layouts. 169-184
Orders
- Michael Jünger, Petra Mutzel
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. 187-199 - Kolja Knauer
The Queue-Number of Posets of Bounded Width or Height. 200-212 - Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. 213-226
Crossings
- Radoslav Fulek, Csaba D. Tóth:
Crossing Minimization in Perturbed Drawings. 229-241 - Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The Number of Crossings in Multigraphs with No Empty Lens. 242-254 - Markus Chimani
Crossing Numbers and Stress of Random Graphs. 255-268
Crossing Angles
- Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett:
A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution. 271-285 - Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze
A Greedy Heuristic for Crossing-Angle Maximization. 286-299
Contact Representations
- Felice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov, Anna Lubiw, Debajyoti Mondal:
Recognition and Drawing of Stick Graphs. 303-316 - Zakir Deniz
On Contact Graphs of Paths on a Grid. 317-330
Specialized Graphs and Trees
- Linda Kleist
On the Area-Universality of Triangulations. 333-346 - Anargyros Oikonomou, Antonios Symvonis
Monotone Drawings of k-Inner Planar Graphs. 347-353 - Torsten Mütze
On L-Shaped Point Set Embeddings of Trees: First Non-embeddable Examples. 354-360 - Hugo A. Akitaya, Maarten Löffler, Irene Parada
How to Fit a Tree in a Box. 361-367
Best Paper Track 1
- Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati
Pole Dancing: 3D Morphs for Tree Drawings. 371-384
Partially Fixed Drawings
- Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. 387-401 - Marcel Radermacher, Ignaz Rutter
Inserting an Edge into a Geometric Embedding. 402-415 - Tamara Mchedlidze
\beta -Stars or On Extending a Drawing of a Connected Subgraph. 416-429
Experiments
- Felice De Luca, Stephen G. Kobourov, Helen C. Purchase
Perception of Symmetries in Drawings of Graphs. 433-446 - Chien-Chun Ni
Network Alignment by Discrete Ollivier-Ricci Flow. 447-462 - Hang Chen, Utkarsh Soni, Yafeng Lu, Ross Maciejewski, Stephen G. Kobourov:
Same Stats, Different Graphs - (Graph Statistics and Why We Need Graph Drawings). 463-477
Orthogonal Drawings
- Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Bend-Minimum Orthogonal Drawings in Quadratic Time. 481-494 - Patrizio Angelini
Greedy Rectilinear Drawings. 495-508 - Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. 509-523 - Giuseppe Liotta, Fabrizio Montecchiani
Ortho-Polygon Visibility Representations of 3-Connected 1-Plane Graphs. 524-537
Realizability
- David Eppstein:
Realization and Connectivity of the Graphs of Origami Flat Foldings. 541-554 - Stefan Felsner
Arrangements of Pseudocircles: On Circularizability. 555-568 - Peter Eades, Patrick Healy, Nikola S. Nikolov
The Weighted Barycenter Drawing Recognition Problem. 569-575
Miscellaneous
- Giacomo Ortali, Ioannis G. Tollis:
Algorithms and Bounds for Drawing Directed Graphs. 579-592 - Ruy Fabila Monroy, Carlos Hidalgo-Toscano
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. 593-605
Graph Drawing Contest Report
- William E. Devanny, Philipp Kindermann
Graph Drawing Contest Report. 609-617
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-22 19:48 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: