<h2>LIPIcs, Volume 294, SWAT 2024</h2>
<ul>
<li>
<span class="authors">Hans L. Bodlaender</span>
<span class="title">LIPIcs, Volume 294, SWAT 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024">10.4230/LIPIcs.SWAT.2024</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.0">10.4230/LIPIcs.SWAT.2024.0</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, and Alexander Wolff</span>
<span class="title">Eliminating Crossings in Ordered Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.1">10.4230/LIPIcs.SWAT.2024.1</a>
</li>
<li>
<span class="authors">Stav Ashur and Sariel Har-Peled</span>
<span class="title">Local Spanners Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.2">10.4230/LIPIcs.SWAT.2024.2</a>
</li>
<li>
<span class="authors">Lora Bailey, Heather Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, and Alexander Wiedemann</span>
<span class="title">Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.3">10.4230/LIPIcs.SWAT.2024.3</a>
</li>
<li>
<span class="authors">Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, and Kunihiko Sadakane</span>
<span class="title">Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.4">10.4230/LIPIcs.SWAT.2024.4</a>
</li>
<li>
<span class="authors">Robert D. Barish and Tetsuo Shibuya</span>
<span class="title">Recognition and Proper Coloring of Unit Segment Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.5">10.4230/LIPIcs.SWAT.2024.5</a>
</li>
<li>
<span class="authors">Cristina Bazgan, André Nichterlein, and Sofia Vazquez Alferez</span>
<span class="title">Destroying Densest Subgraphs Is Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.6">10.4230/LIPIcs.SWAT.2024.6</a>
</li>
<li>
<span class="authors">Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanič, Peter Muršič, and Robert Scheffler</span>
<span class="title">The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.7">10.4230/LIPIcs.SWAT.2024.7</a>
</li>
<li>
<span class="authors">Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, and Blair D. Sullivan</span>
<span class="title">Correlation Clustering with Vertex Splitting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.8">10.4230/LIPIcs.SWAT.2024.8</a>
</li>
<li>
<span class="authors">Ioana O. Bercea, Jakob Bæk Tejs Houen, and Rasmus Pagh</span>
<span class="title">Daisy Bloom Filters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.9">10.4230/LIPIcs.SWAT.2024.9</a>
</li>
<li>
<span class="authors">Magnus Berg and Shahin Kamali</span>
<span class="title">Online Bin Covering with Frequency Predictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.10">10.4230/LIPIcs.SWAT.2024.10</a>
</li>
<li>
<span class="authors">Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, and Jean-Florent Raymond</span>
<span class="title">Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.11">10.4230/LIPIcs.SWAT.2024.11</a>
</li>
<li>
<span class="authors">Sayan Bhattacharya, Martín Costa, Nadav Panski, and Shay Solomon</span>
<span class="title">Arboricity-Dependent Algorithms for Edge Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.12">10.4230/LIPIcs.SWAT.2024.12</a>
</li>
<li>
<span class="authors">Therese Biedl, Prosenjit Bose, and Babak Miraftab</span>
<span class="title">On the Independence Number of 1-Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.13">10.4230/LIPIcs.SWAT.2024.13</a>
</li>
<li>
<span class="authors">Philip Bille, Yakov Nekrich, and Solon P. Pissis</span>
<span class="title">Size-Constrained Weighted Ancestors with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.14">10.4230/LIPIcs.SWAT.2024.14</a>
</li>
<li>
<span class="authors">Lotte Blank and Anne Driemel</span>
<span class="title">Range Reporting for Time Series via Rectangle Stabbing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.15">10.4230/LIPIcs.SWAT.2024.15</a>
</li>
<li>
<span class="authors">Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, and Denis Pankratov</span>
<span class="title">On the Online Weighted Non-Crossing Matching Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.16">10.4230/LIPIcs.SWAT.2024.16</a>
</li>
<li>
<span class="authors">Gerth Stølting Brodal and Sebastian Wild</span>
<span class="title">Deterministic Cache-Oblivious Funnelselect</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.17">10.4230/LIPIcs.SWAT.2024.17</a>
</li>
<li>
<span class="authors">Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Lukas Plätz, Lea Thiel, and Sampson Wong</span>
<span class="title">Dynamic L-Budget Clustering of Curves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.18">10.4230/LIPIcs.SWAT.2024.18</a>
</li>
<li>
<span class="authors">Benjamin Merlin Bumpus, Bart M. P. Jansen, and Jaime Venne</span>
<span class="title">Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.19">10.4230/LIPIcs.SWAT.2024.19</a>
</li>
<li>
<span class="authors">Aleksander B. G. Christiansen, Eva Rotenberg, and Juliette Vlieghe</span>
<span class="title">Sparsity-Parameterised Dynamic Edge Colouring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.20">10.4230/LIPIcs.SWAT.2024.20</a>
</li>
<li>
<span class="authors">Seyed Parsa Darbouy and Zachary Friggstad</span>
<span class="title">Approximating Minimum Sum Coloring with Bundles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.21">10.4230/LIPIcs.SWAT.2024.21</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Saket Saurabh</span>
<span class="title">Stability in Graphs with Matroid Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.22">10.4230/LIPIcs.SWAT.2024.22</a>
</li>
<li>
<span class="authors">Zachary Friggstad and Hao Sun</span>
<span class="title">A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.23">10.4230/LIPIcs.SWAT.2024.23</a>
</li>
<li>
<span class="authors">Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, and Miloš Stojaković</span>
<span class="title">Optimizing Symbol Visibility Through Displacement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.24">10.4230/LIPIcs.SWAT.2024.24</a>
</li>
<li>
<span class="authors">Auguste H. Gezalyan, Soo H. Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic, and David M. Mount</span>
<span class="title">Delaunay Triangulations in the Hilbert Metric</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.25">10.4230/LIPIcs.SWAT.2024.25</a>
</li>
<li>
<span class="authors">Sariel Har-Peled and Eliot W. Robson</span>
<span class="title">No-Dimensional Tverberg Partitions Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.26">10.4230/LIPIcs.SWAT.2024.26</a>
</li>
<li>
<span class="authors">Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen, and Valentin Polishchuk</span>
<span class="title">Optimizing Visibility-Based Search in Polygonal Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.27">10.4230/LIPIcs.SWAT.2024.27</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Ruben F. A. Verhaegh</span>
<span class="title">Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.28">10.4230/LIPIcs.SWAT.2024.28</a>
</li>
<li>
<span class="authors">Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, and Erik Jan van Leeuwen</span>
<span class="title">Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.29">10.4230/LIPIcs.SWAT.2024.29</a>
</li>
<li>
<span class="authors">Naonori Kakimura and Ildikó Schlotter</span>
<span class="title">Parameterized Complexity of Submodular Minimization Under Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.30">10.4230/LIPIcs.SWAT.2024.30</a>
</li>
<li>
<span class="authors">Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, and Bettina Speckmann</span>
<span class="title">Optimal In-Place Compaction of Sliding Cubes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.31">10.4230/LIPIcs.SWAT.2024.31</a>
</li>
<li>
<span class="authors">Michael Levet, Puck Rombach, and Nicholas Sieger</span>
<span class="title">Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.32">10.4230/LIPIcs.SWAT.2024.32</a>
</li>
<li>
<span class="authors">Anand Louis, Rameesh Paul, and Arka Ray</span>
<span class="title">Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.33">10.4230/LIPIcs.SWAT.2024.33</a>
</li>
<li>
<span class="authors"> MIT-NASA Space Robots Team, Josh Brunner, Kenneth C. Cheung, Erik D. Demaine, Jenny Diomidova, Christine Gregg, Della H. Hendrickson, and Irina Kostitsyna</span>
<span class="title">Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.34">10.4230/LIPIcs.SWAT.2024.34</a>
</li>
<li>
<span class="authors">Daniel Mock and Peter Rossmanith</span>
<span class="title">Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.35">10.4230/LIPIcs.SWAT.2024.35</a>
</li>
<li>
<span class="authors">Ofer Neiman and Idan Shabat</span>
<span class="title">Path-Reporting Distance Oracles with Linear Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.36">10.4230/LIPIcs.SWAT.2024.36</a>
</li>
<li>
<span class="authors">Christian Ortlieb and Jens M. Schmidt</span>
<span class="title">Toward Grünbaum’s Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.37">10.4230/LIPIcs.SWAT.2024.37</a>
</li>
<li>
<span class="authors">Yota Otachi, Akira Suzuki, and Yuma Tamura</span>
<span class="title">Finding Induced Subgraphs from Graphs with Small Mim-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.38">10.4230/LIPIcs.SWAT.2024.38</a>
</li>
<li>
<span class="authors">Benjamin Rockel-Wolff</span>
<span class="title">A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.39">10.4230/LIPIcs.SWAT.2024.39</a>
</li>
<li>
<span class="authors">Mohammad R. Salavatipour and Lijiangnan Tian</span>
<span class="title">Approximation Algorithms for the Airport and Railway Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2024.40">10.4230/LIPIcs.SWAT.2024.40</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