| 2024 | From Proof Complexity to Circuit Complexity via Interactive Protocols. | Noel Arteche, Erfan Khaniki, Jn Pich, Rahul Santhanam |
| 2024 | Non-Linear Paging. | Ilan Doron-Arad, Joseph (Seffi) Naor |
| 2024 | Lower Bounds for Matroid Optimization Problems with a Linear Constraint. | Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2024 | The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants. | Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang |
| 2024 | Approximate Counting for Spin Systems in Sub-Quadratic Time. | Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang |
| 2024 | Detecting Disjoint Shortest Paths in Linear Time and More. | Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein |
| 2024 | Edit Distance of Finite State Transducers. | C. Aiswarya, Amaldev Manuel, Saina Sunny |
| 2024 | Lookahead Games and Efficient Determinisation of History-Deterministic Bchi Automata. | Rohan Acharya, Marcin Jurdzinski, Aditya Prakash |
| 2024 | Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. | Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese |
| 2024 | Finer-Grained Reductions in Fine-Grained Hardness of Approximation. | Elie Abboud, Noga Ron-Zewi |
| 2024 | Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. | Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dniel Marx, Roohani Sharma, Joachim Spoerhase |
| 2024 | An O(loglog n)-Approximation for Submodular Facility Location. | Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely |
| 2024 | Lower Bounds on 0-Extension with Steiner Nodes. | Yu Chen, Zihan Tan |
| 2024 | On the Streaming Complexity of Expander Decomposition. | Yu Chen, Michael Kapralov, Mikhail Makarov, Davide Mazzali |
| 2024 | High-Accuracy Multicommodity Flows via Iterative Refinement. | Li Chen, Mingquan Ye |
| 2024 | Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. | Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2024 | A Faster Algorithm for Pigeonhole Equal Sums. | Ce Jin, Hongxun Wu |
| 2024 | Subquadratic Submodular Maximization with a General Matroid Constraint. | Yusuke Kobayashi, Tatsuya Terao |
| 2024 | Integer Linear-Exponential Programming in NP by Quantifier Elimination. | Dmitry Chistikov, Alessio Mansutti, Mikhail R. Starchak |
| 2024 | Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. | Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhuser, Daniel Schmand, Giovanna Varricchio |
| 2024 | Streaming Algorithms for Connectivity Augmentation. | Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian |
| 2024 | Separability in Bchi VASS and Singly Non-Linear Systems of Inequalities. | Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche |
| 2024 | An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs. | Weiming Feng, Heng Guo |
| 2024 | Polylogarithmic Approximations for Robust s-t Path. | Shi Li, Chenyang Xu, Ruilong Zhang |
| 2023 | The Wrong Direction of Jensen's Inequality Is Algorithmically Right. | Or Zamir |