default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGD 2016: Athens, Greece
- Yifan Hu, Martin Nöllenburg
:
Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9801, Springer 2016, ISBN 978-3-319-50105-5
Large Graphs and Clutter Avoidance
- Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Distributed Multilevel Force-Directed Algorithm. 3-17 - Mark Ortmann, Mirza Klimenta, Ulrik Brandes:
A Sparse Stress Model. 18-32 - Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd:
Node Overlap Removal by Growing a Tree. 33-43 - Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Drawings. 44-51 - Jaakko Peltonen, Ziyuan Lin:
Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-Off. 52-64
Clustered Graphs
- René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. 67-80 - Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth:
Multi-colored Spanning Graphs. 81-93 - Radoslav Fulek:
C-Planarity of Embedded Cyclic c-Graphs. 94-106 - Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. 107-120
Planar Graphs
- Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
1-Bend Upward Planar Drawings of SP-Digraphs. 123-130 - Therese Biedl, Claire Pennarun:
Non-aligned Drawings of Planar Graphs. 131-143 - Andre Löffler, Thomas C. van Dijk, Alexander Wolff:
Snapping Graph Drawings to the Grid Optimally. 144-151 - Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing Planar Graphs with Many Collinear Vertices. 152-165 - Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing Graphs on Few Lines and Few Planes. 166-180
Layered and Tree Drawings
- Ioannis G. Tollis, Konstantinos G. Kakoulis:
Algorithms for Visualizing Phylogenetic Networks. 183-195 - Ulf Rüegg, Thorsten Ehlers, Miro Spönemann, Reinhard von Hanxleden:
A Generalization of the Directed Graph Layering Problem. 196-208 - Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Rüegg, Reinhard von Hanxleden:
Compact Layered Drawings of General Directed Graphs. 209-221 - Martin Gronemann:
Bitonic st-orderings for Upward Planar Graphs. 222-235 - Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl Jr., Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr:
Low Ply Drawings of Trees. 236-248
Visibility Representations
- Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. 251-265 - Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. 266-279 - Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-Polygon Visibility Representations of Embedded Graphs. 280-294 - Steven Chaplick, Fabian Lipp, Ji-won Park, Alexander Wolff:
Obstructing Visibilities with One Obstacle. 295-308
Beyond Planarity
- Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the Size of Planarly Connected Crossing Graphs. 311-320 - Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. 321-334 - Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani:
1-Bend RAC Drawings of 1-Planar Graphs. 335-343 - Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou:
On the Density of Non-simple 3-Planar Graphs. 344-356 - Markus Chimani, Karsten Klein, Tilo Wiedera:
A Note on the Practicality of Maximal Planar Subgraph Algorithms. 357-364
Crossing Minimization and Crossing Numbers
- Martin Gronemann, Michael Jünger, Frauke Liers, Francesco Mambelli:
Crossing Minimization in Storyline Visualization. 367-381 - Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. 382-398 - Md. Jawaherul Alam, Martin Fink, Sergey Pupyrev:
The Bundled Crossing Number. 399-412 - Jacob Fox, János Pach, Andrew Suk:
Approximating the Rectilinear Crossing Number. 413-426 - Carlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar:
The Crossing Number of the Cone of a Graph. 427-438
Topological Graph Theory
- Jean Cardinal, Stefan Felsner:
Topological Drawings of Complete Bipartite Graphs. 441-453 - Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer:
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. 454-467 - Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity II. 468-481 - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond Level Planarity. 482-495
Special Graph Embeddings
- Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood:
Track Layout Is Hard. 499-510 - Vida Dujmovic, Fabrizio Frati:
Stack and Queue Layouts via Layered Separators. 511-518 - Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot:
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. 519-531 - Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. 532-545 - David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in d Dimensions. 546-553
Dynamic Graphs
- Paolo Federico, Silvia Miksch:
Evaluation of Two Interaction Techniques for Visualization of Dynamic Graphs. 557-571 - Malte Skambath, Till Tantau:
Offline Drawing of Dynamic Trees: Algorithmics and Document Integration. 572-586
Contest Report
- Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. 589-595
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-12-02 23:31 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:
