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

Article	Citations
A Face Cover Perspective to ℓ ₁ Embeddings of Planar Graphs	21
Cluster Editing Parameterized above Modification-disjoint P ₃ -packings	18
A PTAS for Capacitated Vehicle Routing on Trees	17
Generic Techniques for Building Top- k Structures	15
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue	11
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond	10
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems	9
Collapsing the Tower—On the Complexity of Multistage Stochastic IPs	9
Tiling with Squares and Packing Dominos in Polynomial Time	9
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n ^4/3	8
Node-Differentially Private Estimation of the Number of Connected Components	7
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter	7
Better Sum Estimation via Weighted Sampling	6
Almost Consistent Systems of Linear Equations	6
Online Euclidean Spanners	6
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle	6
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs	6
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs	6
The Query Complexity of Searching Trees with Permanently Noisy Advice	5
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry	5
A Lower Bound on Cycle-Finding in Sparse Digraphs	4
Online Lewis Weight Sampling	4
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue	4
Competitive Online Search Trees on Trees	4
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees	4

On the Complexity of String Matching for Graphs	4
Dynamic Geometric Set Cover and Hitting Set	4
Counting Homomorphic Cycles in Degenerate Graphs	4
On the Complexity of Symmetric vs. Functional PCSPs	4
Combinatorial Generation via Permutation Languages. IV. Elimination Trees	4
A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\) -Approximation for Directed Steiner Tree in Planar Graphs	4
Network Design for s - t Effective Resistance	3
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons	3
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance	3
Parameterized Approximation Schemes for Biclique-Free Max \(\boldsymbol{k}\) -Weight SAT and Max Coverage	3
Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem	3
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree	3
Paging and the Address-Translation Problem	3
SETH-based Lower Bounds for Subset Sum and Bicriteria Path	3
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix	3
Hypergraph Isomorphism for Groups with Restricted Composition Factors	3
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling	3
A Linear-Time n ^0.4 -Approximation for Longest Common Subsequence	3
Online Coalition Formation under Random Arrival or Coalition Dissolution	3
Faster Matroid Partition Algorithms	3
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs	3
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth	3
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020	2
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue	2
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching	2
String Indexing with Compressed Patterns	2
Efficiency of Self-Adjusting Heaps	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
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints	2
Rerouting Planar Curves and Disjoint Paths	2
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems	2
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages	2
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden	2
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication	2
A Faster Algorithm for Finding Tarski Fixed Points	2
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study	2
Time Dependent Biased Random Walks	2
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue	2
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds	1
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter	1
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs	1
Polynomial-time Trace Reconstruction in the Smoothed Complexity Model	1
Popular Matchings with One-Sided Bias	1
On the Two-Dimensional Knapsack Problem for Convex Polygons	1
Constant-time Dynamic (Δ +1)-Coloring	1
Competitive Data-Structure Dynamization	1
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs	1
Scalable High-Quality Hypergraph Partitioning	1
Detecting Feedback Vertex Sets of Size k in O ^⋆ (2.7 k ) Time	1

Fast and Small Subsampled R-indexes	1
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds	1
Optimal Inapproximability with Universal Factor Graphs	1
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results	1
Exponential Separations in Local Privacy	1
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead	1
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable	1
Exact Distance Oracles for Planar Graphs with Failing Vertices	1
PTAS for Sparse General-valued CSPs	1
Static and Streaming Data Structures for Fréchet Distance Queries	1
Popular Arborescences and Their Matroid Generalization	1
Approximating Pathwidth for Graphs of Small Treewidth	1
Automorphisms and Isomorphisms of Maps in Linear Time	1
Classification via Two-Way Comparisons	1
Tight Bounds for ℓ ₁ Oblivious Subspace Embeddings	1
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs	1
Tree Containment Above Minimum Degree is FPT	1