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

Article	Citations
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes	38
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities	22
Parameterized Complexity of Minimum Membership Dominating Set	18
A New Lower Bound for Deterministic Truthful Scheduling	16
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability	15
Particle-Based Assembly Using Precise Global Control	14
Agglomerative Clustering of Growing Squares	12
Minimizing Energy Consumption for Real-Time Tasks on Heterogeneous Platforms Under Deadline and Reliability Constraints	12
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model	12
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs	10
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes	10
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules	9
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings	8
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs	8
Coloring Bridge-Free Antiprismatic Graphs	8
On Approximating Degree-Bounded Network Design Problems	7
Few Cuts Meet Many Point Sets	7
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping	7
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width	7
Permutation-constrained Common String Partitions with Applications	7
Bounding the Inefficiency of Compromise in Opinion Formation	7
An Axiomatic Approach to Time-Dependent Shortest Path Oracles	7
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)	6
Faster Graph Coloring in Polynomial Space	6
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes	6

Online Unit Clustering and Unit Covering in Higher Dimensions	6
Parity Permutation Pattern Matching	6
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)	6
Maximum Box Problem on Stochastic Points	6
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation	6
Parameterised and Fine-Grained Subgraph Counting, Modulo 2	6
Enumeration of Maximal Common Subsequences Between Two Strings	6
On the Tractability of Covering a Graph with 2-Clubs	6
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties	5
List Covering of Regular Multigraphs with Semi-edges	5
Conflict-Free Coloring Bounds on Open Neighborhoods	5
Graph Searches and Their End Vertices	5
Group Activity Selection with Few Agent Types	5
CNF Satisfiability in a Subspace and Related Problems	5
The Time Complexity of Consensus Under Oblivious Message Adversaries	5
Fast Mutation in Crossover-Based Algorithms	5
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs	5
Online Geometric Covering and Piercing	5
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm	5
Additive Approximation of Generalized Turán Questions	5
Better Hardness Results for the Minimum Spanning Tree Congestion Problem	5
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width	5
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems	4
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs	4
Computing Minimal Unique Substrings for a Sliding Window	4
Token Sliding on Graphs of Girth Five	4
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems	4
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number	4
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022	4
Improved FPT Algorithms for Deletion to Forest-Like Structures	4
Machine Covering in the Random-Order Model	4
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs	4
Mincut Sensitivity Data Structures for the Insertion of an Edge	4
Publisher Correction: Longest Common Substring with Approximately k Mismatches	4
Convergence of the Number of Period sets in Strings	4
Guest Editorial: Special Issue on Theoretical Informatics	4
Lower Bounds from Fitness Levels Made Easy	4
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data	4
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage	4
Connectivity with Uncertainty Regions Given as Line Segments	4
Linear-Time Recognition of Double-Threshold Graphs	4
Faster Cut Sparsification of Weighted Graphs	3
General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs	3
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem	3
How Fitness Aggregation Methods Affect the Performance of Competitive CoEAs on Bilinear Problems	3
Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation	3
Editorial	3
Leader Election in Well-Connected Graphs	3
A Polynomial Kernel for Funnel Arc Deletion Set	3
On the Parameterized Complexity of Maximum Degree Contraction Problem	3

Editor’s Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium	3
Dynamic Averaging Load Balancing on Cycles	3
Enumerating Minimal Solution Sets for Metric Graph Problems	3
Fully Dynamic k-Center Clustering with Outliers	3
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem	3
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters	3
Dynamic Data Structures for Timed Automata Acceptance	3
Posimodular Function Optimization	3
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks	3
A Refined Branching Algorithm for the Maximum Satisfiability Problem	3
On Scheduling Mechanisms Beyond the Worst Case	3
Approximating Multistage Matching Problems	3
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates	3
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs	3
Preclustering Algorithms for Imprecise Points	3
On Structural Parameterizations of the Harmless Set Problem	3
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes	3
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs	3
Parameterized Complexity of Directed Spanner Problems	3
Contraction Bidimensionality of Geometric Intersection Graphs	3
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions	2
Connected Subgraph Defense Games	2
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation	2
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021	2
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient	2
A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions	2
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees	2
Competitive Vertex Recoloring	2
On 3-Coloring of ($$2P_4,C_5$$)-Free Graphs	2
On Finding the Best and Worst Orientations for the Metric Dimension	2
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds	2
A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks	2
Reforming an Envy-Free Matching	2
Component Order Connectivity in Directed Graphs	2
Scheduling in the Random-Order Model	2
Online Budgeted Maximum Coverage	2
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics	2
Reconfiguring Shortest Paths in Graphs	2
Approximate Minimum Selection with Unreliable Comparisons	2
Linear Space Data Structures for Finite Groups with Constant Query-Time	2
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms	2
Shortest Beer Path Queries in Outerplanar Graphs	2
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems	2
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs	2
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution	2
Small Candidate Set for Translational Pattern Search	2
Safety in s-t Paths, Trails and Walks	2
Online Paging with Heterogeneous Cache Slots	2
Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations	2
Finding Matching Cuts in H-Free Graphs	2
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound	2
Reconfiguration of the Union of Arborescences	2
Perfect Matchings with Crossings	2
Recognizing k-Clique Extendible Orderings	2
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots	2
Computing Generalized Convolutions Faster Than Brute Force	2
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry	2
Testing Connectedness of Images	2
Enumeration of Support-Closed Subsets in Confluent Systems	2
Finding Geometric Facilities with Location Privacy	2
Tight Bounds for Online Weighted Tree Augmentation	2
Reducing Graph Parameters by Contractions and Deletions	2
Computing and Listing Avoidable Vertices and Paths	2
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems	2
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion	2
Adaptive Succinctness	2
Runtime Analysis with Variable Cost	2
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints	2
Approximation Schemes for the Generalized Extensible Bin Packing Problem	2
Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners	2
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario	2
Streaming Dictionary Matching with Mismatches	2