OOIR: Observatory of International Research

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-03-01 to 2024-03-01.)

Article	Citations
Optimal-Time Dictionary-Compressed Indexes	23
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)	20
Linear-time String Indexing and Analysis in Small Space	13
The Non-Uniform k -Center Problem	13
Randomized Contractions Meet Lean Decompositions	11
Polynomial-time Algorithm for Maximum Weight Independent Set on P ₆ -free Graphs	11
A Linear-Time Algorithm for Seeds Computation	10
Deterministic APSP, Orthogonal Vectors, and More	10
Time- and Space-optimal Algorithm for the Many-visits TSP	8
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time	8
An Improved Isomorphism Test for Bounded-tree-width Graphs	8
Zeros of Holant Problems	8
Ramsey Spanning Trees and Their Applications	8
A Learned Approach to Design Compressed Rank/Select Data Structures	8
The Complexity of Cake Cutting with Unequal Shares	7
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants	7
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms	6
Holant Clones and the Approximability of Conservative Holant Problems	6
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space	6
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry	6
Symmetry Exploitation for Online Machine Covering with Bounded Migration	6
A PTAS for Capacitated Vehicle Routing on Trees	6
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems	6
Doubly Balanced Connected Graph Partitioning	6
SETH-based Lower Bounds for Subset Sum and Bicriteria Path	5

Improved Dynamic Graph Coloring	5
Querying a Matrix through Matrix-Vector Products	5
Dynamic Parameterized Problems and Algorithms	5
Fine-grained Complexity Analysis of Two Classic TSP Variants	5
Parameterized Hardness of Art Gallery Problems	5
Deterministic Sparse Suffix Sorting in the Restore Model	5
Edge Estimation with Independent Set Oracles	4
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem	4
Discrete Fréchet Distance under Translation	4
On the Complexity of String Matching for Graphs	4
Random Walks on Small World Networks	4
The Quest for Strong Inapproximability Results with Perfect Completeness	4
Tight Bounds for Online TSP on the Line	4
Testing Bounded Arboricity	3
Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma	3
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces	3
Zip Trees	3
Approximating Geometric Knapsack via L-packings	3
k -center Clustering under Perturbation Resilience	3
Fast and Perfect Sampling of Subgraphs and Polymer Systems	3
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems	3
A PTAS for Euclidean TSP with Hyperplane Neighborhoods	3