| 2024 | Caching Connections in Matchings. | Yaniv Sadeh, Haim Kaplan |
| 2024 | Better Sparsifiers for Directed Eulerian Graphs. | Sushant Sachdeva, Anvith Thudi, Yibin Zhao |
| 2024 | Identifying Tractable Quantified Temporal Constraints Within Ord-Horn. | Jakub Rydval, Zaneta Semanisinov, Michal Wrona |
| 2024 | Homogeneity and Homogenizability: Hard Problems for the Logic SNP. | Jakub Rydval |
| 2024 | A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions. | Wojciech Rozowski |
| 2024 | Adaptive Sparsification for Matroid Intersection. | Kent Quanrud |
| 2024 | Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle. | Aaron Potechin, Aaron Zhang |
| 2024 | One-Way Communication Complexity of Partial XOR Functions. | Vladimir V. Podolskii, Dmitrii Sluch |
| 2024 | On the Cut-Query Complexity of Approximating Max-Cut. | Orestis Plevrakis, Seyoon Ragavan, S. Matthew Weinberg |
| 2024 | Delineating Half-Integrality of the Erdős-Psa Property for Minors: The Case of Surfaces. | Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2024 | Graphs Shortcuts: New Bounds and Algorithms (Invited Talk). | Merav Parter |
| 2024 | Alphabet Reduction for Reconfiguration Problems. | Naoto Ohsaka |
| 2024 | Cross-Paradigm Graph Algorithms (Invited Talk). | Danupon Nanongkai |
| 2024 | An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s. | Antoine Mottet, Toms Nagy, Michael Pinsker |
| 2024 | Testing Spreading Behavior in Networks with Arbitrary Topologies. | Augusto Modanese, Yuichi Yoshida |
| 2024 | Approximation Algorithms for 𝓁 | Yury Makarychev, Max Ovsiankin, Erasmo Tani |
| 2024 | Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity. | Zhenjian Lu, Rahul Santhanam |
| 2024 | Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity. | Yaowei Long, Yunfan Wang |
| 2024 | Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games. | Bruno Loff, Mateusz Skomra |
| 2024 | Two-Source and Affine Non-Malleable Extractors for Small Entropy. | Xin Li, Yan Zhong |
| 2024 | Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH. | Shuangle Li, Bingkai Lin, Yuwei Liu |
| 2024 | An Improved Quantum Max Cut Approximation via Maximum Matching. | Eunou Lee, Ojas Parekh |
| 2024 | Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. | Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir |
| 2024 | Solving Promise Equations over Monoids and Groups. | Alberto Larrauri, Stanislav Zivn |
| 2024 | Towards an Analysis of Quadratic Probing. | William Kuszmaul, Zoe Xi |