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-05-01 to 2026-05-01.)
ArticleCitations
A Face Cover Perspective to ℓ 1 Embeddings of Planar Graphs19
Cluster Editing Parameterized above Modification-disjoint P 3 -packings15
Generic Techniques for Building Top- k Structures14
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond13
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue10
Collapsing the Tower—On the Complexity of Multistage Stochastic IPs10
A PTAS for Capacitated Vehicle Routing on Trees9
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter8
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain8
Node-Differentially Private Estimation of the Number of Connected Components8
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems8
On Parallel ???? -Center Clustering7
Online Euclidean Spanners6
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle6
Better Sum Estimation via Weighted Sampling6
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs6
Tiling with Squares and Packing Dominos in Polynomial Time6
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs6
Almost Consistent Systems of Linear Equations6
On the Complexity of Symmetric vs. Functional PCSPs5
The Query Complexity of Searching Trees with Permanently Noisy Advice5
Dynamic Geometric Set Cover and Hitting Set5
Competitive Online Search Trees on Trees5
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
Online Lewis Weight Sampling5
Lower Bounds for Weighted Matroid Problems4
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling4
Counting Homomorphic Cycles in Degenerate Graphs4
Combinatorial Generation via Permutation Languages. IV. Elimination Trees4
A Lower Bound on Cycle-Finding in Sparse Digraphs4
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy4
On the Complexity of String Matching for Graphs4
A Linear-Time n 0.4 -Approximation for Longest Common Subsequence4
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree3
Network Design for s - t Effective Resistance3
Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem3
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix3
Paging and the Address-Translation Problem3
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees3
Hypergraph Isomorphism for Groups with Restricted Composition Factors3
Parameterized Approximation Schemes for Biclique-Free Max k -Weight SAT and Max Coverage3
Online Coalition Formation under Random Arrival or Coalition Dissolution3
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance3
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs3
Faster Matroid Partition Algorithms3
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints2
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden2
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs2
Efficiency of Self-Adjusting Heaps2
Tree Containment above Minimum Degree Is FPT2
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems2
String Indexing with Compressed Patterns2
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication2
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages2
PTAS for Sparse General-valued CSPs2
Recognizing Completely Reachable Automata in Quadratic Time2
A Faster Algorithm for Finding Tarski Fixed Points2
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study2
Rerouting Planar Curves and Disjoint Paths2
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 20202
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue2
Competitive Data-Structure Dynamization2
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension2
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching2
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs1
Exponential Separations in Local Privacy1
Optimal Inapproximability with Universal Factor Graphs1
Shortest Cycles with Monotone Submodular Costs1
Conditional Lower Bounds for Dynamic Geometric Measure Problems1
Polynomial-time Trace Reconstruction in the Smoothed Complexity Model1
Flow-augmentation II: Undirected Graphs1
Approximating Pathwidth for Graphs of Small Treewidth1
Strict Fibonacci Heaps1
Popular Arborescences and Their Matroid Generalization1
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter1
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds1
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results1
Classification via Two-Way Comparisons1
Planar Multiway Cut with Terminals on Few Faces1
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?1
Dependent Rounding with Strong Negative-Correlation, and Scheduling on Unrelated Machines to Minimize Completion Time1
A Generalization of Self-Improving Algorithms1
Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time1
Testing Cluster Structure of Graphs1
Fast and Small Subsampled R-indexes1
Computing MEMs and Relatives on Repetitive Text Collections1
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead1
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds1
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable1
Automorphisms and Isomorphisms of Maps in Linear Time1
On the Two-Dimensional Knapsack Problem for Convex Polygons1
The Complexity of Finding Fair Many-to-One Matchings1
Synchronized Planarity with Applications to Constrained Planarity Problems1
Width Helps and Hinders Splitting Flows1
Static and Streaming Data Structures for Fréchet Distance Queries1
Tiny Pointers1
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs1
Deterministic Replacement Path Covering1
Scalable High-Quality Hypergraph Partitioning1
Popular Matchings with One-Sided Bias1
0.037727117538452