- Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders 0001, Sebastian Schlag. Scalable High-Quality Hypergraph Partitioning. ACM Transactions on Algorithms, 20(1), January 2024.
- Shaohua Li 0005, Marcin Pilipczuk, Manuel Sorge. 3-packings. ACM Transactions on Algorithms, 20(1), January 2024.
- Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis. Shortest Cycles with Monotone Submodular Costs. ACM Transactions on Algorithms, 20(1), January 2024.
- Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli. Linear-Time. ACM Transactions on Algorithms, 20(1), January 2024.
- Eden Pelleg, Stanislav Zivný. Additive Sparsification of CSPs. ACM Transactions on Algorithms, 20(1), January 2024.
- Thomas Bläsius, Philipp Fischbeck. On the External Validity of Average-case Analyses of Graph Algorithms. ACM Transactions on Algorithms, 20(1), January 2024.
- Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz 0001. Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Transactions on Algorithms, 20(1), January 2024.
- Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic. Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Transactions on Algorithms, 20(1), January 2024.
- Telikepalli Kavitha. Popular Matchings with One-Sided Bias. ACM Transactions on Algorithms, 20(1), January 2024.
- Antonio Blanca, Sarah Cannon, Will Perkins 0001. Fast and Perfect Sampling of Subgraphs and Polymer Systems. ACM Transactions on Algorithms, 20(1), January 2024.