| 2024 | Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs. | Yi-Jun Chang, Da Wei Zheng |
| 2024 | Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. | Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than |
| 2024 | An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. | Timothy M. Chan, Pingan Cheng, Da Wei Zheng |
| 2024 | Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. | Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai |
| 2024 | Tight Lower Bound on Equivalence Testing in Conditional Sampling Model. | Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar |
| 2024 | Beyond the Quadratic Time Barrier for Network Unreliability. | Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi |
| 2024 | A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions. | Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford |
| 2024 | Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. | Nairen Cao, Shang-En Huang, Hsin-Hao Su |
| 2024 | A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams. | Mlanie Cambus, Fabian Kuhn, Etna Lindy, Shreyas Pai, Jara Uitto |
| 2024 | On the Hardness of PosSLP. | Peter Brgisser, Gorav Jindal |
| 2024 | A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds. | Moritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese |
| 2024 | Maintaining Matroid Intersections Online. | Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar |
| 2024 | Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs. | Adam Brown, Aditi Laddha, Madhusudhan Reddy Pittu, Mohit Singh |
| 2024 | Dynamic Dynamic Time Warping. | Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg |
| 2024 | Faster Sublinear-Time Edit Distance. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka |
| 2024 | Approximating Subset Sum Ratio faster than Subset Sum. | Karl Bringmann |
| 2024 | The Sharp Power Law of Local Search on Expanders. | Simina Brnzei, Davin Choo, Nicholas J. Recker |
| 2024 | On Dynamic Graph Algorithms with Predictions. | Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak |
| 2024 | Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. | Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2024 | Tight approximability of MAX 2-SAT and relatives, under UGC. | Joshua Brakensiek, Neng Huang, Uri Zwick |
| 2024 | Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. | Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii |
| 2024 | Factoring Pattern-Free Permutations into Separable ones. | Edouard Bonnet, Romain Bourneuf, Colin Geniet, Stphan Thomass |
| 2024 | Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. | Greg Bodwin, Bernhard Haeupler, Merav Parter |
| 2024 | Sparse Regular Expression Matching. | Philip Bille, Inge Li Grtz |
| 2024 | Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. | Sujoy Bhore, Arnold Filtser, Csaba D. Tth |