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 2020-05-01 to 2024-05-01.)
ArticleCitations
Optimal-Time Dictionary-Compressed Indexes23
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)20
The Non-Uniform k -Center Problem14
Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs12
Randomized Contractions Meet Lean Decompositions11
Deterministic APSP, Orthogonal Vectors, and More11
An Improved Isomorphism Test for Bounded-tree-width Graphs9
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time9
Time- and Space-optimal Algorithm for the Many-visits TSP8
Zeros of Holant Problems8
A Learned Approach to Design Compressed Rank/Select Data Structures8
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants7
The Complexity of Cake Cutting with Unequal Shares7
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems6
A PTAS for Capacitated Vehicle Routing on Trees6
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms6
Symmetry Exploitation for Online Machine Covering with Bounded Migration6
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry6
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space6
Dynamic Parameterized Problems and Algorithms5
Fine-grained Complexity Analysis of Two Classic TSP Variants5
Parameterized Hardness of Art Gallery Problems5
Deterministic Sparse Suffix Sorting in the Restore Model5
SETH-based Lower Bounds for Subset Sum and Bicriteria Path5
On the Complexity of String Matching for Graphs5
Improved Dynamic Graph Coloring5
Querying a Matrix through Matrix-Vector Products5
Tight Bounds for Online TSP on the Line4
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem4
Discrete Fréchet Distance under Translation4
The Quest for Strong Inapproximability Results with Perfect Completeness4
Random Walks on Small World Networks4
Edge Estimation with Independent Set Oracles4
Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm3
Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma3
Approximating Geometric Knapsack via L-packings3
A PTAS for Euclidean TSP with Hyperplane Neighborhoods3
Zip Trees3
Hypergraph Isomorphism for Groups with Restricted Composition Factors3
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems3
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain3
Fast and Perfect Sampling of Subgraphs and Polymer Systems3
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons3
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces3
0.017500877380371