<h2>LIPIcs, Volume 320, GD 2024</h2>
<ul>
<li>
<span class="authors">Stefan Felsner and Karsten Klein</span>
<span class="title">LIPIcs, Volume 320, GD 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024">10.4230/LIPIcs.GD.2024</a>
</li>
<li>
<span class="authors">Stefan Felsner and Karsten Klein</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.0">10.4230/LIPIcs.GD.2024.0</a>
</li>
<li>
<span class="authors">Otfried Cheong</span>
<span class="title">How Can Biclique Covers Help in Matching Problems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.1">10.4230/LIPIcs.GD.2024.1</a>
</li>
<li>
<span class="authors">Monika Henzinger</span>
<span class="title">How Can Algorithms Help in Protecting Our Privacy (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.2">10.4230/LIPIcs.GD.2024.2</a>
</li>
<li>
<span class="authors">Sebastiano Cultrera di Montesano, Ondřej Draganov, Herbert Edelsbrunner, and Morteza Saghafian</span>
<span class="title">The Euclidean MST-Ratio for Bi-Colored Lattices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.3">10.4230/LIPIcs.GD.2024.3</a>
</li>
<li>
<span class="authors">Jacob Fox, János Pach, and Andrew Suk</span>
<span class="title">Enumeration of Intersection Graphs of x-Monotone Curves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.4">10.4230/LIPIcs.GD.2024.4</a>
</li>
<li>
<span class="authors">Helena Bergold, Joachim Orthaber, Manfred Scheucher, and Felix Schröder</span>
<span class="title">Holes in Convex and Simple Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.5">10.4230/LIPIcs.GD.2024.5</a>
</li>
<li>
<span class="authors">Panna Gehér and Géza Tóth</span>
<span class="title">1-Planar Unit Distance Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.6">10.4230/LIPIcs.GD.2024.6</a>
</li>
<li>
<span class="authors">Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, and Torsten Ueckerdt</span>
<span class="title">The Density Formula: One Lemma to Bound Them All</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.7">10.4230/LIPIcs.GD.2024.7</a>
</li>
<li>
<span class="authors">Petr Hliněný and Lili Ködmön</span>
<span class="title">Note on Min- k-Planar Drawings of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.8">10.4230/LIPIcs.GD.2024.8</a>
</li>
<li>
<span class="authors">Adrian Dumitrescu and János Pach</span>
<span class="title">Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.9">10.4230/LIPIcs.GD.2024.9</a>
</li>
<li>
<span class="authors">Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, and Ignaz Rutter</span>
<span class="title">Constrained Outer-String Representations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.10">10.4230/LIPIcs.GD.2024.10</a>
</li>
<li>
<span class="authors">Steven Chaplick, Henry Förster, Michael Hoffmann, and Michael Kaufmann</span>
<span class="title">Monotone Arc Diagrams with Few Biarcs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.11">10.4230/LIPIcs.GD.2024.11</a>
</li>
<li>
<span class="authors">Thomas Depian, Simon D. Fink, Robert Ganian, and Martin Nöllenburg</span>
<span class="title">The Parameterized Complexity Of Extending Stack Layouts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.12">10.4230/LIPIcs.GD.2024.12</a>
</li>
<li>
<span class="authors">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</span>
<span class="title">The Price of Upwardness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.13">10.4230/LIPIcs.GD.2024.13</a>
</li>
<li>
<span class="authors">Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, and Alexander Wolff</span>
<span class="title">Bounding the Treewidth of Outer k-Planar Graphs via Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.14">10.4230/LIPIcs.GD.2024.14</a>
</li>
<li>
<span class="authors">Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, and Markus Wallinger</span>
<span class="title">Bundling-Aware Graph Drawing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.15">10.4230/LIPIcs.GD.2024.15</a>
</li>
<li>
<span class="authors">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</span>
<span class="title">GraphTrials: Visual Proofs of Graph Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.16">10.4230/LIPIcs.GD.2024.16</a>
</li>
<li>
<span class="authors">Amyra Meidiana, Seok-Hee Hong, and Yongcheng Jing</span>
<span class="title">Connectivity-Faithful Graph Drawing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.17">10.4230/LIPIcs.GD.2024.17</a>
</li>
<li>
<span class="authors">Martin Balko, Petr Hliněný, Tomáš Masařík, Joachim Orthaber, Birgit Vogtenhuber, and Mirko H. Wagner</span>
<span class="title">On the Uncrossed Number of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.18">10.4230/LIPIcs.GD.2024.18</a>
</li>
<li>
<span class="authors">Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, and Ioannis G. Tollis</span>
<span class="title">Weakly Leveled Planarity with Bounded Span</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.19">10.4230/LIPIcs.GD.2024.19</a>
</li>
<li>
<span class="authors">Susanna Caroppo, Giordano Da Lozzo, and Giuseppe Di Battista</span>
<span class="title">Quantum Algorithms for One-Sided Crossing Minimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.20">10.4230/LIPIcs.GD.2024.20</a>
</li>
<li>
<span class="authors">Gavin J. Mooney, Helen C. Purchase, Michael Wybrow, Stephen G. Kobourov, and Jacob Miller</span>
<span class="title">The Perception of Stress in Graph Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.21">10.4230/LIPIcs.GD.2024.21</a>
</li>
<li>
<span class="authors">Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, and Jules Wulms</span>
<span class="title">Boundary Labeling in a Circular Orbit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.22">10.4230/LIPIcs.GD.2024.22</a>
</li>
<li>
<span class="authors">Laura Merker, Lena Scherzer, Samuel Schneider, and Torsten Ueckerdt</span>
<span class="title">Intersection Graphs with and Without Product Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.23">10.4230/LIPIcs.GD.2024.23</a>
</li>
<li>
<span class="authors">Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, and Maurizio Patrignani</span>
<span class="title">Upward Pointset Embeddings of Planar st-Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.24">10.4230/LIPIcs.GD.2024.24</a>
</li>
<li>
<span class="authors">Miriam Münch and Ignaz Rutter</span>
<span class="title">Parameterized Algorithms for Beyond-Planar Crossing Numbers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.25">10.4230/LIPIcs.GD.2024.25</a>
</li>
<li>
<span class="authors">Tim Hegemann and Alexander Wolff</span>
<span class="title">Storylines with a Protagonist</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.26">10.4230/LIPIcs.GD.2024.26</a>
</li>
<li>
<span class="authors">Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmović, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, and Alexandra Weinberger</span>
<span class="title">On k-Planar Graphs Without Short Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.27">10.4230/LIPIcs.GD.2024.27</a>
</li>
<li>
<span class="authors">Aaron Büngener and Maximilian Pfister</span>
<span class="title">On the Edge Density of Bipartite 3-Planar and Bipartite Gap-Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.28">10.4230/LIPIcs.GD.2024.28</a>
</li>
<li>
<span class="authors">Aaron Büngener and Michael Kaufmann</span>
<span class="title">Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.29">10.4230/LIPIcs.GD.2024.29</a>
</li>
<li>
<span class="authors">Rohan Acharya, Torsten Mütze, and Francesco Verciani</span>
<span class="title">Flips in Colorful Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.30">10.4230/LIPIcs.GD.2024.30</a>
</li>
<li>
<span class="authors">Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, and Martin Nöllenburg</span>
<span class="title">Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.31">10.4230/LIPIcs.GD.2024.31</a>
</li>
<li>
<span class="authors">Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, and Fabrizio Montecchiani</span>
<span class="title">On the Complexity of Recognizing k^+-Real Face Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.32">10.4230/LIPIcs.GD.2024.32</a>
</li>
<li>
<span class="authors">Markus Chimani, Torben Donzelmann, Nick Kloster, Melissa Koch, Jan-Jakob Völlering, and Mirko H. Wagner</span>
<span class="title">Crossing Numbers of Beyond Planar Graphs Re-Revisited: A Framework Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.33">10.4230/LIPIcs.GD.2024.33</a>
</li>
<li>
<span class="authors">Oswin Aichholzer, Joachim Orthaber, and Birgit Vogtenhuber</span>
<span class="title">Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.34">10.4230/LIPIcs.GD.2024.34</a>
</li>
<li>
<span class="authors">Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, and Ignaz Rutter</span>
<span class="title">On k-Plane Insertion into Plane Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.35">10.4230/LIPIcs.GD.2024.35</a>
</li>
<li>
<span class="authors">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</span>
<span class="title">Noncrossing Longest Paths and Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.36">10.4230/LIPIcs.GD.2024.36</a>
</li>
<li>
<span class="authors">Vida Dujmović and Camille La Rose</span>
<span class="title">Rectilinear Crossing Number of Graphs Excluding a Single-Crossing Graph as a Minor</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.37">10.4230/LIPIcs.GD.2024.37</a>
</li>
<li>
<span class="authors">Daniel J. Chang and Timothy Sun</span>
<span class="title">Harborth’s Conjecture for 4-Regular Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.38">10.4230/LIPIcs.GD.2024.38</a>
</li>
<li>
<span class="authors">David Eppstein, Michael T. Goodrich, and Abraham M. Illickan</span>
<span class="title">Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.39">10.4230/LIPIcs.GD.2024.39</a>
</li>
<li>
<span class="authors">Therese Biedl, Anna Lubiw, and Jack Spalding-Jamieson</span>
<span class="title">Morphing Planar Graph Drawings via Orthogonal Box Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.40">10.4230/LIPIcs.GD.2024.40</a>
</li>
<li>
<span class="authors">Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, and Jules Wulms</span>
<span class="title">Graph Drawing Contest Report (Graph Drawing Contest Report)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.41">10.4230/LIPIcs.GD.2024.41</a>
</li>
<li>
<span class="authors">Joshua Geis and Johannes Zink</span>
<span class="title">From Planar via Outerplanar to Outerpath – Engineering NP-Hardness Constructions (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.42">10.4230/LIPIcs.GD.2024.42</a>
</li>
<li>
<span class="authors">Robert Ganian, Martin Nöllenburg, and Sebastian Röder</span>
<span class="title">Minimizing Switches in Cased Graph Drawings (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.43">10.4230/LIPIcs.GD.2024.43</a>
</li>
<li>
<span class="authors">Markus Chimani, Lea Kröger, Juliane Liedtke, Jonah Mevert, Maor Shani, and Maarten van Zalk</span>
<span class="title">Graph-Drawing Supported Identification of Influential Students at Schools (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.44">10.4230/LIPIcs.GD.2024.44</a>
</li>
<li>
<span class="authors">Martin Nöllenburg, Sebastian Röder, and Markus Wallinger</span>
<span class="title">GdMetriX - A NetworkX Extension For Graph Drawing Metrics (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.45">10.4230/LIPIcs.GD.2024.45</a>
</li>
<li>
<span class="authors">Nikolaus-Mathias Herl and Velitchko Filipov</span>
<span class="title">AdMaTilE: Visualizing Event-Based Adjacency Matrices in a Multiple-Coordinated-Views System (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.46">10.4230/LIPIcs.GD.2024.46</a>
</li>
<li>
<span class="authors">Maarten Löffler</span>
<span class="title">Strict Upward Planar Grid Drawings of Binary Trees with Minimal Area (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.47">10.4230/LIPIcs.GD.2024.47</a>
</li>
<li>
<span class="authors">Sören Domrös and Reinhard von Hanxleden</span>
<span class="title">Determining Sugiyama Topology with Model Order (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.48">10.4230/LIPIcs.GD.2024.48</a>
</li>
<li>
<span class="authors">Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, and Tommaso Piselli</span>
<span class="title">Introducing Fairness in Graph Visualization (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.49">10.4230/LIPIcs.GD.2024.49</a>
</li>
<li>
<span class="authors">Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, and Peter Stumpf</span>
<span class="title">Level Planarity Is More Difficult Than We Thought (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.50">10.4230/LIPIcs.GD.2024.50</a>
</li>
<li>
<span class="authors">Jakob Baumann, Ignaz Rutter, and Dirk Sudholt</span>
<span class="title">Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.51">10.4230/LIPIcs.GD.2024.51</a>
</li>
<li>
<span class="authors">Alvin Chiu, Ahmed Eldawy, and Michael T. Goodrich</span>
<span class="title">Polygonally Anchored Graph Drawing (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.52">10.4230/LIPIcs.GD.2024.52</a>
</li>
<li>
<span class="authors">Stephane Durocher, Myroslav Kryven, and Maarten Löffler</span>
<span class="title">String Graph with Cop Number 4 (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.53">10.4230/LIPIcs.GD.2024.53</a>
</li>
<li>
<span class="authors">Oriol Solé Pi</span>
<span class="title">Approximating the Crossing Number of Dense Graphs (Poster Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.54">10.4230/LIPIcs.GD.2024.54</a>
</li>
<li>
<span class="authors">Evmorfia Argyriou and Benjamin Niedermann</span>
<span class="title">yFiles - From Data to Meaningful Visualizations (Software Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.55">10.4230/LIPIcs.GD.2024.55</a>
</li>
<li>
<span class="authors">Maximilian Kasperowski, Sören Domrös, and Reinhard von Hanxleden</span>
<span class="title">The Eclipse Layout Kernel (Software Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.56">10.4230/LIPIcs.GD.2024.56</a>
</li>
<li>
<span class="authors">Stefan P. Feyer, Wilhelm Kerle-Malcharek, Ying Zhang, Falk Schreiber, and Karsten Klein</span>
<span class="title">Immersive Analytics of Graphs in Virtual Reality with GAV-VR (Software Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.57">10.4230/LIPIcs.GD.2024.57</a>
</li>
<li>
<span class="authors">Julius Deynet, Tim Hegemann, Sebastian Kempf, and Alexander Wolff</span>
<span class="title">Graph Harvester (Software Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.58">10.4230/LIPIcs.GD.2024.58</a>
</li>
<li>
<span class="authors">Garima Jindal and Kamalakar Karlapalem</span>
<span class="title">CentralityViz: Comprehending Node-Centrality in Large Networks (Software Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.59">10.4230/LIPIcs.GD.2024.59</a>
</li>
<li>
<span class="authors">Harald Meier and Arber Ceni</span>
<span class="title">NodeXL - A few Clicks to Network Insights (Software Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.60">10.4230/LIPIcs.GD.2024.60</a>
</li>
<li>
<span class="authors">Andreas Benno Kollegger, Alexander Erdl, and Michael Hunger</span>
<span class="title">Knowledge Graph Builder - Constructing a Graph from Arbitrary Text Using an LLM (Software Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.GD.2024.61">10.4230/LIPIcs.GD.2024.61</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing