Accepted Papers

Track 1: Combinatorial and algorithmic aspects

• Rohan Acharya, Torsten Mütze, and Francesco Verciani. Flips in colorful triangulations
• Oswin Aichholzer, Joachim Orthaber, and Birgit Vogtenhuber. Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
• Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D’Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, and Maurizio Patrignani. Upward Pointset Embeddings of Planar st-Graphs
• Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, and Pavel Valtr. Noncrossing Longest Paths and Cycles
• Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, and Alexander Wolff. The Price of Upwardness
• Martin Balko, Petr Hliněný, Tomáš Masařík, Joachim Orthaber, Birgit Vogtenhuber, and Mirko H. Wagner. On the Uncrossed Number of Graphs
• Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmović, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, and Alexandra Weinberger. On k-planar Graphs without Short Cycles
• Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, and Ioannis G. Tollis. Weakly Leveled Planarity with Bounded Span
• Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, and Fabrizio Montecchiani. On the Complexity of Recognizing \(k^+\)-Real Face Graphs
• Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, and Ignaz Rutter. Constrained Outer-String Representations
• Therese Biedl, Anna Lubiw, and Jack Spalding-Jamieson. Morphing Planar Graph Drawings via Orthogonal Box Drawings
• Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, and Jules Wulms. Boundary Labeling in a Circular Orbit
• Aaron Büngener and Michael Kaufmann. Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
• Markus Chimani, Torben Donzelmann, Nick Kloster, Melissa Koch, Jan-Jakob Völlering, and Mirko H. Wagner. Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
• Sebastiano Cultrera di Montesanothe, Ondřej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. The Euclidean MST-ratio for Bi-colored Lattices
• Thomas Depian, Simon D. Fink, Robert Ganian, and Martin Nöllenburg. The Parameterized Complexity of Extending Stack Layouts
• Vida Dujmović and Camille La Rose. Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors
• David Eppstein, Michael T. Goodrich, and Abraham M. Illickan. Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
• Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, and Alexander Wolff. Bounding the Treewidth of Outer k-Planar Graphs via Triangulations
• Jacob Fox, János Pach, and Andrew Suk. Enumeration of intersection graphs of \(x\)-monotone curves
• Steven Chaplick, Henry Förster, Michael Hoffmann, and Michael Kaufmann. Monotone Arc Diagrams with few Biarcs
• Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M Reddy, Felix Schröder, and Torsten Ueckerdt. The Density Formula: One Lemma to Bound Them All
• Laura Merker, Lena Scherzer, Samuel Schneider, and Torsten Ueckerdt. Intersection Graphs with and without Product Structure
• Miriam Münch and Ignaz Rutter. Parameterized Algorithms for Beyond Planar Crossing Numbers
• Aaron Büngener and Maximilian Pfister. On the edge density of bipartite 3-planar and bipartite gap-planar graphs

Track 2: Experimental, applied, and network visualization aspect

• Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, and Markus Wallinger. Bundling-Aware Graph Drawing
• Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, and Martin Nöllenburg. Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
• Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, and Falk Schreiber. GraphTrials: Visual Proofs of Graph Properties
• Tim Hegemann and Alexander Wolff. Storylines with a Protagonist
• Amyra Meidiana, Seok-Hee Hong, and Yongcheng Jing. Connectivity-Faithful Graph Drawing
• Gavin J. Mooney, Helen C. Purchase, Michael Wybrow, Stephen G. Kobourov, and Jacob Miller. The Perception of Stress in Graph Drawings

Short Papers

• Helena Bergold, Joachim Orthaber, Manfred Scheucher, and Felix Schröder. Holes in Convex and Simple Drawings
• Susanna Caroppo, Giordano Da Lozzo, and Giuseppe Di Battista. Quantum Algorithms for One-Sided Crossing Minimization
• Daniel J. Chang and Timothy Sun. Harborth’s conjecture for 4-regular planar graphs
• Adrian Dumitrescu and János Pach. Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
• Petr Hlineny and Lili Ködmön. Note on Min-k-Planar Drawings of Graphs
• Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, and Ignaz Rutter. On k-Plane Insertion into Plane Drawings
• Panna Gehér and Géza Tóth. 1-planar unit distance graphs

Accepted Posters

• Joshua Geis and Johannes Zink. From Planar via Outerplanar to Outerpath — Engineering NP-hardness Constructions
• Robert Ganian, Martin Nöllenburg, and Sebastian Röder. Minimizing Switches in Cased Graph Drawings
• Markus Chimani, Lea Kröger, Juliane Liedtke, Jonah Mevert, Maor Shani, and Maarten van Zalk. Graph-Drawing Supported Identification of Influential Students at Schools
• Martin Nöllenburg, Sebastian Röder, and Markus Wallinger. gdMetriX — A networkX Extension for Graph Drawing Metrics
• Nikolaus-Mathias Herl and Velitchko Filipov. AdMaTilE: Visualizing Event-based Adjacency Matrices in a Multiple-Coordinated-Views System
• Maarten Löffler. Strict upward planar grid drawings of binary trees with minimal area
• Sören Domrös and Reinhard von Hanxleden. Determining Sugiyama Topology with Model Order
• Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, and Tommaso Piselli. Introducing Fairness in Graph Visualization
• Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, and Peter Stumpf. Level Planarity Is More Difficult Than We Thought
• Jakob Baumann, Ignaz Rutter, and Dirk Sudholt. Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation
• Alvin Chiu, Ahmed Eldawy, and Michael T. Goodrich. Polygonally Anchored Graph Drawing
• Stephane Durocher, Myroslav Kryven, and Maarten Löffler. String graph with cop number 4
• Oriol Solé Pi. Approximating the crossing number of dense graphs