LIPIcs, Volume 322, ISAAC 2024

• Julián Mestre and Anthony Wirth LIPIcs, Volume 322, ISAAC 2024, Complete Volume 10.4230/LIPIcs.ISAAC.2024
• Julián Mestre and Anthony Wirth Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ISAAC.2024.0
• Ravi Kumar Algorithmic Problems in Discrete Choice (Invited Talk) 10.4230/LIPIcs.ISAAC.2024.1
• Olga Ohrimenko Data Privacy: The Land Where Average Cases Don't Exist and Assumptions Quickly Perish (Invited Talk) 10.4230/LIPIcs.ISAAC.2024.2
• Barna Saha Role of Structured Matrices in Fine-Grained Algorithm Design (Invited Talk) 10.4230/LIPIcs.ISAAC.2024.3
• Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, and Csaba D. Tóth Minimum Plane Bichromatic Spanning Trees 10.4230/LIPIcs.ISAAC.2024.4
• Taehoon Ahn and Sang Won Bae Constrained Two-Line Center Problems 10.4230/LIPIcs.ISAAC.2024.5
• Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, and Chanho Song Dynamic Parameterized Problems on Unit Disk Graphs 10.4230/LIPIcs.ISAAC.2024.6
• Hyung-Chan An and Mong-Jen Kao On the Connected Minimum Sum of Radii Problem 10.4230/LIPIcs.ISAAC.2024.7
• Sunny Atalig, Alexander Hickerson, Arrdya Srivastav, Tingting Zheng, and Marek Chrobak Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths 10.4230/LIPIcs.ISAAC.2024.8
• Shivam Bansal, Keerti Choudhary, Harkirat Dhanoa, and Harsh Wardhan Fault-Tolerant Bounded Flow Preservers 10.4230/LIPIcs.ISAAC.2024.9
• Koustav Bhanja Optimal Sensitivity Oracle for Steiner Mincut 10.4230/LIPIcs.ISAAC.2024.10
• Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, and Alessandro Straziota Temporal Queries for Dynamic Temporal Forests 10.4230/LIPIcs.ISAAC.2024.11
• Samuel Bismuth, Vladislav Makarov, Erel Segal-Halevi, and Dana Shapira Partitioning Problems with Splittings and Interval Targets 10.4230/LIPIcs.ISAAC.2024.12
• Markus Bläser, Julian Dörfler, Maciej Liśkiewicz, and Benito van der Zander The Existential Theory of the Reals with Summation Operators 10.4230/LIPIcs.ISAAC.2024.13
• Prosenjit Bose, Jean-Lou De Carufel, and John Stuart Routing from Pentagon to Octagon Delaunay Graphs 10.4230/LIPIcs.ISAAC.2024.14
• Prosenjit Bose, Darryl Hill, Michiel Smid, and Tyler Tuttle On the Spanning and Routing Ratios of the Yao-Four Graph 10.4230/LIPIcs.ISAAC.2024.15
• Lena Carta, Lukas Drexler, Annika Hennes, Clemens Rösner, and Melanie Schmidt FPT Approximations for Fair k-Min-Sum-Radii 10.4230/LIPIcs.ISAAC.2024.16
• Sankardeep Chakraborty, Seungbum Jo, Geunho Kim, and Kunihiko Sadakane Succinct Data Structures for Baxter Permutation and Related Families 10.4230/LIPIcs.ISAAC.2024.17
• Sankardeep Chakraborty, Kunihiko Sadakane, and Wiktor Zuba Enhancing Generalized Compressed Suffix Trees, with Applications 10.4230/LIPIcs.ISAAC.2024.18
• Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, and Prafullkumar Tale Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover 10.4230/LIPIcs.ISAAC.2024.19
• Lin Chen, Yixiong Gao, Minming Li, Guohui Lin, and Kai Wang Revisit the Scheduling Problem with Calibrations 10.4230/LIPIcs.ISAAC.2024.20
• Kyungjin Cho and Eunjin Oh Mimicking Networks for Constrained Multicuts in Hypergraphs 10.4230/LIPIcs.ISAAC.2024.21
• Emily Clark, Chloe Georgiou, Katelyn Poon, and Marek Chrobak On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps 10.4230/LIPIcs.ISAAC.2024.22
• Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, and Ignaz Rutter Simple Realizability of Abstract Topological Graphs 10.4230/LIPIcs.ISAAC.2024.23
• Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, and Meirav Zehavi Exact Algorithms for Clustered Planarity with Linear Saturators 10.4230/LIPIcs.ISAAC.2024.24
• Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, and Jules Wulms The Complexity of Geodesic Spanners Using Steiner Points 10.4230/LIPIcs.ISAAC.2024.25
• Thomas Depian, Martin Nöllenburg, Soeren Terziadis, and Markus Wallinger Constrained Boundary Labeling 10.4230/LIPIcs.ISAAC.2024.26
• Palash Dey, Ashlesha Hota, Sudeshna Kolay, and Sipra Singh Knapsack with Vertex Cover, Set Cover, and Hitting Set 10.4230/LIPIcs.ISAAC.2024.27
• Szilárd Zsolt Fazekas, Tore Koß, Florin Manea, Robert Mercaş, and Timo Specht Subsequence Matching and Analysis Problems for Formal Languages 10.4230/LIPIcs.ISAAC.2024.28
• Sándor P. Fekete, Ramin Kosfeld, Peter Kramer, Jonas Neutzner, Christian Rieck, and Christian Scheffer Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain 10.4230/LIPIcs.ISAAC.2024.29
• Alexander Firbas and Manuel Sorge On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting 10.4230/LIPIcs.ISAAC.2024.30
• Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, and Dániel Marx From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges 10.4230/LIPIcs.ISAAC.2024.31
• Jaroslav Garvardt, Christian Komusiewicz, and Nils Morawietz When Can Cluster Deletion with Bounded Weights Be Solved Efficiently? 10.4230/LIPIcs.ISAAC.2024.32
• Erwin Glazenburg, Thijs van der Horst, Tom Peters, Bettina Speckmann, and Frank Staals Robust Bichromatic Classification Using Two Lines 10.4230/LIPIcs.ISAAC.2024.33
• Erwin Glazenburg, Marc van Kreveld, and Frank Staals Robust Classification of Dynamic Bichromatic Point Sets in R² 10.4230/LIPIcs.ISAAC.2024.34
• Petr Gregor, Hung P. Hoang, Arturo Merino, and Ondřej Mička Generating All Invertible Matrices by Row Operations 10.4230/LIPIcs.ISAAC.2024.35
• Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, and Sebastian Siebertz Kernelization Complexity of Solution Discovery Problems 10.4230/LIPIcs.ISAAC.2024.36
• Joachim Gudmundsson, Tiancheng Mai, and Sampson Wong Approximating the Fréchet Distance When Only One Curve Is c-Packed 10.4230/LIPIcs.ISAAC.2024.37
• Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, and Rin Saito Basis Sequence Reconfiguration in the Union of Matroids 10.4230/LIPIcs.ISAAC.2024.38
• Tesshu Hanaka, Noleen Köhler, and Michael Lampis Core Stability in Additively Separable Hedonic Games of Low Treewidth 10.4230/LIPIcs.ISAAC.2024.39
• Petr Hliněný and Liana Khazaliya Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width) 10.4230/LIPIcs.ISAAC.2024.40
• Ashwin Jacob, Diptapriyo Majumdar, and Meirav Zehavi A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees 10.4230/LIPIcs.ISAAC.2024.41
• Shunhua Jiang, Victor Lecomte, Omri Weinstein, and Sorrachai Yingchareonthawornchai Hardness Amplification for Dynamic Binary Search Trees 10.4230/LIPIcs.ISAAC.2024.42
• Naonori Kakimura and Yuta Mishima Reconfiguration of Labeled Matchings in Triangular Grid Graphs 10.4230/LIPIcs.ISAAC.2024.43
• Susumu Kubo, Kazuhisa Makino, and Souta Sakamoto Composition Orderings for Linear Functions and Matrix Multiplication Orderings 10.4230/LIPIcs.ISAAC.2024.44
• Qian Li, Minghui Ouyang, and Yuyi Wang A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems 10.4230/LIPIcs.ISAAC.2024.45
• William Lochet and Roohani Sharma Uniform Polynomial Kernel for Deletion to K_{2,p} Minor-Free Graphs 10.4230/LIPIcs.ISAAC.2024.46
• Vadim Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark Siggers, Siani Smith, and Erik Jan van Leeuwen Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs 10.4230/LIPIcs.ISAAC.2024.47
• Bodo Manthey, Nils Morawietz, Jesse van Rhijn, and Frank Sommer Complexity of Local Search for Euclidean Clustering Problems 10.4230/LIPIcs.ISAAC.2024.48
• Mathieu Mari, Michał Pawłowski, Runtian Ren, and Piotr Sankowski Online Multi-Level Aggregation with Delays and Stochastic Arrivals 10.4230/LIPIcs.ISAAC.2024.49
• Neeldhara Misra, Harshil Mittal, and Ashutosh Rai On the Parameterized Complexity of Diverse SAT 10.4230/LIPIcs.ISAAC.2024.50
• MIT Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock, and Zixiang Zhou Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs 10.4230/LIPIcs.ISAAC.2024.51
• Kengo Nakamura, Masaaki Nishino, and Shuhei Denzumi Single Family Algebra Operation on BDDs and ZDDs Leads to Exponential Blow-Up 10.4230/LIPIcs.ISAAC.2024.52
• Ambar Pal, Rajiv Raman, Saurabh Ray, and Karamjeet Singh A Fast Algorithm for Computing a Planar Support for Non-Piercing Rectangles 10.4230/LIPIcs.ISAAC.2024.53
• Daniel Paul-Pena and C. Seshadhri A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs 10.4230/LIPIcs.ISAAC.2024.54
• Thore Thießen and Jan Vahrenhold Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues 10.4230/LIPIcs.ISAAC.2024.55
• Ivor van der Hoog, Eva Rotenberg, and Sampson Wong Data Structures for Approximate Fréchet Distance for Realistic Curves 10.4230/LIPIcs.ISAAC.2024.56
• Michał Włodarczyk Constant Approximating Disjoint Paths on Acyclic Digraphs Is W[1]-Hard 10.4230/LIPIcs.ISAAC.2024.57
• Michał Włodarczyk Does Subset Sum Admit Short Proofs? 10.4230/LIPIcs.ISAAC.2024.58
• Jingyang Zhao and Mingyu Xiao Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands 10.4230/LIPIcs.ISAAC.2024.59