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

Article	Citations
Editorial	21
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time	12
A Learned Approach to Design Compressed Rank/Select Data Structures	11
Polynomial-time Algorithm for Maximum Weight Independent Set on P ₆ -free Graphs	9
Smaller Cuts, Higher Lower Bounds	9
Exact Distance Oracles for Planar Graphs with Failing Vertices	8
Deterministic Leader Election in Anonymous Radio Networks	8
Reliable Spanners for Metric Spaces	8
Generic Techniques for Building Top- k Structures	7
A Generalization of Self-Improving Algorithms	6
Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space	6
PTAS for Sparse General-valued CSPs	5
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes	5
Scalable High-Quality Hypergraph Partitioning	5
Counting Homomorphic Cycles in Degenerate Graphs	5
A PTAS for Capacitated Vehicle Routing on Trees	4
Flow-augmentation II: Undirected Graphs	4
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs	4
Towards Optimal Moment Estimation in Streaming and Distributed Models	4
Collapsing the Tower—On the Complexity of Multistage Stochastic IPs	4
Cluster Editing Parameterized above Modification-disjoint P ₃ -packings	4
On the External Validity of Average-case Analyses of Graph Algorithms	4
Competitive Data-Structure Dynamization	4
Deterministic Replacement Path Covering	3
Algorithms for Weighted Independent Transversals and Strong Colouring	3

Better Distance Preservers and Additive Spanners	3
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time	3
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width	3
Querying a Matrix through Matrix-Vector Products	3
SETH-based Lower Bounds for Subset Sum and Bicriteria Path	3
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons	3
An Improved Drift Theorem for Balanced Allocations	3
A Lower Bound on Cycle-Finding in Sparse Digraphs	3
A Linear-Time n ^0.4 -Approximation for Longest Common Subsequence	3
Improving the Dilation of a Metric Graph by Adding Edges	3
Improving the Smoothed Complexity of FLIP for Max Cut Problems	3
I/O-Efficient Algorithms for Topological Sort and Related Problems	3
A Face Cover Perspective to ℓ ₁ Embeddings of Planar Graphs	3
Navigating in Trees with Permanently Noisy Advice	3
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators	3
Load Thresholds for Cuckoo Hashing with Overlapping Blocks	3
Discrete Fréchet Distance under Translation	3
Approximating Geometric Knapsack via L-packings	3
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space	3
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems	2
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams	2
Additive Sparsification of CSPs	2
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable	2
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs	2
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling	2
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n ^4/3	2
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter	2
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance	2
Tiling with Squares and Packing Dominos in Polynomial Time	2
Generic Non-recursive Suffix Array Construction	2
Adaptive Shivers Sort: An Alternative Sorting Algorithm	2
Width Helps and Hinders Splitting Flows	2
Network Design for s - t Effective Resistance	2
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees	2
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes	2
Synchronized Planarity with Applications to Constrained Planarity Problems	2
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree	2