OOIR: Observatory of International Research

Papers

(The TQCC of Algorithmica is 3. 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-08-01 to 2026-08-01.)

Article	Citations
Coloring Bridge-Free Antiprismatic Graphs	18
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs	14
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities	13
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings	12
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules	12
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes	12
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes	12
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs	11
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model	11
Parameterized Complexity of Minimum Membership Dominating Set	10
Minimizing Energy Consumption for Real-Time Tasks on Heterogeneous Platforms Under Deadline and Reliability Constraints	10
On the Tractability of Covering a Graph with 2-Clubs	9
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes	8
Few Cuts Meet Many Point Sets	8
Permutation-constrained Common String Partitions with Applications	8
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)	7
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation	7
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)	7
Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments	7
The Time Complexity of Consensus Under Oblivious Message Adversaries	6
List Covering of Regular Multigraphs with Semi-edges	6
Parity Permutation Pattern Matching	6
Faster Graph Coloring in Polynomial Space	6
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties	6
Group Activity Selection with Few Agent Types	5

Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii	5
Computing Pivot-Minors	5
Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings	5
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems	5
Parameterised and Fine-Grained Subgraph Counting, Modulo 2	5
Fault-Tolerant ST-Diameter Oracles	5
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022	5
Publisher Correction: Longest Common Substring with Approximately k Mismatches	5
Connectivity with Uncertainty Regions Given as Line Segments	5
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs	5
Better Hardness Results for the Minimum Spanning Tree Congestion Problem	5
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems	5
Computing the Minimum Bottleneck Moving Spanning Tree	5
Online Geometric Covering and Piercing	5
Convergence of the Number of Period sets in Strings	5
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage	4
Token Sliding on Graphs of Girth Five	4
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data	4
A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive	4
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks	4
On Structural Parameterizations of the Harmless Set Problem	4
Editor’s Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium	4
How Fitness Aggregation Methods Affect the Performance of Competitive CoEAs on Bilinear Problems	4
A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games	4
On Scheduling Mechanisms Beyond the Worst Case	4
A Fast Algorithm for Computing Zigzag Representatives	4
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs	4
Guest Editorial: Special Issue on Theoretical Informatics	4
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs	4
Fully Dynamic k-Center Clustering with Outliers	4
Leader Election in Well-Connected Graphs	4
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters	4
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput	4
Faster Cut Sparsification of Weighted Graphs	4
Ex-post Stability under Two-Sided Matching: Complexity and Characterization	4
Enumerating Minimal Solution Sets for Metric Graph Problems	4
Dynamic Data Structures for Timed Automata Acceptance	4
Improved FPT Algorithms for Deletion to Forest-Like Structures	4
Reforming an Unfair Allocation by Exchanging Goods	4
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs	4
General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs	4
Bipartite Independent Set Reconfiguration: General and RNA-Inspired Parameterized Algorithms	4
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution	3
A General Technique for Searching in Implicit Sets via Function Inversion	3
A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks	3
The Farthest Color Voronoi Diagram in the Plane	3
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry	3
Reducing Graph Parameters by Contractions and Deletions	3
Finding Matching Cuts in H-Free Graphs	3
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem	3

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound	3
Plus Strategies are Exponentially Slower for Planted Optima of Random Height	3
Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners	3
Linear Space Data Structures for Finite Groups with Constant Query-Time	3
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force	3
Computing Generalized Convolutions Faster Than Brute Force	3
Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids	3
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario	3
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs	3
Finding Geometric Facilities with Location Privacy	3
Testing Connectedness of Images	3
Reconfiguring Shortest Paths in Graphs	3
Correction: Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs	3
Computing and Listing Avoidable Vertices and Paths	3
Runtime Analysis with Variable Cost	3
The Voronoi Diagram of Rotating Rays with Applications to Floodlight Illumination	3
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion	3
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation	3
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems	3
Constructing the first (and coolest) fixed-content universal cycle	3
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021	3
On computing vertex connectivity of 1-planar graphs	3
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms	3
Reforming an Envy-Free Matching	3
Concentration of Submodular Functions and Read-k Families Under Negative Dependence	3