OOIR: Observatory of International Research

Papers

(The TQCC of ACM Transactions on Algorithms is 2. 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-11-01 to 2024-11-01.)

Article	Citations
Optimal-Time Dictionary-Compressed Indexes	26
Polynomial-time Algorithm for Maximum Weight Independent Set on P ₆ -free Graphs	16
Deterministic APSP, Orthogonal Vectors, and More	13
Randomized Contractions Meet Lean Decompositions	13
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time	10
A Learned Approach to Design Compressed Rank/Select Data Structures	10
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space	9
Zeros of Holant Problems	8
SETH-based Lower Bounds for Subset Sum and Bicriteria Path	8
On the Complexity of String Matching for Graphs	7
A PTAS for Capacitated Vehicle Routing on Trees	7
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms	7
Querying a Matrix through Matrix-Vector Products	6
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem	6
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry	6
The Quest for Strong Inapproximability Results with Perfect Completeness	5
Approximating Geometric Knapsack via L-packings	5
Fine-grained Complexity Analysis of Two Classic TSP Variants	5
Tight Bounds for Online TSP on the Line	5
Zip Trees	4
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains	4
Rapid Mixing from Spectral Independence beyond the Boolean Domain	4
Discrete Fréchet Distance under Translation	4
Tolerant Testers of Image Properties	3
Online Metric Algorithms with Untrusted Predictions	3

Fréchet Distance for Uncertain Curves	3
Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma	3
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems	3
Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space	3
Constant-time Dynamic (Δ +1)-Coloring	3
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain	3
Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm	3
Hypergraph Isomorphism for Groups with Restricted Composition Factors	3
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons	3
Smaller Cuts, Higher Lower Bounds	3
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games	3
Tight Bounds for ℓ ₁ Oblivious Subspace Embeddings	3
Fast and Perfect Sampling of Subgraphs and Polymer Systems	3
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams	3
Navigating in Trees with Permanently Noisy Advice	3
I/O-Efficient Algorithms for Topological Sort and Related Problems	2
Online Service with Delay	2
Online Algorithms for Weighted Paging with Predictions	2
Sparse Backbone and Optimal Distributed SINR Algorithms	2
Sublinear Random Access Generators for Preferential Attachment Graphs	2
Universal Algorithms for Clustering Problems	2
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter	2
Better Distance Preservers and Additive Spanners	2
Exact Distance Oracles for Planar Graphs with Failing Vertices	2
Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election	2
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension	2
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams	2
2-Approximating Feedback Vertex Set in Tournaments	2
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems	2
Optimal Substring Equality Queries with Applications to Sparse Text Indexing	2
Improving the Smoothed Complexity of FLIP for Max Cut Problems	2
Scalable High-Quality Hypergraph Partitioning	2
Dynamic Geometric Set Cover and Hitting Set	2
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching	2
Detecting Feedback Vertex Sets of Size k in O ^⋆ (2.7 k ) Time	2
Dynamic Distribution-Sensitive Point Location	2
Network Design for s - t Effective Resistance	2
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time	2