GD 2020 Accepted Papers

Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder and Raphael Steiner. Topological Drawings meet Classical Theorems from Convex Geometry
Helen Purchase, Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev and Hsiang-Yun Wu. The Turing Test for Graph Drawing Algorithms
János Barát and Geza Toth. Improvement on the crossing number of crossing-critical graphs
Patrizio Angelini, Michael Bekos, Philipp Kindermann and Tamara Mchedlidze. On Mixed Linear Layouts of Series-Parallel Graphs
Gábor Damásdi. Odd wheels are not odd-distance graphs.
Vincenzo Perri and Ingo Scholtes. HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch and Fabrizio Montecchiani. VAIM: Visual Analytics for Influence Maximization
Janos Pach, Gabor Tardos and Geza Toth. Crossings between non-homotopic edges
Deepak Rajendraprasad and Sreejith K Pallathumadam. Characterization and a 2D Visualization of B0-VPG Cocomparability Graphs
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$
Michael Hoffmann, Chih-Hung Liu, Meghana M Reddy and Csaba Toth. Simple Topological Drawings of k-Planar Graphs
Julian Walter, Johannes Zink, Joachim Baumeister and Alexander Wolff. Layered Drawing of Undirected Graphs with Generalized Port Constraints
Timothy M. Chan and Zhengcheng Huang. Improved Upper and Lower Bounds for LR Drawings of Binary Trees
Michael Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani and Ignaz Rutter. On Turn-Regular Orthogonal Representations
Laura Merker and Torsten Ueckerdt. The Local Queue Number of Graphs with Bounded Treewidth
Amyra Meidiana, Seok-Hee Hong and Peter Eades. New Quality Metrics for Dynamic Graph Drawing
Jonathan Klawitter and Peter Stumpf. Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani and Martin Nöllenburg. Parameterized Algorithms for Queue Layouts
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani and Alessandra Tappini. Storyline Visualizations with Ubiquitous Actors
Jonathan Rollin, Alexander Pilz, Lena Schlipf and André Schulz. Augmenting Geometric Graphs with Matchings
Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani and Marco Tais. Schematic Representation of Large Biconnected Graphs
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen and Giordano Da Lozzo. Planar L-Drawings of Bimodal Graphs
Katharina Börsig, Ulrik Brandes and Barna Pasztor. Stochastic Gradient Descent Works Really Well for Stress Minimization
Fabrizio Frati. Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
Marcel Radermacher, Ignaz Rutter and Peter Stumpf. Towards a characterization of stretchable aligned graphs
Václav Blažej, Jiří Fiala and Giuseppe Liotta. On the edge-length ratio of $2$-trees
Patrizio Angelini, Ignaz Rutter and Sandhya T P. Extending Partial Orthogonal Drawings
Walter Didimo, Michael Kaufmann, Giuseppe Liotta and Giacomo Ortali. Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
Patrizio Angelini, Giordano Da Lozzo, Henry Förster and Thomas Schneck. 2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen Kobourov and Thomas Schneck. Drawing Shortest Paths in Geodetic Graphs
Benjamin Niedermann and Ignaz Rutter. An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
Jawaherul Md. Alam, Michael Bekos, Martin Gronemann, Michael Kaufmann and Sergey Pupyrev. Lazy Queue Layouts of Posets
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
Emanuele Balloni, Giuseppe Di Battista and Maurizio Patrignani. A Tipping Point for the Planarity of Small and Medium Sized Graphs
David Baum. Exploring Design Space of Aesthetics with Repertory Grids
Alexandra Wesolek, Bojan Mohar and Marthe Bonamy. Limiting crossing numbers for geodesic drawings on the sphere
Alon Efrat, Radoslav Fulek, Stephen Kobourov and Csaba Toth. Polygons with Prescribed Angles in 2D and 3D
Reyan Ahmed, Felice De Luca, Sabin Devkota, Stephen Kobourov and Mingwei Li. Graph drawing via gradient descent, $(GD)^2$