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 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
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter7
Tiling with Squares and Packing Dominos in Polynomial Time7
On Parallel k -Center Clustering7
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs6
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle6
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems6
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
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs5
On the Complexity of Symmetric vs. Functional PCSPs5
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
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue4
Lower Bounds for Weighted Matroid Problems4
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
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
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds2
Incremental Approximate Maximum Flow via Residual Graph Sparsification2
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable2
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension2
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 20202
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems2
PTAS for Sparse General-valued CSPs2
Scalable High-Quality Hypergraph Partitioning2
Recognizing Completely Reachable Automata in Quadratic Time2
Popular Matchings with One-Sided Bias2
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs2
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue2
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden2
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication2
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study2
Tree Containment above Minimum Degree Is FPT2
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds2
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results2
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs2
Efficiency of Self-Adjusting Heaps2
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages2
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching2
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints2
Competitive Data-Structure Dynamization2
A \((2+\varepsilon)\) -Approximation Algorithm for Maximum Independent Set of Rectangles2
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?1
Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time1
Peeling Close to the Orientability Threshold Spatial Coupling in Hashing-Based Data Structures1
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop1
Width Helps and Hinders Splitting Flows1
Strict Fibonacci Heaps1
Strong Approximations and Irrationality in Financial Networks with Derivatives1
Exponential Separations in Local Privacy1
Tight Streaming Lower Bounds for Deterministic Approximate Counting1
Approximating Pathwidth for Graphs of Small Treewidth1
Automorphisms and Isomorphisms of Maps in Linear Time1
Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences1
Scattering and Sparse Partitions, and Their Applications1
Testing Cluster Structure of Graphs1
The Complexity of Finding Fair Many-to-One Matchings1
Synchronized Planarity with Applications to Constrained Planarity Problems1
Conditional Lower Bounds for Dynamic Geometric Measure Problems1
Shortest Cycles with Monotone Submodular Costs1
Classification via Two-Way Comparisons1
On the Two-Dimensional Knapsack Problem for Convex Polygons1
Planar Multiway Cut with Terminals on Few Faces1
Static and Streaming Data Structures for Fréchet Distance Queries1
Fast and Small Subsampled R-indexes1
Short Synchronizing Words for Random Automata1
Tiny Pointers1
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs1
Computing MEMs and Relatives on Repetitive Text Collections1
Approximating ( k,ℓ )-Median Clustering for Polygonal Curves1
Dependent Rounding with Strong Negative-Correlation, and Scheduling on Unrelated Machines to Minimize Completion Time1
Flow-augmentation II: Undirected Graphs1
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter1
Polynomial-time Trace Reconstruction in the Smoothed Complexity Model1
Optimal Inapproximability with Universal Factor Graphs1
Popular Arborescences and Their Matroid Generalization1
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs1
Deterministic Replacement Path Covering1
0.17332696914673