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 2022-06-01 to 2026-06-01.)

Article	Citations
A Face Cover Perspective to ℓ ₁ Embeddings of Planar Graphs	20
Cluster Editing Parameterized above Modification-disjoint P ₃ -packings	16
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond	14
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue	14
Collapsing the Tower—On the Complexity of Multistage Stochastic IPs	11
Generic Techniques for Building Top- k Structures	10
A PTAS for Capacitated Vehicle Routing on Trees	10
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain	10
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems	8
On Parallel ???? -Center Clustering	8
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter	8
Node-Differentially Private Estimation of the Number of Connected Components	7
Tiling with Squares and Packing Dominos in Polynomial Time	7
Better Sum Estimation via Weighted Sampling	6
Almost Consistent Systems of Linear Equations	6
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs	6
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle	6
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs	6
Online Euclidean Spanners	6
The Query Complexity of Searching Trees with Permanently Noisy Advice	5
Dynamic Geometric Set Cover and Hitting Set	5
Online Lewis Weight Sampling	5
Competitive Online Search Trees on Trees	5
On the Complexity of Symmetric vs. Functional PCSPs	5
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue	5

A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\) -Approximation for Directed Steiner Tree in Planar Graphs	5
Lower Bounds for Weighted Matroid Problems	5
On the Complexity of String Matching for Graphs	4
A Lower Bound on Cycle-Finding in Sparse Digraphs	4
Combinatorial Generation via Permutation Languages. IV. Elimination Trees	4
Counting Homomorphic Cycles in Degenerate Graphs	4
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling	4
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy	4
A Linear-Time n ^0.4 -Approximation for Longest Common Subsequence	4
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree	4
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix	3
Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem	3
Paging and the Address-Translation Problem	3
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance	3
Hypergraph Isomorphism for Groups with Restricted Composition Factors	3
Parameterized Approximation Schemes for Biclique-Free Max k -Weight SAT and Max Coverage	3
Network Design for s - t Effective Resistance	3
Online Coalition Formation under Random Arrival or Coalition Dissolution	3
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs	3
Rerouting Planar Curves and Disjoint Paths	3
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees	3
Faster Matroid Partition Algorithms	3
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden	2
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching	2
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue	2
Efficiency of Self-Adjusting Heaps	2
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs	2
Scalable High-Quality Hypergraph Partitioning	2
Incremental Approximate Maximum Flow via Residual Graph Sparsification	2
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages	2
A Faster Algorithm for Finding Tarski Fixed Points	2
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication	2
String Indexing with Compressed Patterns	2
Tree Containment above Minimum Degree Is FPT	2
Competitive Data-Structure Dynamization	2
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs	2
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results	2
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020	2
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study	2
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints	2
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems	2
PTAS for Sparse General-valued CSPs	2
Recognizing Completely Reachable Automata in Quadratic Time	2
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable	2
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension	2
A Generalization of Self-Improving Algorithms	1
Optimal Inapproximability with Universal Factor Graphs	1
Approximating Pathwidth for Graphs of Small Treewidth	1
Popular Arborescences and Their Matroid Generalization	1
Fast and Small Subsampled R-indexes	1

Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds	1
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter	1
Width Helps and Hinders Splitting Flows	1
Conditional Lower Bounds for Dynamic Geometric Measure Problems	1
Deterministic Replacement Path Covering	1
Strict Fibonacci Heaps	1
Exponential Separations in Local Privacy	1
Detecting Feedback Vertex Sets of Size k in O ^⋆ (2.7 k ) Time	1
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs	1
Automorphisms and Isomorphisms of Maps in Linear Time	1
On the Two-Dimensional Knapsack Problem for Convex Polygons	1
Popular Matchings with One-Sided Bias	1
Strong Approximations and Irrationality in Financial Networks with Derivatives	1
Dependent Rounding with Strong Negative-Correlation, and Scheduling on Unrelated Machines to Minimize Completion Time	1
Flow-augmentation II: Undirected Graphs	1
Tiny Pointers	1
Computing MEMs and Relatives on Repetitive Text Collections	1
Classification via Two-Way Comparisons	1
Static and Streaming Data Structures for Fréchet Distance Queries	1
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead	1
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds	1
Testing Cluster Structure of Graphs	1
Polynomial-time Trace Reconstruction in the Smoothed Complexity Model	1
Shortest Cycles with Monotone Submodular Costs	1
Synchronized Planarity with Applications to Constrained Planarity Problems	1
Scattering and Sparse Partitions, and Their Applications	1
Planar Multiway Cut with Terminals on Few Faces	1