<h2>LIPIcs, Volume 308, ESA 2024</h2>
<ul>
<li>
<span class="authors">Timothy Chan, Johannes Fischer, John Iacono, and Grzegorz Herman</span>
<span class="title">LIPIcs, Volume 308, ESA 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024">10.4230/LIPIcs.ESA.2024</a>
</li>
<li>
<span class="authors">Timothy Chan, Johannes Fischer, John Iacono, and Grzegorz Herman</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.0">10.4230/LIPIcs.ESA.2024.0</a>
</li>
<li>
<span class="authors">Vincent Cohen-Addad</span>
<span class="title">Recent Progress on Correlation Clustering: From Local Algorithms to Better Approximation Algorithms and Back (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.1">10.4230/LIPIcs.ESA.2024.1</a>
</li>
<li>
<span class="authors">Eva Rotenberg</span>
<span class="title">Simple (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.2">10.4230/LIPIcs.ESA.2024.2</a>
</li>
<li>
<span class="authors">Amir Abboud, Tomer Grossman, Moni Naor, and Tomer Solomon</span>
<span class="title">From Donkeys to Kings in Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.3">10.4230/LIPIcs.ESA.2024.3</a>
</li>
<li>
<span class="authors">Amir Abboud and Nathan Wallheimer</span>
<span class="title">Worst-Case to Expander-Case Reductions: Derandomized and Generalized</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.4">10.4230/LIPIcs.ESA.2024.4</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, and László Kozma</span>
<span class="title">Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.5">10.4230/LIPIcs.ESA.2024.5</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Esther Ezra, and Micha Sharir</span>
<span class="title">Lower Envelopes of Surface Patches in 3-Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.6">10.4230/LIPIcs.ESA.2024.6</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, and Micha Sharir</span>
<span class="title">Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.7">10.4230/LIPIcs.ESA.2024.7</a>
</li>
<li>
<span class="authors">Cezar-Mihail Alexandru and Christian Konrad</span>
<span class="title">Interval Selection in Sliding Windows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.8">10.4230/LIPIcs.ESA.2024.8</a>
</li>
<li>
<span class="authors">Enver Aman, Karthik C. S., and Sharath Punna</span>
<span class="title">On Connections Between k-Coloring and Euclidean k-Means</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.9">10.4230/LIPIcs.ESA.2024.9</a>
</li>
<li>
<span class="authors">Shinwoo An, Eunjin Oh, and Jie Xue</span>
<span class="title">Sparse Outerstring Graphs Have Logarithmic Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.10">10.4230/LIPIcs.ESA.2024.10</a>
</li>
<li>
<span class="authors">Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, and Armin Wells</span>
<span class="title">How to Reduce Temporal Cliques to Find Sparse Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.11">10.4230/LIPIcs.ESA.2024.11</a>
</li>
<li>
<span class="authors">Vipul Arora, Arnab Bhattacharyya, Mathews Boban, Venkatesan Guruswami, and Esty Kelman</span>
<span class="title">Outlier Robust Multivariate Polynomial Regression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.12">10.4230/LIPIcs.ESA.2024.12</a>
</li>
<li>
<span class="authors">Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, and Hsin-Hao Su</span>
<span class="title">Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.13">10.4230/LIPIcs.ESA.2024.13</a>
</li>
<li>
<span class="authors">Yuhang Bai, Kristóf Bérczi, Gergely Csáji, and Tamás Schwarcz</span>
<span class="title">Approximating Maximum-Size Properly Colored Forests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.14">10.4230/LIPIcs.ESA.2024.14</a>
</li>
<li>
<span class="authors">Júlia Baligács, Yann Disser, Andreas Emil Feldmann, and Anna Zych-Pawlewicz</span>
<span class="title">A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.15">10.4230/LIPIcs.ESA.2024.15</a>
</li>
<li>
<span class="authors">Aranya Banerjee, Daniel Gibney, and Sharma V. Thankachan</span>
<span class="title">Longest Common Substring with Gaps and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.16">10.4230/LIPIcs.ESA.2024.16</a>
</li>
<li>
<span class="authors">Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, and Saket Saurabh</span>
<span class="title">Cuts in Graphs with Matroid Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.17">10.4230/LIPIcs.ESA.2024.17</a>
</li>
<li>
<span class="authors">Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, and Simon J. Puglisi</span>
<span class="title">Height-Bounded Lempel-Ziv Encodings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.18">10.4230/LIPIcs.ESA.2024.18</a>
</li>
<li>
<span class="authors">Gabriel Bathie, Panagiotis Charalampopoulos, and Tatiana Starikovskaya</span>
<span class="title">Longest Common Extensions with Wildcards: Trade-Off and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.19">10.4230/LIPIcs.ESA.2024.19</a>
</li>
<li>
<span class="authors">Gabriel Bathie, Panagiotis Charalampopoulos, and Tatiana Starikovskaya</span>
<span class="title">Pattern Matching with Mismatches and Wildcards</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.20">10.4230/LIPIcs.ESA.2024.20</a>
</li>
<li>
<span class="authors">Tatiana Belova, Nikolai Chukhin, Alexander S. Kulikov, and Ivan Mihajlin</span>
<span class="title">Improved Space Bounds for Subset Sum</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.21">10.4230/LIPIcs.ESA.2024.21</a>
</li>
<li>
<span class="authors">Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, and Shubhang Kulkarni</span>
<span class="title">Hypergraph Connectivity Augmentation in Strongly Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.22">10.4230/LIPIcs.ESA.2024.22</a>
</li>
<li>
<span class="authors">Sayan Bhattacharya, Martín Costa, Nadav Panski, and Shay Solomon</span>
<span class="title">Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.23">10.4230/LIPIcs.ESA.2024.23</a>
</li>
<li>
<span class="authors">Therese Biedl, Prosenjit Bose, and Karthik Murali</span>
<span class="title">A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.24">10.4230/LIPIcs.ESA.2024.24</a>
</li>
<li>
<span class="authors">Davide Bilò, Luciano Gualà, Stefano Leucci, and Alessandro Straziota</span>
<span class="title">Graph Spanners for Group Steiner Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.25">10.4230/LIPIcs.ESA.2024.25</a>
</li>
<li>
<span class="authors">Vittorio Bilò, Evangelos Markakis, and Cosimo Vinci</span>
<span class="title">Achieving Envy-Freeness Through Items Sale</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.26">10.4230/LIPIcs.ESA.2024.26</a>
</li>
<li>
<span class="authors">Ahmad Biniaz</span>
<span class="title">Art Galleries and Mobile Guards: Revisiting O'Rourke’s Proof</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.27">10.4230/LIPIcs.ESA.2024.27</a>
</li>
<li>
<span class="authors">Lotte Blank and Anne Driemel</span>
<span class="title">A Faster Algorithm for the Fréchet Distance in 1D for the Imbalanced Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.28">10.4230/LIPIcs.ESA.2024.28</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat and Kunal Dutta</span>
<span class="title">A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.29">10.4230/LIPIcs.ESA.2024.29</a>
</li>
<li>
<span class="authors">Fritz Bökler, Markus Chimani, Henning Jasper, and Mirko H. Wagner</span>
<span class="title">Exact Minimum Weight Spanners via Column Generation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.30">10.4230/LIPIcs.ESA.2024.30</a>
</li>
<li>
<span class="authors">Itai Boneh, Shay Golan, and Arseny Shur</span>
<span class="title">String 2-Covers with No Length Restrictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.31">10.4230/LIPIcs.ESA.2024.31</a>
</li>
<li>
<span class="authors">Cornelius Brand, Martin Koutecký, Alexandra Lassota, and Sebastian Ordyniak</span>
<span class="title">Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.32">10.4230/LIPIcs.ESA.2024.32</a>
</li>
<li>
<span class="authors">Karl Bringmann, Anita Dürr, and Adam Polak</span>
<span class="title">Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.33">10.4230/LIPIcs.ESA.2024.33</a>
</li>
<li>
<span class="authors">Karl Bringmann, Ahmed Ghazy, and Marvin Künnemann</span>
<span class="title">Exploring the Approximability Landscape of 3SUM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.34">10.4230/LIPIcs.ESA.2024.34</a>
</li>
<li>
<span class="authors">Gerth Stølting Brodal, Rolf Fagerberg, and Casper Moldrup Rysgaard</span>
<span class="title">On Finding Longest Palindromic Subsequences Using Longest Common Subsequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.35">10.4230/LIPIcs.ESA.2024.35</a>
</li>
<li>
<span class="authors">Kevin Buchin, Maike Buchin, Joachim Gudmundsson, and Sampson Wong</span>
<span class="title">Bicriteria Approximation for Minimum Dilation Graph Augmentation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.36">10.4230/LIPIcs.ESA.2024.36</a>
</li>
<li>
<span class="authors">Gruia Călinescu, Sami Davies, Samir Khuller, and Shirley Zhang</span>
<span class="title">Online Flexible Busy Time Scheduling on Heterogeneous Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.37">10.4230/LIPIcs.ESA.2024.37</a>
</li>
<li>
<span class="authors">Gruia Călinescu and Sumedha Uniyal</span>
<span class="title">Local Optimization Algorithms for Maximum Planar Subgraph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.38">10.4230/LIPIcs.ESA.2024.38</a>
</li>
<li>
<span class="authors">Barış Can Esmer, Jacob Focke, Dániel Marx, and Paweł Rzążewski</span>
<span class="title">List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.39">10.4230/LIPIcs.ESA.2024.39</a>
</li>
<li>
<span class="authors">Amit Chakrabarti, Andrew McGregor, and Anthony Wirth</span>
<span class="title">Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.40">10.4230/LIPIcs.ESA.2024.40</a>
</li>
<li>
<span class="authors">Chandra Chekuri and Rhea Jain</span>
<span class="title">Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.41">10.4230/LIPIcs.ESA.2024.41</a>
</li>
<li>
<span class="authors">Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, and Weihao Zhu</span>
<span class="title">From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.42">10.4230/LIPIcs.ESA.2024.42</a>
</li>
<li>
<span class="authors">Jana Cslovjecsek, Michał Pilipczuk, and Karol Węgrzycki</span>
<span class="title">Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.43">10.4230/LIPIcs.ESA.2024.43</a>
</li>
<li>
<span class="authors">Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, and Sebastian Wild</span>
<span class="title">An Optimal Randomized Algorithm for Finding the Saddlepoint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.44">10.4230/LIPIcs.ESA.2024.44</a>
</li>
<li>
<span class="authors">Dipan Dey and Manoj Gupta</span>
<span class="title">Near Optimal Dual Fault Tolerant Distance Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.45">10.4230/LIPIcs.ESA.2024.45</a>
</li>
<li>
<span class="authors">Matthew Ding and Jason Li</span>
<span class="title">Deterministic Minimum Steiner Cut in Maximum Flow Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.46">10.4230/LIPIcs.ESA.2024.46</a>
</li>
<li>
<span class="authors">Yann Disser, Svenja M. Griesbach, Max Klimm, and Annette Lutz</span>
<span class="title">Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.47">10.4230/LIPIcs.ESA.2024.47</a>
</li>
<li>
<span class="authors">Konstantinos Dogeas, Thomas Erlebach, and Ya-Chun Liang</span>
<span class="title">Scheduling with Obligatory Tests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.48">10.4230/LIPIcs.ESA.2024.48</a>
</li>
<li>
<span class="authors">Sally Dong and Guanghao Ye</span>
<span class="title">Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.49">10.4230/LIPIcs.ESA.2024.49</a>
</li>
<li>
<span class="authors">Loïc Dubois</span>
<span class="title">Making Multicurves Cross Minimally on Surfaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.50">10.4230/LIPIcs.ESA.2024.50</a>
</li>
<li>
<span class="authors">Lech Duraj, Filip Konieczny, and Krzysztof Potępa</span>
<span class="title">Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.51">10.4230/LIPIcs.ESA.2024.51</a>
</li>
<li>
<span class="authors">Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov, and Stefan Schmid</span>
<span class="title">Toward Self-Adjusting k-Ary Search Tree Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.52">10.4230/LIPIcs.ESA.2024.52</a>
</li>
<li>
<span class="authors">S M Ferdous, Bhargav Samineni, Alex Pothen, Mahantesh Halappanavar, and Bala Krishnamoorthy</span>
<span class="title">Semi-Streaming Algorithms for Weighted k-Disjoint Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.53">10.4230/LIPIcs.ESA.2024.53</a>
</li>
<li>
<span class="authors">Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, and Mark Simkin</span>
<span class="title">Invertible Bloom Lookup Tables with Less Memory and Randomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.54">10.4230/LIPIcs.ESA.2024.54</a>
</li>
<li>
<span class="authors">Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, and Karol Węgrzycki</span>
<span class="title">Hitting Meets Packing: How Hard Can It Be?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.55">10.4230/LIPIcs.ESA.2024.55</a>
</li>
<li>
<span class="authors">Emily Fox</span>
<span class="title">A Simple Deterministic Near-Linear Time Approximation Scheme for Transshipment with Arbitrary Positive Edge Costs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.56">10.4230/LIPIcs.ESA.2024.56</a>
</li>
<li>
<span class="authors">Dvir Fried, Tsvi Kopelowitz, and Ely Porat</span>
<span class="title">Removing the log Factor from (min,+)-Products on Bounded Range Integer Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.57">10.4230/LIPIcs.ESA.2024.57</a>
</li>
<li>
<span class="authors">Mohit Garg, Debajyoti Kar, and Arindam Khan</span>
<span class="title">Random-Order Online Independent Set of Intervals and Hyperrectangles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.58">10.4230/LIPIcs.ESA.2024.58</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski and Mateusz Wasylkiewicz</span>
<span class="title">Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.59">10.4230/LIPIcs.ESA.2024.59</a>
</li>
<li>
<span class="authors">Prantar Ghosh and Sahil Kuchlous</span>
<span class="title">New Algorithms and Lower Bounds for Streaming Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.60">10.4230/LIPIcs.ESA.2024.60</a>
</li>
<li>
<span class="authors">Lars Gottesbüren, Nikos Parotsidis, and Maximilian Probst Gutenberg</span>
<span class="title">Practical Expander Decomposition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.61">10.4230/LIPIcs.ESA.2024.61</a>
</li>
<li>
<span class="authors">Svenja M. Griesbach, Max Klimm, Philipp Warode, and Theresa Ziemke</span>
<span class="title">Optimizing Throughput and Makespan of Queuing Systems by Information Design</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.62">10.4230/LIPIcs.ESA.2024.62</a>
</li>
<li>
<span class="authors">Rohit Gurjar, Taihei Oki, and Roshan Raj</span>
<span class="title">Fractional Linear Matroid Matching Is in Quasi-NC</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.63">10.4230/LIPIcs.ESA.2024.63</a>
</li>
<li>
<span class="authors">Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, and Srinivasa Rao Satti</span>
<span class="title">A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.64">10.4230/LIPIcs.ESA.2024.64</a>
</li>
<li>
<span class="authors">Kaito Harada, Naoki Kitamura, Taisuke Izumi, and Toshimitsu Masuzawa</span>
<span class="title">A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.65">10.4230/LIPIcs.ESA.2024.65</a>
</li>
<li>
<span class="authors">Elfarouk Harb, Zhengcheng Huang, and Da Wei Zheng</span>
<span class="title">Shortest Path Separators in Unit Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.66">10.4230/LIPIcs.ESA.2024.66</a>
</li>
<li>
<span class="authors">Daniel Hathcock and Michael Zlatin</span>
<span class="title">Approximation Algorithms for Steiner Connectivity Augmentation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.67">10.4230/LIPIcs.ESA.2024.67</a>
</li>
<li>
<span class="authors">Klaus Heeger and Danny Hermelin</span>
<span class="title">Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.68">10.4230/LIPIcs.ESA.2024.68</a>
</li>
<li>
<span class="authors">Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, and Stefan Walzer</span>
<span class="title">PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.69">10.4230/LIPIcs.ESA.2024.69</a>
</li>
<li>
<span class="authors">Ivor van der Hoog, Irene Parada, and Eva Rotenberg</span>
<span class="title">Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.70">10.4230/LIPIcs.ESA.2024.70</a>
</li>
<li>
<span class="authors">Khalid Hourani, William K. Moses Jr., and Gopal Pandurangan</span>
<span class="title">Towards Communication-Efficient Peer-To-Peer Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.71">10.4230/LIPIcs.ESA.2024.71</a>
</li>
<li>
<span class="authors">Bingbing Hu, Evangelos Kosinas, and Adam Polak</span>
<span class="title">Connectivity Oracles for Predictable Vertex Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.72">10.4230/LIPIcs.ESA.2024.72</a>
</li>
<li>
<span class="authors">Zhiyi Huang, Zahra Parsaeian, and Zixuan Zhu</span>
<span class="title">Laminar Matroid Secretary: Greedy Strikes Back</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.73">10.4230/LIPIcs.ESA.2024.73</a>
</li>
<li>
<span class="authors">Dylan Hyatt-Denesik, Afrouz Jabal-Ameli, and Laura Sanità</span>
<span class="title">Improved Approximations for Flexible Network Design</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.74">10.4230/LIPIcs.ESA.2024.74</a>
</li>
<li>
<span class="authors">Yuni Iwamasa, Yusuke Kobayashi, and Kenjiro Takazawa</span>
<span class="title">Finding a Maximum Restricted t-Matching via Boolean Edge-CSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.75">10.4230/LIPIcs.ESA.2024.75</a>
</li>
<li>
<span class="authors">Bart M.P. Jansen and Céline M.F. Swennenhuis</span>
<span class="title">Steiner Tree Parameterized by Multiway Cut and Even Less</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.76">10.4230/LIPIcs.ESA.2024.76</a>
</li>
<li>
<span class="authors">Matthew J. Katz, Rachel Saban, and Micha Sharir</span>
<span class="title">Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.77">10.4230/LIPIcs.ESA.2024.77</a>
</li>
<li>
<span class="authors">Justin Kim, Rahul Varki, Marco Oliva, and Christina Boucher</span>
<span class="title">Re²Pair: Increasing the Scalability of RePair by Decreasing Memory Usage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.78">10.4230/LIPIcs.ESA.2024.78</a>
</li>
<li>
<span class="authors">Shimon Kogan and Merav Parter</span>
<span class="title">Giving Some Slack: Shortcuts and Transitive Closure Compressions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.79">10.4230/LIPIcs.ESA.2024.79</a>
</li>
<li>
<span class="authors">Shimon Kogan and Merav Parter</span>
<span class="title">The Algorithmic Power of the Greene-Kleitman Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.80">10.4230/LIPIcs.ESA.2024.80</a>
</li>
<li>
<span class="authors">Łukasz Kowalik</span>
<span class="title">Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.81">10.4230/LIPIcs.ESA.2024.81</a>
</li>
<li>
<span class="authors">Sonja Kraiczy and Edith Elkind</span>
<span class="title">A Lower Bound for Local Search Proportional Approval Voting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.82">10.4230/LIPIcs.ESA.2024.82</a>
</li>
<li>
<span class="authors">Florian Kurpicz, Pascal Mehnert, Peter Sanders, and Matthias Schimek</span>
<span class="title">Scalable Distributed String Sorting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.83">10.4230/LIPIcs.ESA.2024.83</a>
</li>
<li>
<span class="authors">Alexander Leonhardt, Ulrich Meyer, and Manuel Penschuck</span>
<span class="title">Insights into (k, ρ)-Shortcutting Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.84">10.4230/LIPIcs.ESA.2024.84</a>
</li>
<li>
<span class="authors">Paloma T. Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski, and Kenny Štorgel</span>
<span class="title">Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.85">10.4230/LIPIcs.ESA.2024.85</a>
</li>
<li>
<span class="authors">Zsuzsanna Lipták, Francesco Masillo, and Gonzalo Navarro</span>
<span class="title">A Textbook Solution for Dynamic Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.86">10.4230/LIPIcs.ESA.2024.86</a>
</li>
<li>
<span class="authors">Konrad Majewski, Michał Pilipczuk, and Anna Zych-Pawlewicz</span>
<span class="title">Parameterized Dynamic Data Structure for Split Completion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.87">10.4230/LIPIcs.ESA.2024.87</a>
</li>
<li>
<span class="authors">Samuel McCauley</span>
<span class="title">Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.88">10.4230/LIPIcs.ESA.2024.88</a>
</li>
<li>
<span class="authors">Slobodan Mitrović, Ronitt Rubinfeld, and Mihir Singhal</span>
<span class="title">Locally Computing Edge Orientations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.89">10.4230/LIPIcs.ESA.2024.89</a>
</li>
<li>
<span class="authors">Alexander Naumann, Annika Bonerath, and Jan-Henrik Haunert</span>
<span class="title">Many-To-Many Polygon Matching à La Jaccard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.90">10.4230/LIPIcs.ESA.2024.90</a>
</li>
<li>
<span class="authors">Zipei Nie and Hang Zhou</span>
<span class="title">Euclidean Capacitated Vehicle Routing in the Random Setting: A 1.55-Approximation Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.91">10.4230/LIPIcs.ESA.2024.91</a>
</li>
<li>
<span class="authors">Zeev Nutov</span>
<span class="title">Parameterized Algorithms for Node Connectivity Augmentation Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.92">10.4230/LIPIcs.ESA.2024.92</a>
</li>
<li>
<span class="authors">George Osipov, Marcin Pilipczuk, and Magnus Wahlström</span>
<span class="title">Parameterized Complexity of MinCSP over the Point Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.93">10.4230/LIPIcs.ESA.2024.93</a>
</li>
<li>
<span class="authors">Felipe de Carvalho Pereira, Pedro Jussieu de Rezende, Tallys Yunes, and Luiz Fernando Batista Morato</span>
<span class="title">A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.94">10.4230/LIPIcs.ESA.2024.94</a>
</li>
<li>
<span class="authors">Rajmohan Rajaraman and Omer Wasim</span>
<span class="title">Competitive Capacitated Online Recoloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.95">10.4230/LIPIcs.ESA.2024.95</a>
</li>
<li>
<span class="authors">Tim Randolph and Karol Węgrzycki</span>
<span class="title">Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.96">10.4230/LIPIcs.ESA.2024.96</a>
</li>
<li>
<span class="authors">Henrik Reinstädtler, Christian Schulz, and Bora Uçar</span>
<span class="title">Engineering Edge Orientation Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.97">10.4230/LIPIcs.ESA.2024.97</a>
</li>
<li>
<span class="authors">Gregory Schwartzman</span>
<span class="title">Local Max-Cut on Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.98">10.4230/LIPIcs.ESA.2024.98</a>
</li>
<li>
<span class="authors">Tatsuya Terao and Ryuhei Mori</span>
<span class="title">Parameterized Quantum Query Algorithms for Graph Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.99">10.4230/LIPIcs.ESA.2024.99</a>
</li>
<li>
<span class="authors">Max Dupré la Tour, Monika Henzinger, and David Saulpic</span>
<span class="title">Fully Dynamic k-Means Coreset in Near-Optimal Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.100">10.4230/LIPIcs.ESA.2024.100</a>
</li>
<li>
<span class="authors">Qisheng Wang and Zhicheng Zhang</span>
<span class="title">Time-Efficient Quantum Entropy Estimator via Samplizer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.101">10.4230/LIPIcs.ESA.2024.101</a>
</li>
<li>
<span class="authors">Henning Martin Woydt, Christian Komusiewicz, and Frank Sommer</span>
<span class="title">SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.102">10.4230/LIPIcs.ESA.2024.102</a>
</li>
<li>
<span class="authors">Pu Wu, Huanyu Gu, Huiqin Jiang, Zehui Shao, and Jin Xu</span>
<span class="title">A Faster Algorithm for the 4-Coloring Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.103">10.4230/LIPIcs.ESA.2024.103</a>
</li>
<li>
<span class="authors">Mingyu Xiao</span>
<span class="title">Solving Directed Multiway Cut Faster Than 2ⁿ</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.104">10.4230/LIPIcs.ESA.2024.104</a>
</li>
<li>
<span class="authors">Toru Yoshinaga and Yasushi Kawase</span>
<span class="title">The Last Success Problem with Samples</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2024.105">10.4230/LIPIcs.ESA.2024.105</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