24th International Symposium on
Graph Drawing & Network Visualization
19-21 September 2016, Athens, Greece


  Sunday September 18, 2016
19:00-21:00 Welcome Reception
  Monday September 19, 2016
9:00-9:05 Opening
9:05-10:40 Session 1. Large Graphs and Clutter Avoidance (chair: Cody Dunne)
9:05-9:25 A Distributed Multilevel Force-directed Algorithm
Alessio Arleo, Walter Didimo, Giuseppe Liotta and Fabrizio Montecchiani
9:25-9:45 A Sparse Stress Model (best paper Track 2)
Mark Ortmann, Mirza Klimenta and Ulrik Brandes
9:45-10:05 Node Overlap Removal by Growing a Tree
Lev Nachmanson, Alexander Holroyd, Arlind Nocaj, Sergey Bereg and Leishi Zhang
10:05-10:20 Placing Arrows in Directed Graph Drawings
Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta and Fabrizio Montecchiani
10:20-10:40 Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-off
Jaakko Peltonen and Ziyuan Lin
10:40-11:10 Coffee Break
11:10-12:30 Session 2: Clustered Graphs (chair: André Schulz)
11:10-11:30 Twins in Subdivision Drawings of Hypergraphs
René Van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier and Manuel Sorge
11:30-11:50 Multi-Colored Spanning Graphs
Hugo Akitaya, Maarten Löffler and Csaba Toth
11:50-12:10 C-planarity of Embedded Cyclic c-Graphs
Radoslav Fulek.
12:10-12:30 Computing NodeTrix Representations of Clustered Graphs
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati and Maurizio Patrignani
12:30-14:30 Lunch Break
14:30-15:30 Session 3: Invited Talk (chair: Martin Nöllenburg)
14:30-15:30 Distributed Computing: Graph Drawing Unplugged
Roger Wattenhofer
15:30-16:30 Poster Session
15:30-15:45 Poster Pitches  
15:45-16:30 Poster Exhibition & Coffee Break
16:30-18:00 Session 4: Planar Graphs (chair: Walter Didimo)
16:30-16:45 1-bend Upward Planar Drawings of SP-digraphs
Emilio Di Giacomo, Giuseppe Liotta and Fabrizio Montecchiani
16:45-17:05 Non-aligned drawings of planar graphs
Therese Biedl and Claire Pennarun
17:05-17:20 Snapping Graph Drawings to the Grid Optimally
Andre Löffler, Thomas C. Van Dijk and Alexander Wolff
17:20-17:40 Drawing Planar Graphs with Many Collinear Vertices
Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze and Vincenzo Roselli
17:40-18:00 Drawing Graphs on Few Lines and Few Planes
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky and Alexander Wolff
18:15-19:45 Graph Drawing Live Challenge
  Tuesday September 20, 2016
9:00-10:40 Session 5: Layered and Tree Drawings (chair: Alexander Wolff)
9:00-9:20 Algorithms for Visualizing Phylogenetic Networks
Ioannis Tollis and Konstantinos Kakoulis
9:20-9:40 A Generalization of the Directed Graph Layering Problem
Ulf Rüegg, Thorsten Ehlers, Miro Spönemann and Reinhard von Hanxleden
9:40-10:00 Compact Layered Drawings of General Directed Graphs
Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Rüegg and Reinhard von Hanxleden
10:00-10:20 Bitonic st-orderings for Upward Planar Graphs
Martin Gronemann.
10:20-10:40 Low Ply Drawings of Trees
Patrizio Angelini, Michael Bekos, Till Bruckdorfer, Jaroslav Hančl, Michael Kaufmann, Stephen Kobourov, Jan Kratochvíl, Antonios Symvonis and Pavel Valtr
10:40-11:10 Coffee Break
11:10-12:30 Session 6: Visibility Representations (chair: Maurizio Patrignani)
11:10-11:30 Visibility Representations of Boxes in 2.5 Dimensions
Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides and Stephen Wismath
11:30-11:50 The Partial Visibility Representation Extension Problem
Steven Chaplick, Grzegorz Guśpiel, Grzegorz Gutowski, Tomasz Krawczyk and Giuseppe Liotta
11:50-12:10 Ortho-polygon Visibility Representations of Embedded Graphs
Emilio Di Giacomo, Walter Didimo, William Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani and Stephen Wismath
12:10-12:30 Obstructing Visibilities with One Obstacle
Steven Chaplick, Fabian Lipp, Ji-Won Park and Alexander Wolff
12:30-14:30 Lunch Break
14:30-15:30 Session 7: Invited Talk (chair: Yifan Hu) 
14:30-15:30 The role of Visual Analytics in Exploring Graph Data
Daniel Keim
15:30-16:00 Coffee Break
16:00-17:30 Session 8: Beyond Planarity (chair: Stephen Kobourov)
16:00-16:20 The crossing number of the cone of a graph
Carlos A. Alfaro, Alan Arroyo, Marek Derňár and Bojan Mohar
16:20-16:40 Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time
Seok-Hee Hong and Hiroshi Nagamochi
16:40-16:55 1-Bend RAC Drawings of 1-Planar Graphs
Walter Didimo, Giuseppe Liotta, Saeed Mehrabi and Fabrizio Montecchiani
16:55-17:15 On the Density of non-Simple 3-Planar Graphs
Michael Bekos, Michael Kaufmann and Chrysanthi Raftopoulou
17:15-17:30 A Note on the Practicality of Maximal Planar Subgraph Algorithms
Markus Chimani, Karsten Klein and Tilo Wiedera
17:45-18:45 Business Meeting
20:00 Conference Dinner
  Wednesday September 21
9:00-10:40 Session 9: Crossing Minimization and Crossing Numbers (chair: Stefan Felsner)
9:00-9:20 Crossing Minimization in Storyline Visualization
Martin Gronemann, Michael Jünger, Frauke Liers and Francesco Mambelli
9:20-9:40 Block Crossings in Storyline Visualizations (best paper Track 1)
Thomas C. Van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alex Ravsky, Subhash Suri and Alexander Wolff
9:40-10:00 The Bundled Crossing Number
Md. Jawaherul Alam, Martin Fink and Sergey Pupyrev
10:00-10:20 Approximating the rectilinear crossing number
Jacob Fox, Janos Pach and Andrew Suk
10:20-10:40 On the size of planarly connected crossing graphs
Eyal Ackerman, Balázs Keszegh and Mate Vizer
10:40-11:10 Coffee Break
11:10-12:30 Session 10: Topological Graph Theory (chair: Tamara Mchedlidze)
11:10-11:30 Topological Drawings of Complete Bipartite Graphs*
Jean Cardinal and Stefan Felsner
11:30-11:50 A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane
Éric Colin de Verdière, Vojtěch Kaluža, Pavel Paták, Zuzana Patáková and Martin Tancer
11:50-12:10 Hanani-Tutte for Radial Planarity II
Radoslav Fulek, Michael Pelsmajer and Marcus Schaefer
12:10-12:30 Beyond Level Planarity
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Ignaz Rutter and Maurizio Patrignani
12:30-14:30 Lunch Break
14:30-16:00 Session 11: Special Graph Embeddings (chair: Radoslav Fulek)
14:30-14:50 Simultaneous Orthogonal Planarity
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp and Ignaz Rutter
14:50-15:05 Stack and Queue Layouts via Layered Separators
Vida Dujmovic and Fabrizio Frati
15:05-15:25 Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw and Sander Verdonschot
15:25-15:45 Track Layout is Hard*
Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein and David R. Wood
15:45-16:00 Monotone Simultaneous Embeddings of Paths in d-dimensional Space
David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides and Steve Wismath
16:00-16:30 Coffee Break
16:30-17:10 Session 12: Dynamic Graphs (chair: Fabrizio Frati)
16:30-16:50 Evaluation of two interaction techniques for dynamic graph visualization
Paolo Federico and Silvia Miksch
16:50-17:10 Offline Drawing of Dynamic Trees: Algorithmics and Document Integration
Malte Skambath and Till Tantau
17:10-17:30 Closing and Awards

T: Track 1 (theory) paper, Ts: short theory paper
A: Track 2 (applied) paper, As: short applied paper

*official proceedings version not supplied via arXiv; please see the Springer proceedings volume LNCS 9801