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