Accepted Papers

Track 1: Combinatorial and algorithmic aspects

• Tomasz Krawczyk. On the structure of normalized models of circular arc graphs I.
• Oswin Aichholzer, Joseph Dorfer and Birgit Vogtenhuber. Constrained Flips in Plane Spanning Trees
• Giuseppe Di Battista, Giuseppe Liotta, Maurizio Patrignani, Antonios Symvonis and Ioannis Tollis. Tangling and Untangling Trees on Point-sets
• Md. Jawaherul Alam, Michael Bekos, Martin Gronemann and Michael Kaufmann. The Page Number of Monotone Directed Acyclic Outerplanar Graphs is Four or Five
• Todor Antić, Vít Jelínek, Maritn Pergel, Felix Schröder, Peter Stumpf and Pavel Valtr. The Bend Number of Cocomparability Graphs
• Oswin Aichholzer, Sofia Brenner, Joseph Dorfer, Hung Hoang, Daniel Perz, Christian Rieck and Francesco Verciani. Flipping odd matchings in geometric and combinatorial settings
• Carolina Haase, Philipp Kindermann, Giuseppe Liotta and William Lenhart. Separability of Witness Gabriel Drawings
• Miriam Goetze, Michael Hoffmann, Ignaz Rutter and Torsten Ueckerdt. Crossing Number of 3-Plane Drawings
• Tatsuya Gima, Yasuaki Kobayashi and Yuto Okada. Structural Parameterizations of k-Planarity
• Michael Bekos, Giordano Da Lozzo, Fabrizio Frati, Giuseppe Liotta and Antonios Symvonis. Internally-Convex Drawings of Outerplanar Graphs in Small Area
• Todor Antić, Martin Balko and Birgit Vogtenhuber. Crossing and non-crossing families
• Zayed Asiri, Ryan Burdett, Markus Chimani, Michael Haythorpe, Alex Newcombe and Mirko H. Wagner. A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
• Parinya Chalermsook, Ly Orgo and Minoo Zarsav. On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
• Hugo Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba Toth and Torsten Ueckerdt. Connectivity Augmentation for Planar and Beyond-Planar Graphs
• Maria Chudnovsky, David Eppstein and David Fischer. Sparse Obstacles for String Graphs
• Oswin Aichholzer, Alfredo Garcia, Javier Tejel, Birgit Vogtenhuber and Alexandra Weinberger. Characterizing and Recognizing Twistedness
• Rafał Pyzik. Treewidth of Outer k-Planar Graphs
• Benedikt Hahn, Torsten Ueckerdt and Birgit Vogtenhuber. Edge densities of drawings of graphs with one forbidden cell
• Florestan Brunck, Hsien-Chih Chang, Maarten Löffler, Tim Ophelders and Lena Schlipf. Reconfiguration in Curve Arrangements to Reduce Self-Intersections and Popular Faces

Track 2: Experimental, applied, and network visualization aspect

• Simon D. Fink, Miriam Münch, Matthias Pfretzschner and Ignaz Rutter. Heuristics for Exact 1-Planarity Testing
• Lin Zhang, Yao Wang, Ying Zhang, Wilhelm Kerle-Malcharek, Karsten Klein, Falk Schreiber and Andreas Bulling. Towards a Better Understanding of Graph Perception in Immersive Environments
• Sergey Pupyrev. OOPS: Optimized One-Planarity Solver via SAT
• Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich and Martin Nöllenburg. Visualizing Treewidth
• Ilan Hartskeerl, Tamara Mchedlidze, Simon van Wageningen, Peter Vangorp and Alex Telea. NNP-NET: Accelerating t-SNE Graph Drawing for Very Large Graphs by Neural Networks
• Gavin J. Mooney, Alexander Wolff, Tim Hegemann, Michael Wybrow and Helen Purchase. Universal Quality Metrics for Graph Drawings: Which Graphs Excite Us Most?
• Carla Binucci, Sabine Cornelsen, Walter Didimo, Seok-Hee Hong, Eleni Katsanou, Maurizio Patrignani, Antonios Symvonis and Samuel Wolf. Planar Stories of Graph Drawings: Algorithms and Experiments
• Giordano Andreola, Susanna Caroppo, Giuseppe Di Battista, Fabrizio Grosso, Maurizio Patrignani and Allegra Strippoli. A Walk on the Wild Side: a Shape-First Methodology for Orthogonal Drawings
• Lucas Joos, Gavin J. Mooney, Maximilian T. Fischer, Daniel A. Keim, Falk Schreiber, Helen C. Purchase and Karsten Klein. Show Me Your Best Side: Characteristics of User-Preferred Perspectives for 3D Graph Drawings
• Gavin J. Mooney, Jacob Miller, Michael Wybrow, Stephen Kobourov and Helen Purchase. Stress in Graph Drawings: Perception, Preference, and Performance
• Alexander Dobler, Tim Hegemann, Martin Nöllenburg and Alexander Wolff. Optimizing Wiggle in Storylines
• Eleni Katsanou, Tamara Mchedlidze, Antonios Symvonis and Thanos Tolias. An algorithm for accurate and simple-looking metaphorical maps

Short Papers

• Michael Bekos, Michael Kaufmann and Maximilian Pfister. Approximating Barnette’s Conjecture
• Simon van Wageningen, Tamara Mchedlidze and Alex Telea. Same Quality Metrics, Different Graph Drawings
• Eliska Cervenkova and Jan Kratochvil. 1-planar unit distance graphs with more edges than matchstick graphs
• Alexander Dobler, Maximilian Holzmüller and Martin Nöllenburg. Geometry Matters in Planar Storyplans
• David Eppstein. Stabbing Faces By a Convex Curve
• Debajyoti Mondal. Layered Polyline Drawings of Planar Graphs
• Jacob Fox, Janos Pach and Andrew Suk. From local pair-crossing number to local crossing number