ACM Transactions on Algorithms

Papers
(The TQCC of ACM Transactions on Algorithms is 3. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-09-01 to 2025-09-01.)
ArticleCitations
A PTAS for Capacitated Vehicle Routing on Trees21
Collapsing the Tower—On the Complexity of Multistage Stochastic IPs17
Cluster Editing Parameterized above Modification-disjoint P 3 -packings15
Generic Techniques for Building Top- k Structures15
A Face Cover Perspective to ℓ 1 Embeddings of Planar Graphs10
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue9
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n 4/39
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond9
Tiling with Squares and Packing Dominos in Polynomial Time9
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems8
Node-Differentially Private Estimation of the Number of Connected Components7
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter7
Online Euclidean Spanners6
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle6
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs6
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry6
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs5
Almost Consistent Systems of Linear Equations5
Competitive Online Search Trees on Trees5
Better Sum Estimation via Weighted Sampling5
A O (log k )-Approximation for Directed Steiner Tree in Planar Graphs5
The Query Complexity of Searching Trees with Permanently Noisy Advice4
Dynamic Geometric Set Cover and Hitting Set4
Smaller Cuts, Higher Lower Bounds4
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons4
Combinatorial Generation via Permutation Languages. IV. Elimination Trees4
Online Lewis Weight Sampling4
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance4
Network Design for s - t Effective Resistance4
On the Complexity of Symmetric vs. Functional PCSPs4
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue4
On the Complexity of String Matching for Graphs4
A Linear-Time n 0.4 -Approximation for Longest Common Subsequence4
Counting Homomorphic Cycles in Degenerate Graphs4
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree3
SETH-based Lower Bounds for Subset Sum and Bicriteria Path3
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees3
Parameterized Approximation Schemes for Biclique-Free Max k -Weight SAT and Max Coverage3
Rerouting Planar Curves and Disjoint Paths3
Faster Matroid Partition Algorithms3
Online Coalition Formation under Random Arrival or Coalition Dissolution3
A Lower Bound on Cycle-Finding in Sparse Digraphs3
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs3
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching3
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth3
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling3
Paging and the Address-Translation Problem3
Hypergraph Isomorphism for Groups with Restricted Composition Factors3
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix3
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints3
0.13941597938538