| 2024 | Decremental Matching in General Weighted Graphs. | Aditi Dudeja |
| 2024 | A Finite Presentation of Graphs of Treewidth at Most Three. | Amina Doumane, Samuel Humeau, Damien Pous |
| 2024 | New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. | Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos |
| 2024 | Functional Closure Properties of Finite ℕ-Weighted Automata. | Julian Drfler, Christian Ikenmeyer |
| 2024 | Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. | Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr. |
| 2024 | Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. | Holger Dell, John Lapinskas, Kitty Meeks |
| 2024 | Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan |
| 2024 | Limits of Symmetric Computation (Invited Talk). | Anuj Dawar |
| 2024 | Simultaneously Approximating All 𝓁 | Sami Davies, Benjamin Moseley, Heather Newman |
| 2024 | Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs. | Mohan Dantam, Richard Mayr |
| 2024 | Computing Tree Decompositions with Small Independence Number. | Clment Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic |
| 2024 | Fully-Scalable MPC Algorithms for Clustering in High Dimension. | Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Vesel |
| 2024 | An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations. | Mnika Csiks, Nabil H. Mustafa |
| 2024 | Bayesian Calibrated Click-Through Auctions. | Junjie Chen, Minming Li, Haifeng Xu, Song Zuo |
| 2024 | Robot Positioning Using Torus Packing for Multisets. | Chung Shue Chen, Peter Keevash, Sean Kennedy, lie de Panafieu, Adrian Vetta |
| 2024 | Streaming Edge Coloring with Subquadratic Palette Size. | Shiri Chechik, Doron Mukhtar, Tianyi Zhang |
| 2024 | Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. | Shiri Chechik, Tianyi Zhang |
| 2024 | Faster Algorithms for Dual-Failure Replacement Paths. | Shiri Chechik, Tianyi Zhang |
| 2024 | Optimal Bounds for Distinct Quartics. | Panagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi |
| 2024 | The Group Access Bounds for Binary Search Trees. | Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai |
| 2024 | Fast Approximate Counting of Cycles. | Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams |
| 2024 | Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems. | Maxime Cautrs, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stphan Thomass |
| 2024 | A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. | Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi |
| 2024 | The Structure of Trees in the Pushdown Hierarchy. | Arnaud Carayol, Lucien Charamond |
| 2024 | Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. | Marin Bougeret, Bart M. P. Jansen, Ignasi Sau |