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-06-01 to 2026-06-01.)
ArticleCitations
A Face Cover Perspective to ℓ 1 Embeddings of Planar Graphs20
Cluster Editing Parameterized above Modification-disjoint P 3 -packings16
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue14
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond14
Collapsing the Tower—On the Complexity of Multistage Stochastic IPs11
A PTAS for Capacitated Vehicle Routing on Trees10
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain10
Generic Techniques for Building Top- k Structures10
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems8
On Parallel ???? -Center Clustering8
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter8
Tiling with Squares and Packing Dominos in Polynomial Time7
Node-Differentially Private Estimation of the Number of Connected Components7
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 Subgraphs6
Online Euclidean Spanners6
Better Sum Estimation via Weighted Sampling6
Almost Consistent Systems of Linear Equations6
Competitive Online Search Trees on Trees5
On the Complexity of Symmetric vs. Functional PCSPs5
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue5
A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\) -Approximation for Directed Steiner Tree in Planar Graphs5
Lower Bounds for Weighted Matroid Problems5
The Query Complexity of Searching Trees with Permanently Noisy Advice5
Dynamic Geometric Set Cover and Hitting Set5
Online Lewis Weight Sampling5
Combinatorial Generation via Permutation Languages. IV. Elimination Trees4
Counting Homomorphic Cycles in Degenerate Graphs4
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling4
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy4
A Linear-Time n 0.4 -Approximation for Longest Common Subsequence4
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree4
On the Complexity of String Matching for Graphs4
A Lower Bound on Cycle-Finding in Sparse Digraphs4
Hypergraph Isomorphism for Groups with Restricted Composition Factors3
Parameterized Approximation Schemes for Biclique-Free Max k -Weight SAT and Max Coverage3
Network Design for s - t Effective Resistance3
Online Coalition Formation under Random Arrival or Coalition Dissolution3
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs3
Rerouting Planar Curves and Disjoint Paths3
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees3
Faster Matroid Partition Algorithms3
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix3
Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem3
Paging and the Address-Translation Problem3
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance3
0.50569105148315