LIPIcs, Volume 294, SWAT 2024

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