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 2022-08-01 to 2026-08-01.)
ArticleCitations
A Face Cover Perspective to ℓ 1 Embeddings of Planar Graphs17
Cluster Editing Parameterized above Modification-disjoint P 3 -packings15
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue15
Collapsing the Tower—On the Complexity of Multistage Stochastic IPs11
Generic Techniques for Building Top- k Structures10
A PTAS for Capacitated Vehicle Routing on Trees10
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain9
Node-Differentially Private Estimation of the Number of Connected Components8
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond8
On Parallel k -Center Clustering7
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter7
Tiling with Squares and Packing Dominos in Polynomial Time7
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems6
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs6
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle6
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs5
On the Complexity of Symmetric vs. Functional PCSPs5
Better Sum Estimation via Weighted Sampling5
Competitive Online Search Trees on Trees5
Online Euclidean Spanners5
The Query Complexity of Searching Trees with Permanently Noisy Advice5
A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\) -Approximation for Directed Steiner Tree in Planar Graphs5
Almost Consistent Systems of Linear Equations5
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue4
Lower Bounds for Weighted Matroid Problems4
Dynamic Geometric Set Cover and Hitting Set4
Online Lewis Weight Sampling4
Combinatorial Generation via Permutation Languages. IV. Elimination Trees4
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy4
Counting Homomorphic Cycles in Degenerate Graphs3
Paging and the Address-Translation Problem3
Online Coalition Formation under Random Arrival or Coalition Dissolution3
Faster Matroid Partition Algorithms3
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix3
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling3
On the Complexity of String Matching for Graphs3
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees3
A Linear-Time n 0.4 -Approximation for Longest Common Subsequence3
Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem3
Parameterized Approximation Schemes for Biclique-Free Max k -Weight SAT and Max Coverage3
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree3
A Lower Bound on Cycle-Finding in Sparse Digraphs3
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance3
Rerouting Planar Curves and Disjoint Paths3
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs3
String Indexing with Compressed Patterns3
0.041417121887207