LIPIcs, Volume 320, GD 2024

• Stefan Felsner and Karsten Klein LIPIcs, Volume 320, GD 2024, Complete Volume 10.4230/LIPIcs.GD.2024
• Stefan Felsner and Karsten Klein Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.GD.2024.0
• Otfried Cheong How Can Biclique Covers Help in Matching Problems (Invited Talk) 10.4230/LIPIcs.GD.2024.1
• Monika Henzinger How Can Algorithms Help in Protecting Our Privacy (Invited Talk) 10.4230/LIPIcs.GD.2024.2
• Sebastiano Cultrera di Montesano, Ondřej Draganov, Herbert Edelsbrunner, and Morteza Saghafian The Euclidean MST-Ratio for Bi-Colored Lattices 10.4230/LIPIcs.GD.2024.3
• Jacob Fox, János Pach, and Andrew Suk Enumeration of Intersection Graphs of x-Monotone Curves 10.4230/LIPIcs.GD.2024.4
• Helena Bergold, Joachim Orthaber, Manfred Scheucher, and Felix Schröder Holes in Convex and Simple Drawings 10.4230/LIPIcs.GD.2024.5
• Panna Gehér and Géza Tóth 1-Planar Unit Distance Graphs 10.4230/LIPIcs.GD.2024.6
• Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, and Torsten Ueckerdt The Density Formula: One Lemma to Bound Them All 10.4230/LIPIcs.GD.2024.7
• Petr Hliněný and Lili Ködmön Note on Min- k-Planar Drawings of Graphs 10.4230/LIPIcs.GD.2024.8
• Adrian Dumitrescu and János Pach Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs 10.4230/LIPIcs.GD.2024.9
• Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, and Ignaz Rutter Constrained Outer-String Representations 10.4230/LIPIcs.GD.2024.10
• Steven Chaplick, Henry Förster, Michael Hoffmann, and Michael Kaufmann Monotone Arc Diagrams with Few Biarcs 10.4230/LIPIcs.GD.2024.11
• Thomas Depian, Simon D. Fink, Robert Ganian, and Martin Nöllenburg The Parameterized Complexity Of Extending Stack Layouts 10.4230/LIPIcs.GD.2024.12
• 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 10.4230/LIPIcs.GD.2024.13
• Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, and Alexander Wolff Bounding the Treewidth of Outer k-Planar Graphs via Triangulations 10.4230/LIPIcs.GD.2024.14
• Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, and Markus Wallinger Bundling-Aware Graph Drawing 10.4230/LIPIcs.GD.2024.15
• 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 10.4230/LIPIcs.GD.2024.16
• Amyra Meidiana, Seok-Hee Hong, and Yongcheng Jing Connectivity-Faithful Graph Drawing 10.4230/LIPIcs.GD.2024.17
• Martin Balko, Petr Hliněný, Tomáš Masařík, Joachim Orthaber, Birgit Vogtenhuber, and Mirko H. Wagner On the Uncrossed Number of Graphs 10.4230/LIPIcs.GD.2024.18
• 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 10.4230/LIPIcs.GD.2024.19
• Susanna Caroppo, Giordano Da Lozzo, and Giuseppe Di Battista Quantum Algorithms for One-Sided Crossing Minimization 10.4230/LIPIcs.GD.2024.20
• Gavin J. Mooney, Helen C. Purchase, Michael Wybrow, Stephen G. Kobourov, and Jacob Miller The Perception of Stress in Graph Drawings 10.4230/LIPIcs.GD.2024.21
• Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, and Jules Wulms Boundary Labeling in a Circular Orbit 10.4230/LIPIcs.GD.2024.22
• Laura Merker, Lena Scherzer, Samuel Schneider, and Torsten Ueckerdt Intersection Graphs with and Without Product Structure 10.4230/LIPIcs.GD.2024.23
• 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 10.4230/LIPIcs.GD.2024.24
• Miriam Münch and Ignaz Rutter Parameterized Algorithms for Beyond-Planar Crossing Numbers 10.4230/LIPIcs.GD.2024.25
• Tim Hegemann and Alexander Wolff Storylines with a Protagonist 10.4230/LIPIcs.GD.2024.26
• 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 10.4230/LIPIcs.GD.2024.27
• Aaron Büngener and Maximilian Pfister On the Edge Density of Bipartite 3-Planar and Bipartite Gap-Planar Graphs 10.4230/LIPIcs.GD.2024.28
• Aaron Büngener and Michael Kaufmann Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs 10.4230/LIPIcs.GD.2024.29
• Rohan Acharya, Torsten Mütze, and Francesco Verciani Flips in Colorful Triangulations 10.4230/LIPIcs.GD.2024.30
• 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 10.4230/LIPIcs.GD.2024.31
• 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 10.4230/LIPIcs.GD.2024.32
• 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 10.4230/LIPIcs.GD.2024.33
• Oswin Aichholzer, Joachim Orthaber, and Birgit Vogtenhuber Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles 10.4230/LIPIcs.GD.2024.34
• Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, and Ignaz Rutter On k-Plane Insertion into Plane Drawings 10.4230/LIPIcs.GD.2024.35
• 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 10.4230/LIPIcs.GD.2024.36
• Vida Dujmović and Camille La Rose Rectilinear Crossing Number of Graphs Excluding a Single-Crossing Graph as a Minor 10.4230/LIPIcs.GD.2024.37
• Daniel J. Chang and Timothy Sun Harborth’s Conjecture for 4-Regular Planar Graphs 10.4230/LIPIcs.GD.2024.38
• David Eppstein, Michael T. Goodrich, and Abraham M. Illickan Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature 10.4230/LIPIcs.GD.2024.39
• Therese Biedl, Anna Lubiw, and Jack Spalding-Jamieson Morphing Planar Graph Drawings via Orthogonal Box Drawings 10.4230/LIPIcs.GD.2024.40
• Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, and Jules Wulms Graph Drawing Contest Report (Graph Drawing Contest Report) 10.4230/LIPIcs.GD.2024.41
• Joshua Geis and Johannes Zink From Planar via Outerplanar to Outerpath – Engineering NP-Hardness Constructions (Poster Abstract) 10.4230/LIPIcs.GD.2024.42
• Robert Ganian, Martin Nöllenburg, and Sebastian Röder Minimizing Switches in Cased Graph Drawings (Poster Abstract) 10.4230/LIPIcs.GD.2024.43
• Markus Chimani, Lea Kröger, Juliane Liedtke, Jonah Mevert, Maor Shani, and Maarten van Zalk Graph-Drawing Supported Identification of Influential Students at Schools (Poster Abstract) 10.4230/LIPIcs.GD.2024.44
• Martin Nöllenburg, Sebastian Röder, and Markus Wallinger GdMetriX - A NetworkX Extension For Graph Drawing Metrics (Poster Abstract) 10.4230/LIPIcs.GD.2024.45
• Nikolaus-Mathias Herl and Velitchko Filipov AdMaTilE: Visualizing Event-Based Adjacency Matrices in a Multiple-Coordinated-Views System (Poster Abstract) 10.4230/LIPIcs.GD.2024.46
• Maarten Löffler Strict Upward Planar Grid Drawings of Binary Trees with Minimal Area (Poster Abstract) 10.4230/LIPIcs.GD.2024.47
• Sören Domrös and Reinhard von Hanxleden Determining Sugiyama Topology with Model Order (Poster Abstract) 10.4230/LIPIcs.GD.2024.48
• Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, and Tommaso Piselli Introducing Fairness in Graph Visualization (Poster Abstract) 10.4230/LIPIcs.GD.2024.49
• Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, and Peter Stumpf Level Planarity Is More Difficult Than We Thought (Poster Abstract) 10.4230/LIPIcs.GD.2024.50
• Jakob Baumann, Ignaz Rutter, and Dirk Sudholt Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract) 10.4230/LIPIcs.GD.2024.51
• Alvin Chiu, Ahmed Eldawy, and Michael T. Goodrich Polygonally Anchored Graph Drawing (Poster Abstract) 10.4230/LIPIcs.GD.2024.52
• Stephane Durocher, Myroslav Kryven, and Maarten Löffler String Graph with Cop Number 4 (Poster Abstract) 10.4230/LIPIcs.GD.2024.53
• Oriol Solé Pi Approximating the Crossing Number of Dense Graphs (Poster Abstract) 10.4230/LIPIcs.GD.2024.54
• Evmorfia Argyriou and Benjamin Niedermann yFiles - From Data to Meaningful Visualizations (Software Abstract) 10.4230/LIPIcs.GD.2024.55
• Maximilian Kasperowski, Sören Domrös, and Reinhard von Hanxleden The Eclipse Layout Kernel (Software Abstract) 10.4230/LIPIcs.GD.2024.56
• Stefan P. Feyer, Wilhelm Kerle-Malcharek, Ying Zhang, Falk Schreiber, and Karsten Klein Immersive Analytics of Graphs in Virtual Reality with GAV-VR (Software Abstract) 10.4230/LIPIcs.GD.2024.57
• Julius Deynet, Tim Hegemann, Sebastian Kempf, and Alexander Wolff Graph Harvester (Software Abstract) 10.4230/LIPIcs.GD.2024.58
• Garima Jindal and Kamalakar Karlapalem CentralityViz: Comprehending Node-Centrality in Large Networks (Software Abstract) 10.4230/LIPIcs.GD.2024.59
• Harald Meier and Arber Ceni NodeXL - A few Clicks to Network Insights (Software Abstract) 10.4230/LIPIcs.GD.2024.60
• Andreas Benno Kollegger, Alexander Erdl, and Michael Hunger Knowledge Graph Builder - Constructing a Graph from Arbitrary Text Using an LLM (Software Abstract) 10.4230/LIPIcs.GD.2024.61