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

Article	Citations
The Runtime of the Compact Genetic Algorithm on Jump Functions	33
Finding Temporal Paths Under Waiting Time Constraints	28
The Complex Parameter Landscape of the Compact Genetic Algorithm	20
Fast Mutation in Crossover-Based Algorithms	19
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization	15
A New Lower Bound for Classic Online Bin Packing	15
Self-Adjusting Mutation Rates with Provably Optimal Success Rules	14
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers	14
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem	13
Does Comma Selection Help to Cope with Local Optima?	13
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint	13
A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions	13
Matching Cut in Graphs with Large Minimum Degree	11
Compact Distributed Certification of Planar Graphs	9
Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm	9
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems	9
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set	8
Twin-width and Polynomial Kernels	8
Fixed-Target Runtime Analysis	8
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width	7
On H-Topological Intersection Graphs	7
Improved Online Algorithms for Knapsack and GAP in the Random Order Model	7
The Largest Connected Subgraph Game	7
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees	7
Best Fit Bin Packing with Random Order Revisited	7

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization	6
Runtime Analyses of the Population-Based Univariate Estimation of Distribution Algorithms on LeadingOnes	6
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness	6
Packing Arc-Disjoint Cycles in Tournaments	6
Faster algorithms for counting subgraphs in sparse graphs	6
Correlation Clustering in Data Streams	6
Computing the Largest Bond and the Maximum Connected Cut of a Graph	6
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping	6
On Structural Parameterizations of the Edge Disjoint Paths Problem	6
Online Unit Clustering and Unit Covering in Higher Dimensions	5
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks	5
Budget Feasible Mechanisms on Matroids	5
Approximating the Canadian Traveller Problem with Online Randomization	5
Enumeration of Maximal Common Subsequences Between Two Strings	5
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots	5
Approximation Algorithms for Maximally Balanced Connected Graph Partition	5
Eulerian Walks in Temporal Graphs	5
Translation Invariant Fréchet Distance Queries	5
A New Algorithm for the $$^K$$DMDGP Subclass of Distance Geometry Problems with Exact Distances	5
Fast and Longest Rollercoasters	5
Online Node- and Edge-Deletion Problems with Advice	5
Faster Minimization of Tardy Processing Time on a Single Machine	4
Towards a Polynomial Kernel for Directed Feedback Vertex Set	4
Approximate Generalized Matching: f-Matchings and f-Edge Covers	4
Popular Matchings in Complete Graphs	4
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions	4
Approximate Minimum Selection with Unreliable Comparisons	4
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time	4
Practical Budgeted Submodular Maximization	4
Algorithms and Complexity on Indexing Founder Graphs	4
Approximation Schemes for the Generalized Extensible Bin Packing Problem	4
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs	4
Conflict-Free Coloring Bounds on Open Neighborhoods	4
$${\mathcal {U}}$$-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited	3
Cluster Deletion on Interval Graphs and Split Related Graphs	3
A Fast Algorithm for the Product Structure of Planar Graphs	3
Mechanisms for (Mis)allocating Scientific Credit	3
Asymptotic Analysis of q-Recursive Sequences	3
Online Multistage Subset Maximization Problems	3
Agglomerative Clustering of Growing Squares	3
Mincut Sensitivity Data Structures for the Insertion of an Edge	3
Linear-Time Recognition of Double-Threshold Graphs	3
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs	3
Additive Approximation of Generalized Turán Questions	3
Maximizing Dominance in the Plane and its Applications	3
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes	3
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows	3
Parameterized Complexity of Graph Burning	3
Finding and Counting Permutations via CSPs	3
Exponential-Time Quantum Algorithms for Graph Coloring Problems	3

Internal Dictionary Matching	3
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics	3
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution	3
A Polynomial Kernel for Distance-Hereditary Vertex Deletion	3
Metric Dimension Parameterized By Treewidth	3
Hardness of Metric Dimension in Graphs of Constant Treewidth	3
Online Makespan Scheduling with Job Migration on Uniform Machines	3
Runtime Analysis for Permutation-based Evolutionary Algorithms	3
A Meta-Theorem for Distributed Certification	3
CNF Satisfiability in a Subspace and Related Problems	3
Solving String Problems on Graphs Using the Labeled Direct Product	3
Edge Exploration of Temporal Graphs	3
On the Complexity of Recognizing Wheeler Graphs	3
Double String Tandem Repeats	3
The Heaviest Induced Ancestors Problem: Better Data Structures and Applications	3
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem	3
A Polynomial Kernel for Diamond-Free Editing	3
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes	3
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints	3
Gapped Indexing for Consecutive Occurrences	3
A Refined Branching Algorithm for the Maximum Satisfiability Problem	3
Succinct Permutation Graphs	3
Finding Matching Cuts in H-Free Graphs	3
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint	3
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings	3
On Subgraph Complementation to H-free Graphs	3
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality	3
Relaxing the Irrevocability Requirement for Online Graph Algorithms	3
Dynamic Data Structures for Timed Automata Acceptance	3
Near-Optimal Quantum Algorithms for String Problems	2
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number	2
Parameterized Complexity of Maximum Edge Colorable Subgraph	2
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees	2
Near-Optimal Search Time in $$\delta $$-Optimal Space, and Vice Versa	2
More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments	2
A Faster Interior-Point Method for Sum-of-Squares Optimization	2
An Axiomatic Approach to Time-Dependent Shortest Path Oracles	2
An Improved Upper Bound on the Queue Number of Planar Graphs	2
Approximating k-Connected m-Dominating Sets	2
Parameterized Counting of Partially Injective Homomorphisms	2
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees	2
Structural Parameterizations with Modulator Oblivion	2
Computing Minimal Unique Substrings for a Sliding Window	2
Extended MSO Model Checking via Small Vertex Integrity	2
Correction to: Guess Free Maximization of Submodular and Linear Sums	2
Sorting a Permutation by Best Short Swaps	2
Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives	2
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem	2
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets	2
Algorithms for p-Faulty Search on a Half-Line	2
Algorithms for the Unit-Cost Stochastic Score Classification Problem	2
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity	2
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling	2
Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter	2
Space-Efficient Vertex Separators for Treewidth	2
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between	2
Parallel Online Algorithms for the Bin Packing Problem	2
Optimal Centrality Computations Within Bounded Clique-Width Graphs	2
Connected Subgraph Defense Games	2
Graph Searches and Their End Vertices	2
The Time Complexity of Consensus Under Oblivious Message Adversaries	2
Enumeration of Support-Closed Subsets in Confluent Systems	2
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes	2
Facility Reallocation on the Line	2
Approximating Multistage Matching Problems	2
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem	2
Improved Bounds for Open Online Dial-a-Ride on the Line	2
Lower Bounds from Fitness Levels Made Easy	2
Particle-Based Assembly Using Precise Global Control	2
Optimal Matroid Partitioning Problems	2
On Maximizing Sums of Non-monotone Submodular and Linear Functions	2