| 2024 | Lipschitz Continuous Allocations for Optimization Games. | Soh Kumabe, Yuichi Yoshida |
| 2024 | On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. | Tsvi Kopelowitz, Ariel Korin, Liam Roditty |
| 2024 | Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number. | Boris Klemz, Marie Diana Sieper |
| 2024 | Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. | Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan |
| 2024 | Cut Sparsification and Succinct Representation of Submodular Hypergraphs. | Yotam Kenneth, Robert Krauthgamer |
| 2024 | The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters. | George Kenison |
| 2024 | On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words. | Pavol Kebis, Florian Luca, Jol Ouaknine, Andrew Scoones, James Worrell |
| 2024 | Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets. | Yasushi Kawase, Koichi Nishimura, Hanna Sumita |
| 2024 | Fully Dynamic Strongly Connected Components in Planar Digraphs. | Adam Karczmarz, Marcin Smulewicz |
| 2024 | Algorithms for the Generalized Poset Sorting Problem. | Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, Yuhao Zhang |
| 2024 | A Sublinear Time Tester for Max-Cut on Clusterable Graphs. | Agastya Vibhuti Jha, Akash Kumar |
| 2024 | Dynamic PageRank: Algorithms and Lower Bounds. | Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
| 2024 | Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. | Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2024 | Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time. | Kevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak |
| 2024 | Problems on Group-Labeled Matroid Bases. | Florian Hrsch, Andrs Imolay, Ryuhei Mizutani, Taihei Oki, Tams Schwarcz |
| 2024 | Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration. | Shuichi Hirahara, Naoto Ohsaka |
| 2024 | The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. | Sophia Heimann, Hung P. Hoang, Stefan Hougardy |
| 2024 | No Polynomial Kernels for Knapsack. | Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay |
| 2024 | Refuting Approaches to the Log-Rank Conjecture for XOR Functions. | Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni |
| 2024 | Oracle-Augmented Prophet Inequalities. | Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos |
| 2024 | Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication. | Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski |
| 2024 | An Efficient Quantifier Elimination Procedure for Presburger Arithmetic. | Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche |
| 2024 | Flattability of Priority Vector Addition Systems. | Roland Guttenberg |
| 2024 | From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP. | Leonid Gurvits, Nathan Klein, Jonathan Leake |
| 2024 | The 2-Dimensional Constraint Loop Problem Is Decidable. | Quentin Guilmant, Engel Lefaucheux, Jol Ouaknine, James Worrell |