Tuesday: | *=Speaker | |||
| 9:00-10:30 | GD Contest Live Challenge | |||
Wednesday: | ||||
| 7:50-8:00 | Welcome! | |||
| 8:00-8:45 | Session 1: Gradient descent and queue layouts | Chair | ||
| T2 | [Best Paper] Reyan Ahmed*, Felice De Luca, Sabin Devkota, Stephen Kobourov and Mingwei Li. Graph drawing via gradient descent, (GD)^2 | 2+10 min | David Auber | |
| S | Katharina Börsig*, Ulrik Brandes and Barna Pasztor. Stochastic Gradient Descent Works Really Well for Stress Minimization | 1+5 min | David Auber | |
| T1 | Laura Merker* and Torsten Ueckerdt. The Local Queue Number of Graphs with Bounded Treewidth | 1+5 min | Stefan Felsner | |
| T1 | Sujoy Bhore*, Robert Ganian, Fabrizio Montecchiani and Martin Nöllenburg. Parameterized Algorithms for Queue Layouts | 1+5 min | Stefan Felsner | |
| T1 | Jawaherul Md. Alam, Michael Bekos, Martin Gronemann*, Michael Kaufmann and Sergey Pupyrev. Lazy Queue Layouts of Posets | 1+5 min | Stefan Felsner | |
| 9:00-9:45 | Session 2: Drawing tree-like graphs, visualisation, and special drawings of elementary graphs | |||
| T1 | Timothy M. Chan and Zhengcheng Huang*. Improved Upper and Lower Bounds for LR Drawings of Binary Trees | 1+5 min | Sabine Cornelsen | |
| T1 | Václav Blažej*, Jiří Fiala and Giuseppe Liotta. On the edge-length ratio of $2$-trees | 1+5 min | Sabine Cornelsen | |
| T2 | Vincenzo Perri* and Ingo Scholtes. HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs | 1+5 min | Tamara Munzner | |
| S | Alessio Arleo*, Walter Didimo, Giuseppe Liotta, Silvia Miksch and Fabrizio Montecchiani. VAIM: Visual Analytics for Influence Maximization | 1+5 min | Tamara Munzner | |
| T1 | Gábor Damásdi*. Odd wheels are not odd-distance graphs. | 1+5 min | Fabrizio Frati | |
| T1 | Alon Efrat, Radoslav Fulek*, Stephen Kobourov and Csaba Tóth. Polygons with Prescribed Angles in 2D and 3D | 1+5 min | Fabrizio Frati | |
| 10:15-11:15 | T1 | Invited talk : Jeff Erickson*. Fun with Toroidal Spring Embeddings | David Eppstein | |
| Abstract: Tutte’s classical spring embedding theorem is the foundation of hundreds of algorithms for drawing and manipulating planar graphs. A somewhat less well-known generalization of Tutte’s theorem, first proved by Yves Colin de Verdière in 1990, applies to graphs on more complex surfaces. I will describe two recent applications of this more general theorem to graphs on the Euclidean flat torus. The first is a natural toroidal analogue of the Maxwell-Cremona correspondence, which relates equilibrium stresses, orthogonal dual embeddingss, and weighted Delaunay complexes. The second is an efficient algorithm to morph between geodesic torus graphs using a small number of parallel linear morphing steps, matching (and slightly simplifying) recent planar moprhing algorithms. This talk includes joint work with Erin Chambers, Patrick Lin, and Salman Parsa, available at https://arxiv.org/abs/2003.10057 and https://arxiv.org/abs/2007.07927 . | ||||
| 11:30-12:00 | Session 3: Restricted drawings of special graph classes | |||
| S | Patrizio Angelini*, Michael Bekos, Philipp Kindermann and Tamara Mchedlidze. On Mixed Linear Layouts of Series-Parallel Graphs | 1+5 min | Martin Nöllenburg | |
| T1 | Giuseppe Di Battista*, Fabrizio Frati, Maurizio Patrignani and Marco Tais. Schematic Representation of Large Biconnected Graphs | 1+5 min | Martin Nöllenburg | |
| S | Jonathan Klawitter* and Peter Stumpf. Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings | 1+5 min | Philipp Kindermann | |
| S | Emanuele Balloni, Giuseppe Di Battista and Maurizio Patrignani*. A Tipping Point for the Planarity of Small and Medium Sized Graphs | 1+5 min | Philipp Kindermann | |
Thursday: | ||||
| 8:00-8:40 | Poster Session | |||
| Panagiotis Lionakis, Giorgos Kritikakis and Ioannis Tollis. Algorithms and Experiments using the Path Based Hierarchical Drawing Framework | ||||
| Therese Biedl. Drawing outer-1-planar graphs revisited | ||||
| James Cruickshank and Qays Shakir. Contacts of Circular Arcs Representations of Tight Surface Graphs | ||||
| Evan Ezell, Seung-Hwan Lim, David Anderson and Robert Stewart. Visualizing Communities and Structure in Dynamic Networks | ||||
| Oksana Firman, Philipp Kindermann, Alexander Wolff, Johannes Zink, Alexander Ravsky and Stefan Felsner. The Complexity of Finding Tangles | ||||
| Ben Jacobsen, Markus Wallinger, Stephen Kobourov and Martin Nöllenburg. MetroSets: Visualizing Hypergraphs as MetroMaps | ||||
| Ehsan Moradi and Debajyoti Mondal. Visualizing Massive Networks by GPU Accelerated Streaming Algorithms | ||||
| 8:40-8:45 | Graph drawing contest report | Philipp Kindermann | ||
| 9:00-9:45 | Session 4: Orthogonality | |||
| T1 | Deepak Rajendraprasad and Sreejith K Pallathumadam*. Characterization and a 2D Visualization of B0-VPG Cocomparability Graphs | 1+5 min | Philipp Kindermann | |
| T1 | Patrizio Angelini, Steven Chaplick, Sabine Cornelsen* and Giordano Da Lozzo. Planar L-Drawings of Bimodal Graphs | 1+5 min | Philipp Kindermann | |
| T2 | Julian Walter, Johannes Zink*, Joachim Baumeister and Alexander Wolff. Layered Drawing of Undirected Graphs with Generalized Port Constraints | 1+5 min | Philipp Kindermann | |
| T2 | Benjamin Niedermann* and Ignaz Rutter. An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings | 1+5 min | Fabrizio Montecchiani | |
| T1 | Michael Bekos, Carla Binucci*, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani and Ignaz Rutter. On Turn-Regular Orthogonal Representations | 1+5 min | Fabrizio Montecchiani | |
| T1 | Patrizio Angelini, Ignaz Rutter and Sandhya T P*. Extending Partial Orthogonal Drawings | 1+5 min | Fabrizio Montecchiani | |
| 10:15-11:00 | Session 5: Topological constraints | |||
| T1 | Helena Bergold*, Stefan Felsner, Manfred Scheucher, Felix Schröder and Raphael Steiner. Topological Drawings meet Classical Theorems from Convex Geometry | 1+5 min | Csaba Tóth | |
| T1 | Marcel Radermacher, Ignaz Rutter and Peter Stumpf*. Towards a characterization of stretchable aligned graphs | 1+5 min | Csaba Tóth | |
| T2 | David Baum*. Exploring Design Space of Aesthetics with Repertory Grids | 1+5 min | Daniel Archambaullt | |
| S | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani and Alessandra Tappini*. Storyline Visualizations with Ubiquitous Actors | 1+5 min | Daniel Archambaullt | |
| S | Sabine Cornelsen, Maximilian Pfister*, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen Kobourov and Thomas Schneck. Drawing Shortest Paths in Geodetic Graphs | 1+5 min | Steve Chaplick | |
| T1 | Alexandra Wesolek*, Bojan Mohar and Marthe Bonamy. Limiting crossing numbers for geodesic drawings on the sphere | 1+5 min | Steve Chaplick | |
| 11:15-12:15 | Business Meeting | Stephen Kobourov | ||
Friday: | ||||
| 8:00-8:45 | Session 6: Crossings, k-planar graphs | |||
| T1 | [Best Paper] János Pach, Gábor Tardos and Géza Tóth*. Crossings between non-homotopic edges | 2+10 min | Pavel Valtr | |
| T1 | János Barát and Géza Tóth*. Improvement on the crossing number of crossing-critical graphs | 1+5 min | Markus Chimani | |
| S | Stefan Felsner, Michael Hoffmann, Kristin Knorr* and Irene Parada. On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens | 1+5 min | Markus Chimani | |
| T1 | Michael Hoffmann, Chih-Hung Liu, Meghana M Reddy* and Csaba Tóth. Simple Topological Drawings of k-Planar Graphs | 1+5 min | Walter Didimo | |
| T1 | Patrizio Angelini, Giordano Da Lozzo, Henry Förster* and Thomas Schneck. 2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth | 1+5 min | Walter Didimo | |
| 9:00-9:45 | Session 7: Planarity | |||
| T1 | Fabrizio Frati*. Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time | 1+5 min | Tamara Mchedlidze | |
| T1 | Walter Didimo, Michael Kaufmann, Giuseppe Liotta and Giacomo Ortali*. Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time | 1+5 min | Tamara Mchedlidze | |
| T2 | Amyra Meidiana*, Seok-Hee Hong and Peter Eades. New Quality Metrics for Dynamic Graph Drawing | 1+5 min | Romain Bourqui | |
| T2 | Helen Purchase*, Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev and Hsiang-Yun Wu. The Turing Test for Graph Drawing Algorithms | 1+5 min | Romain Bourqui | |
| S | Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus*, Rosna Paul*, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber and Alexandra Weinberger*. Plane Spanning Trees in Edge-Colored Simple Drawings of $K_n$ | 1+5 min | Alexander Wolff | |
| T1 | Jonathan Rollin*, Alexander Pilz, Lena Schlipf and André Schulz. Augmenting Geometric Graphs with Matchings | 1+5 min | Alexander Wolff | |
| 10:00 | End of online voting for best presentation & poster | |||
| 10:15-11:15 | T2 | Invited talk : Sheelagh Carpendale*. An Alternate Look at Aesthetics | David Auber | |
| 11:15-11:30 | Award and Closing Ceremony |
Program (no links)
