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-06-01 to 2025-06-01.)
ArticleCitations
A PTAS for Capacitated Vehicle Routing on Trees21
A Face Cover Perspective to ℓ 1 Embeddings of Planar Graphs15
Cluster Editing Parameterized above Modification-disjoint P 3 -packings12
Collapsing the Tower—On the Complexity of Multistage Stochastic IPs12
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems9
Generic Techniques for Building Top- k Structures9
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n 4/38
Tiling with Squares and Packing Dominos in Polynomial Time8
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle7
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter7
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs6
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs6
Online Euclidean Spanners6
Better Sum Estimation via Weighted Sampling5
The Query Complexity of Searching Trees with Permanently Noisy Advice5
Almost Consistent Systems of Linear Equations5
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry5
The Infinite Server Problem5
On β-Plurality Points in Spatial Voting Games5
Competitive Online Search Trees on Trees5
A O (log k )-Approximation for Directed Steiner Tree in Planar Graphs4
On the Complexity of String Matching for Graphs4
Combinatorial Generation via Permutation Languages. IV. Elimination Trees4
Dynamic Geometric Set Cover and Hitting Set4
Online Lewis Weight Sampling4
On the Complexity of Symmetric vs. Functional PCSPs4
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue4
Counting Homomorphic Cycles in Degenerate Graphs4
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling3
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons3
Improving the Smoothed Complexity of FLIP for Max Cut Problems3
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth3
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix3
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams3
A Lower Bound on Cycle-Finding in Sparse Digraphs3
SETH-based Lower Bounds for Subset Sum and Bicriteria Path3
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance3
Faster Matroid Partition Algorithms3
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue3
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees3
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree3
A Linear-Time n 0.4 -Approximation for Longest Common Subsequence3
Smaller Cuts, Higher Lower Bounds3
Network Design for s - t Effective Resistance3
Hypergraph Isomorphism for Groups with Restricted Composition Factors3
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching3
0.262934923172