


default search action
GD 2017: Boston, MA, USA
- Fabrizio Frati, Kwan-Liu Ma:
Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10692, Springer 2018, ISBN 978-3-319-73914-4
Straight-Line Representations
- Tamara Mchedlidze
, Marcel Radermacher, Ignaz Rutter
:
Aligned Drawings of Planar Graphs. 3-16 - Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
On the Edge-Length Ratio of Outerplanar Graphs. 17-23 - Patrizio Angelini
, Steven Chaplick
, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr.
, Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl
, Pavel Valtr:
On Vertex- and Empty-Ply Proximity Drawings. 24-37 - Niklas Heinsohn, Michael Kaufmann:
An Interactive Tool to Explore and Improve the Ply Number of Drawings. 38-51 - Philipp Kindermann
, Wouter Meulemans, André Schulz:
Experimental Analysis of the Accessibility of Drawings with Few Segments. 52-64
Obstacles and Visibility
- John Gimbel, Patrice Ossona de Mendez
, Pavel Valtr
:
Obstacle Numbers of Planar Graphs. 67-80 - Therese Biedl, Saeed Mehrabi:
Grid-Obstacle Representations with Connections to Staircase Guarding. 81-87 - Patrizio Angelini
, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
:
3D Visibility Representations of 1-planar Graphs. 102-109
Topological Graph Theory
- Philipp Kindermann
, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg
, André Schulz, Birgit Vogtenhuber:
Lombardi Drawings of Knots and Links. 113-126 - Stefan Felsner, Manfred Scheucher
:
Arrangements of Pseudocircles: Triangles and Drawings. 127-139 - Therese Biedl, Veronika Irvine:
Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs. 140-152 - János Pach, Géza Tóth:
Many Touchings Force Many Crossings. 153-159 - Radoslav Fulek
, János Pach:
Thrackles: An Improved Upper Bound. 160-166
Orthogonal Representations and Book Embeddings
- Michael A. Bekos, Henry Förster, Michael Kaufmann:
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. 169-183 - Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin
:
EPG-representations with Small Grid-Size. 184-196 - Sergey Pupyrev:
Mixed Linear Layouts of Planar Graphs. 197-209 - Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu:
Upward Partitioned Book Embeddings. 210-223 - Jonathan Klawitter
, Tamara Mchedlidze
, Martin Nöllenburg
:
Experimental Evaluation of Book Drawing Algorithms. 224-238
Evaluations
- Kathrin Ballweg, Margit Pohl
, Günter Wallner
, Tatiana von Landesberger:
Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors. 241-255 - Alessio Arleo
, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
:
GiViP: A Visual Profiler for Distributed Graph Processing Systems. 256-271 - Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong:
Drawing Big Graphs Using Spectral Sparsification. 272-286 - Mershack Okoe, Radu Jianu, Stephen G. Kobourov:
Revisited Experimental Comparison of Node-Link and Matrix Representations. 287-302
Tree Drawings
- Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. 305-317 - Therese Biedl, Debajyoti Mondal:
On Upward Drawings of Trees on a Given Grid. 318-325 - Anargyros Oikonomou, Antonios Symvonis
:
Simple Compact Monotone Tree Drawings. 326-333 - Tiziana Calamoneri
, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing Co-phylogenetic Reconciliations. 334-347
Graph Layout Designs
- Mukund Raj, Ross T. Whitaker:
Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs. 351-364 - Thomas C. van Dijk, Fabian Lipp
, Peter Markfelder, Alexander Wolff
:
Computing Storyline Visualizations with Few Block Crossings. 365-378 - Jieting Wu, Jianping Zeng, Feiyu Zhu, Hongfeng Yu:
MLSEB: Edge Bundling Using Moving Least Squares Approximation. 379-393 - Paolo Simonetto, Daniel Archambault, Stephen G. Kobourov:
Drawing Dynamic Graphs Without Timeslices. 394-409
Point-Set Embeddings
- Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra
:
Colored Point-Set Embeddings of Acyclic Graphs. 413-425 - Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze
, Martin Nöllenburg
, Antonios Symvonis
, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. 426-439 - Boris Klemz, Günter Rote:
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. 440-453 - Rodrigo I. Silveira
, Bettina Speckmann
, Kevin Verbeek
:
Non-crossing Paths with Geographic Constraints. 454-461
Special Representations
- Steven Chaplick
, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo
, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff
:
Planar L-Drawings of Directed Graphs. 465-478 - Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini
:
NodeTrix Planarity Testing with Small Clusters. 479-491 - Arthur van Goethem, Irina Kostitsyna
, Marc J. van Kreveld, Wouter Meulemans, Max Sondag
, Jules Wulms:
The Painter's Problem: Covering a Grid with Colored Connected Polygons. 492-505 - David Eppstein:
Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count. 506-513
Beyond Planarity
- Patrizio Angelini
, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann
, Thomas Schneck:
1-Fan-Bundle-Planar Drawings of Graphs. 517-530 - Sang Won Bae
, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer
, Luca Grilli
, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani
, Ignaz Rutter
, Csaba D. Tóth:
Gap-Planar Graphs. 531-545 - Steven Chaplick
, Myroslav Kryven
, Giuseppe Liotta, Andre Löffler, Alexander Wolff
:
Beyond Outerplanarity. 546-559 - David Eppstein:
The Effect of Planarization on Width. 560-572
Contest Report
- William E. Devanny, Philipp Kindermann
, Maarten Löffler, Ignaz Rutter
:
Graph Drawing Contest Report. 575-582

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.