- Marco Bressan 0002. Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs. ACM Transactions on Algorithms, 19(3), July 2023.
- Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald. On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?. ACM Transactions on Algorithms, 19(2), April 2023.
- Anders Aamand, Mikkel Abrahamsen, Peter M. R. Rasmussen, Thomas D. Ahle. Tiling with Squares and Packing Dominos in Polynomial Time. ACM Transactions on Algorithms, 19(3), July 2023.
- Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster. Counting Homomorphic Cycles in Degenerate Graphs. ACM Transactions on Algorithms, 19(1), January 2023.
- Aditya Jayaprakash, Mohammad R. Salavatipour. Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. ACM Transactions on Algorithms, 19(2), April 2023.
- Enoch Peserico, Michele Scquizzato. Matching on the Line Admits no \(o(\sqrt {\log n})\)-Competitive Algorithm. ACM Transactions on Algorithms, 19(3), July 2023.
- Amir Abboud, Fabrizio Grandoni 0001, Virginia Vassilevska Williams. Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter. ACM Transactions on Algorithms, 19(1), January 2023.
- Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi. Robust Algorithms for TSP and Steiner Tree. ACM Transactions on Algorithms, 19(2), April 2023.
- Karl Bringmann, Vincent Cohen-Addad, Debarati Das 0001. 0.4-Approximation for Longest Common Subsequence. ACM Transactions on Algorithms, 19(1), January 2023.
- Maike Buchin, Anne Driemel, Dennis Rohde. k,ℓ)-Median Clustering for Polygonal Curves. ACM Transactions on Algorithms, 19(1), January 2023.