- Salwa Faour, Mohsen Ghaffari 0001, Christoph Grunau, Fabian Kuhn, Václav Rozhon. Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. ACM Transactions on Algorithms, 21(4), October 2025.
- Tatiana Belova, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Denil Sharipov. Polynomial Formulations as a Barrier for Reduction-Based Hardness Proofs. ACM Transactions on Algorithms, 21(4), October 2025.
- Michael A. Bender, Alexander Conway 0001, Martín Farach-Colton, William Kuszmaul, Guido Tagliavini. Tiny Pointers. ACM Transactions on Algorithms, 21(4), October 2025.
- Alina Ene, Troy Lee, Piotr Micek, Sushant Sachdeva. Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue. ACM Transactions on Algorithms, 21(3), July 2025.
- Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin. On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. ACM Transactions on Algorithms, 21(2), 2025.
- Arnold Filtser. 1 Embeddings of Planar Graphs. ACM Transactions on Algorithms, 21(1), January 2025.
- Sepehr Assadi, Martín Farach-Colton, William Kuszmaul. Tight Bounds for Monotone Minimal Perfect Hashing. ACM Transactions on Algorithms, 21(4), October 2025.
- Andreas Emil Feldmann, Michael Lampis. Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. ACM Transactions on Algorithms, 21(4), October 2025.
- Xi Chen 0001, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha. Polynomial-time Trace Reconstruction in the Smoothed Complexity Model. ACM Transactions on Algorithms, 21(3), July 2025.
- Tatsuya Terao. Faster Matroid Partition Algorithms. ACM Transactions on Algorithms, 21(2), 2025.