OOIR: Observatory of International Research

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

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

Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter	3
An Improved Drift Theorem for Balanced Allocations	3
Better Distance Preservers and Additive Spanners	3
SETH-based Lower Bounds for Subset Sum and Bicriteria Path	3
Adaptive Shivers Sort: An Alternative Sorting Algorithm	3
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators	3
Tiling with Squares and Packing Dominos in Polynomial Time	3
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams	3
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons	3
Scalable High-Quality Hypergraph Partitioning	3
Additive Sparsification of CSPs	3
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable	3
Synchronized Planarity with Applications to Constrained Planarity Problems	3
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width	3
Algorithms for Weighted Independent Transversals and Strong Colouring	3
I/O-Efficient Algorithms for Topological Sort and Related Problems	3
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees	3
Load Thresholds for Cuckoo Hashing with Overlapping Blocks	3
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes	3
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs	3
Improving the Smoothed Complexity of FLIP for Max Cut Problems	2
Approximating Geometric Knapsack via L-packings	2
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time	2
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance	2
Navigating in Trees with Permanently Noisy Advice	2
Discrete Fréchet Distance under Translation	2
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems	2
A Lower Bound on Cycle-Finding in Sparse Digraphs	2
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling	2
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space	2
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree	2
Querying a Matrix through Matrix-Vector Products	2
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n ^4/3	2
A Linear-Time n ^0.4 -Approximation for Longest Common Subsequence	2
Generic Non-recursive Suffix Array Construction	2
Network Design for s - t Effective Resistance	2
Improving the Dilation of a Metric Graph by Adding Edges	2
The Complexity of Finding Fair Many-to-One Matchings	1
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains	1
Approximating ( k,ℓ )-Median Clustering for Polygonal Curves	1
Approximating Pathwidth for Graphs of Small Treewidth	1
Dynamic Distribution-Sensitive Point Location	1
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead	1
Shortest Cycles with Monotone Submodular Costs	1
Sublinear Random Access Generators for Preferential Attachment Graphs	1
On β-Plurality Points in Spatial Voting Games	1
Maximum Cardinality f -Matching in Time O ( n ^2/3 m )	1
Fast and Perfect Sampling of Subgraphs and Polymer Systems	1
Popular Matchings with One-Sided Bias	1
Hypergraph Isomorphism for Groups with Restricted Composition Factors	1

Detecting Feedback Vertex Sets of Size k in O ^⋆ (2.7 k ) Time	1
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth	1
Max Flows in Planar Graphs with Vertex Capacities	1
Scattering and Sparse Partitions, and Their Applications	1
Tightening Curves on Surfaces Monotonically with Applications	1
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?	1
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs	1
Peeling Close to the Orientability Threshold – Spatial Coupling in Hashing-Based Data Structures	1
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle	1
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds	1
Universal Algorithms for Clustering Problems	1
Automorphisms and Isomorphisms of Maps in Linear Time	1
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs	1
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems	1
Online Euclidean Spanners	1
Faster Matroid Partition Algorithms	1
Ranked Document Retrieval in External Memory	1
Tight Bounds for Monotone Minimal Perfect Hashing	1
Parameter Estimation for Gibbs Distributions	1
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems	1
2-Approximating Feedback Vertex Set in Tournaments	1