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