ACM Transactions on Algorithms

Papers
(The median citation count of ACM Transactions on Algorithms is 1. 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-08-01 to 2025-08-01.)
ArticleCitations
A PTAS for Capacitated Vehicle Routing on Trees21
Generic Techniques for Building Top- k Structures16
Collapsing the Tower—On the Complexity of Multistage Stochastic IPs14
A Face Cover Perspective to ℓ 1 Embeddings of Planar Graphs12
Cluster Editing Parameterized above Modification-disjoint P 3 -packings10
Tiling with Squares and Packing Dominos in Polynomial Time9
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
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems8
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter7
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle7
Online Euclidean Spanners6
Better Sum Estimation via Weighted Sampling6
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs6
Competitive Online Search Trees on Trees5
Almost Consistent Systems of Linear Equations5
A O (log k )-Approximation for Directed Steiner Tree in Planar Graphs5
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs5
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry5
Combinatorial Generation via Permutation Languages. IV. Elimination Trees4
Online Lewis Weight Sampling4
Smaller Cuts, Higher Lower Bounds4
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree4
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue4
On the Complexity of String Matching for Graphs4
SETH-based Lower Bounds for Subset Sum and Bicriteria Path4
A Lower Bound on Cycle-Finding in Sparse Digraphs4
The Query Complexity of Searching Trees with Permanently Noisy Advice4
Dynamic Geometric Set Cover and Hitting Set4
On the Complexity of Symmetric vs. Functional PCSPs4
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance4
Counting Homomorphic Cycles in Degenerate Graphs4
Hypergraph Isomorphism for Groups with Restricted Composition Factors3
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching3
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue3
Network Design for s - t Effective Resistance3
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees3
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix3
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints3
Faster Matroid Partition Algorithms3
A Linear-Time n 0.4 -Approximation for Longest Common Subsequence3
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling3
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth3
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs3
Rerouting Planar Curves and Disjoint Paths3
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons3
Paging and the Address-Translation Problem3
String Indexing with Compressed Patterns2
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication2
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension2
Efficiency of Self-Adjusting Heaps2
Scalable High-Quality Hypergraph Partitioning2
PTAS for Sparse General-valued CSPs2
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages2
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 20202
A Faster Algorithm for Finding Tarski Fixed Points2
Time Dependent Biased Random Walks2
Competitive Data-Structure Dynamization2
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs2
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable2
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams2
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems2
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden2
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue2
Exact Distance Oracles for Planar Graphs with Failing Vertices2
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs2
Deterministic Replacement Path Covering1
Computing MEMs and Relatives on Repetitive Text Collections1
Popular Arborescences and Their Matroid Generalization1
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead1
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds1
Popular Matchings with One-Sided Bias1
On the Two-Dimensional Knapsack Problem for Convex Polygons1
Optimal Inapproximability with Universal Factor Graphs1
Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs1
Tight Bounds for ℓ 1 Oblivious Subspace Embeddings1
Strict Fibonacci Heaps1
Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time1
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results1
Classification via Two-Way Comparisons1
A Generalization of Self-Improving Algorithms1
Width Helps and Hinders Splitting Flows1
Tiny Pointers1
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter1
Constant-time Dynamic (Δ +1)-Coloring1
Exponential Separations in Local Privacy1
Approximating Pathwidth for Graphs of Small Treewidth1
Static and Streaming Data Structures for Fréchet Distance Queries1
Automorphisms and Isomorphisms of Maps in Linear Time1
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs1
Polynomial-time Trace Reconstruction in the Smoothed Complexity Model1
Flow-augmentation II: Undirected Graphs1
0.032577991485596