OOIR: Observatory of International Research

Papers

(The TQCC of Algorithmica 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-11-01 to 2025-11-01.)

Article	Citations
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities	25
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes	24
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings	18
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability	16
Particle-Based Assembly Using Precise Global Control	13
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model	13
Minimizing Energy Consumption for Real-Time Tasks on Heterogeneous Platforms Under Deadline and Reliability Constraints	12
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes	11
Agglomerative Clustering of Growing Squares	10
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs	10
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs	9
On the Tractability of Covering a Graph with 2-Clubs	9
Coloring Bridge-Free Antiprismatic Graphs	9
Parameterized Complexity of Minimum Membership Dominating Set	9
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules	9
An Axiomatic Approach to Time-Dependent Shortest Path Oracles	8
Enumeration of Maximal Common Subsequences Between Two Strings	8
On Approximating Degree-Bounded Network Design Problems	8
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width	8
Permutation-constrained Common String Partitions with Applications	8
Few Cuts Meet Many Point Sets	8
Bounding the Inefficiency of Compromise in Opinion Formation	8
Online Unit Clustering and Unit Covering in Higher Dimensions	8
Online Geometric Covering and Piercing	7
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation	7

Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)	7
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes	7
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)	7
CNF Satisfiability in a Subspace and Related Problems	6
Parity Permutation Pattern Matching	6
Faster Graph Coloring in Polynomial Space	6
Conflict-Free Coloring Bounds on Open Neighborhoods	6
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm	6
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties	6
Better Hardness Results for the Minimum Spanning Tree Congestion Problem	6
Parameterised and Fine-Grained Subgraph Counting, Modulo 2	6
The Time Complexity of Consensus Under Oblivious Message Adversaries	6
Fast Mutation in Crossover-Based Algorithms	6
Additive Approximation of Generalized Turán Questions	6
List Covering of Regular Multigraphs with Semi-edges	6
Graph Searches and Their End Vertices	5
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems	5
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs	5
Group Activity Selection with Few Agent Types	5
Connectivity with Uncertainty Regions Given as Line Segments	5
Mincut Sensitivity Data Structures for the Insertion of an Edge	5
Publisher Correction: Longest Common Substring with Approximately k Mismatches	5
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems	5
Convergence of the Number of Period sets in Strings	5
Token Sliding on Graphs of Girth Five	4
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022	4
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs	4
Preclustering Algorithms for Imprecise Points	4
General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs	4
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs	4
Parameterized Complexity of Directed Spanner Problems	4
Enumerating Minimal Solution Sets for Metric Graph Problems	4
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data	4
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs	4
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number	4
Machine Covering in the Random-Order Model	4
A Polynomial Kernel for Funnel Arc Deletion Set	4
On Scheduling Mechanisms Beyond the Worst Case	4
Fully Dynamic k-Center Clustering with Outliers	4
Faster Cut Sparsification of Weighted Graphs	4
Lower Bounds from Fitness Levels Made Easy	4
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage	4
Guest Editorial: Special Issue on Theoretical Informatics	4
Linear-Time Recognition of Double-Threshold Graphs	4
Dynamic Averaging Load Balancing on Cycles	4
Editorial	4
Dynamic Data Structures for Timed Automata Acceptance	4
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks	4
Improved FPT Algorithms for Deletion to Forest-Like Structures	4
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient	3

A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates	3
Testing Connectedness of Images	3
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters	3
Enumeration of Support-Closed Subsets in Confluent Systems	3
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs	3
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution	3
Approximating Multistage Matching Problems	3
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion	3
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput	3
Posimodular Function Optimization	3
Linear Space Data Structures for Finite Groups with Constant Query-Time	3
On Structural Parameterizations of the Harmless Set Problem	3
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms	3
Leader Election in Well-Connected Graphs	3
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems	3
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes	3
Computing and Listing Avoidable Vertices and Paths	3
Editor’s Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium	3
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force	3
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds	3
A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks	3
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021	3
On the Parameterized Complexity of Maximum Degree Contraction Problem	3
Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners	3
Runtime Analysis with Variable Cost	3
Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations	3
Contraction Bidimensionality of Geometric Intersection Graphs	3
On 3-Coloring of ($$2P_4,C_5$$)-Free Graphs	3
How Fitness Aggregation Methods Affect the Performance of Competitive CoEAs on Bilinear Problems	3
Tight Bounds for Online Weighted Tree Augmentation	3
A Refined Branching Algorithm for the Maximum Satisfiability Problem	3
Multistage s–t Path: Confronting Similarity with Dissimilarity	2
On Finding the Best and Worst Orientations for the Metric Dimension	2
Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$	2
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario	2
On the Complexity of Recognizing Wheeler Graphs	2
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation	2
Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries	2
The Farthest Color Voronoi Diagram in the Plane	2
Component Order Connectivity in Directed Graphs	2
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion	2
Reconfiguring Shortest Paths in Graphs	2
Shortest Beer Path Queries in Outerplanar Graphs	2
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs	2
Combination Algorithms for Steiner Tree Variants	2
Metric Violation Distance: Hardness and Approximation	2
Level-Planar Drawings with Few Slopes	2
Small Candidate Set for Translational Pattern Search	2
Approximate Minimum Selection with Unreliable Comparisons	2
A Weight-Scaling Algorithm for f-Factors of Multigraphs	2
Perfect Matchings with Crossings	2
Online Paging with Heterogeneous Cache Slots	2
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions	2
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $$\mathbb {R}^2$$	2
Finding Matching Cuts in H-Free Graphs	2
Approximation Schemes for the Generalized Extensible Bin Packing Problem	2
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound	2
Computing Generalized Convolutions Faster Than Brute Force	2
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs	2
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics	2
One-Pass Additive-Error Subset Selection for $$\ell _{p}$$ Subspace Approximation and (k, p)-Clustering	2
On Flipping the Fréchet Distance	2
Faster Minimization of Tardy Processing Time on a Single Machine	2
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems	2
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry	2
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited	2
Reducing Graph Parameters by Contractions and Deletions	2
Reconfiguration of the Union of Arborescences	2
Competitive Vertex Recoloring	2
Does Comma Selection Help to Cope with Local Optima?	2
A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions	2
Matching Cuts in Graphs of High Girth and H-Free Graphs	2
Reforming an Envy-Free Matching	2
Finding Geometric Facilities with Location Privacy	2
Constructing the first (and coolest) fixed-content universal cycle	2
Stable Matchings, One-Sided Ties, and Approximate Popularity	2
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots	2