LIPIcs, Volume 308, ESA 2024

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