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-11-01 to 2025-11-01.)
ArticleCitations
A Face Cover Perspective to ℓ 1 Embeddings of Planar Graphs21
Cluster Editing Parameterized above Modification-disjoint P 3 -packings18
A PTAS for Capacitated Vehicle Routing on Trees17
Generic Techniques for Building Top- k Structures15
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue11
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond10
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems9
Collapsing the Tower—On the Complexity of Multistage Stochastic IPs9
Tiling with Squares and Packing Dominos in Polynomial Time9
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n 4/38
Node-Differentially Private Estimation of the Number of Connected Components7
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter7
Better Sum Estimation via Weighted Sampling6
Almost Consistent Systems of Linear Equations6
Online Euclidean Spanners6
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle6
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs6
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs6
The Query Complexity of Searching Trees with Permanently Noisy Advice5
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry5
A Lower Bound on Cycle-Finding in Sparse Digraphs4
Online Lewis Weight Sampling4
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue4
Competitive Online Search Trees on Trees4
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees4
On the Complexity of String Matching for Graphs4
Dynamic Geometric Set Cover and Hitting Set4
Counting Homomorphic Cycles in Degenerate Graphs4
On the Complexity of Symmetric vs. Functional PCSPs4
Combinatorial Generation via Permutation Languages. IV. Elimination Trees4
A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\) -Approximation for Directed Steiner Tree in Planar Graphs4
Network Design for s - t Effective Resistance3
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons3
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance3
Parameterized Approximation Schemes for Biclique-Free Max \(\boldsymbol{k}\) -Weight SAT and Max Coverage3
Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem3
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree3
Paging and the Address-Translation Problem3
SETH-based Lower Bounds for Subset Sum and Bicriteria Path3
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix3
Hypergraph Isomorphism for Groups with Restricted Composition Factors3
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling3
A Linear-Time n 0.4 -Approximation for Longest Common Subsequence3
Online Coalition Formation under Random Arrival or Coalition Dissolution3
Faster Matroid Partition Algorithms3
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs3
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth3
0.068946123123169