Algorithmica

Article	Citations
The Runtime of the Compact Genetic Algorithm on Jump Functions	24
Finding Temporal Paths Under Waiting Time Constraints	22
Runtime Analysis for Self-adaptive Mutation Rates	21
Guess Free Maximization of Submodular and Linear Sums	20
The Complex Parameter Landscape of the Compact Genetic Algorithm	17
An Adversarial Model for Scheduling with Testing	17
On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms	17
Multiplicative Up-Drift	14
A New Lower Bound for Classic Online Bin Packing	14
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem	14
Fast Mutation in Crossover-Based Algorithms	13
Dynamic and Internal Longest Common Substring	12
Self-Adjusting Mutation Rates with Provably Optimal Success Rules	12
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint	12
A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions	12
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization	12
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem	11
Does Comma Selection Help to Cope with Local Optima?	11
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers	11
On the Tree Augmentation Problem	9
Matching Cut in Graphs with Large Minimum Degree	9
Upward Planar Morphs	9
Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm	8
A Tight Runtime Analysis for the $${(\mu + \lambda )}$$ EA	8
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set	8

Lempel–Ziv-Like Parsing in Small Space	8
Compact Distributed Certification of Planar Graphs	7
Improved Online Algorithms for Knapsack and GAP in the Random Order Model	7
List 3-Coloring Graphs with No Induced $$P_6+rP_3$$	7
The Power of Linear-Time Data Reduction for Maximum Matching	7
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths	7
On H-Topological Intersection Graphs	7
The Largest Connected Subgraph Game	6
Deterministic Treasure Hunt in the Plane with Angular Hints	6
Faster algorithms for counting subgraphs in sparse graphs	6
Parameterized Leaf Power Recognition via Embedding into Graph Products	6
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width	6
Parameterized Dynamic Cluster Editing	6
Best Fit Bin Packing with Random Order Revisited	6
Packing Arc-Disjoint Cycles in Tournaments	6
Parameterized Complexity of Independent Set in H-Free Graphs	6
Fixed-Target Runtime Analysis	5
Distance and Routing Labeling Schemes for Cube-Free Median Graphs	5
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions	5
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness	5
Characterizing Star-PCGs	5
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees	5
Enumeration of Maximal Common Subsequences Between Two Strings	5
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata	5
On Structural Parameterizations of the Edge Disjoint Paths Problem	5
Approximating the Canadian Traveller Problem with Online Randomization	5
Building a Nest by an Automaton	5
Translation Invariant Fréchet Distance Queries	5
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping	5
Budget Feasible Mechanisms on Matroids	4
Online Node- and Edge-Deletion Problems with Advice	4
Computing the Largest Bond and the Maximum Connected Cut of a Graph	4
On Scheduling Coflows	4
Fault-Tolerant Covering Problems in Metric Spaces	4
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks	4
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots	4
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems	4
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs	4
Runtime Analyses of the Population-Based Univariate Estimation of Distribution Algorithms on LeadingOnes	4
Popular Matchings in Complete Graphs	4
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games	4
Approximate Minimum Selection with Unreliable Comparisons	4
Approximate Generalized Matching: f-Matchings and f-Edge Covers	4
Twin-width and Polynomial Kernels	4
Conflict-Free Coloring Bounds on Open Neighborhoods	4
Flip Distances Between Graph Orientations	4
A New Algorithm for the $$^K$$DMDGP Subclass of Distance Geometry Problems with Exact Distances	4
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization	4
Towards a Polynomial Kernel for Directed Feedback Vertex Set	3
Approximation Schemes for the Generalized Extensible Bin Packing Problem	3

Graph Isomorphism for $$(H_1,H_2)$$-Free Graphs: An Almost Complete Dichotomy	3
Covert Computation in Self-Assembled Circuits	3
Eulerian Walks in Temporal Graphs	3
Asymptotic Analysis of q-Recursive Sequences	3
A Fast Algorithm for the Product Structure of Planar Graphs	3
Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization	3
A Polynomial Kernel for Distance-Hereditary Vertex Deletion	3
Agglomerative Clustering of Growing Squares	3
On the Complexity of Recognizing Wheeler Graphs	3
The Heaviest Induced Ancestors Problem: Better Data Structures and Applications	3
Mechanisms for (Mis)allocating Scientific Credit	3
Hardness of Metric Dimension in Graphs of Constant Treewidth	3
Fast and Longest Rollercoasters	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
Online Unit Clustering and Unit Covering in Higher Dimensions	3
Internal Dictionary Matching	3
Tight Bounds for Online Coloring of Basic Graph Classes	3
A Refined Branching Algorithm for the Maximum Satisfiability Problem	3
An Improved Upper Bound on the Queue Number of Planar Graphs	3
Metric Dimension Parameterized By Treewidth	3
Dynamic Data Structures for Timed Automata Acceptance	3
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality	3
Online Multistage Subset Maximization Problems	3
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions	3
Mincut Sensitivity Data Structures for the Insertion of an Edge	3
Approximation Algorithms for Maximally Balanced Connected Graph Partition	3
Relaxing the Irrevocability Requirement for Online Graph Algorithms	3
Maximizing Dominance in the Plane and its Applications	3
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time	3
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs	3
The Inverse Voronoi Problem in Graphs I: Hardness	3
Correlation Clustering in Data Streams	3
Subgraph Isomorphism on Graph Classes that Exclude a Substructure	3
Parameterized Complexity of Graph Burning	3
Cluster Deletion on Interval Graphs and Split Related Graphs	3
Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs	3
Enumeration of Support-Closed Subsets in Confluent Systems	2
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth	2
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees	2
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling	2
A Polynomial Kernel for Diamond-Free Editing	2
Near-Optimal Search Time in $$\delta $$-Optimal Space, and Vice Versa	2
Simultaneous Feedback Edge Set: A Parameterized Perspective	2
Double String Tandem Repeats	2
On Maximizing Sums of Non-monotone Submodular and Linear Functions	2
Facility Reallocation on the Line	2
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints	2
Practical Budgeted Submodular Maximization	2
Sorting a Permutation by Best Short Swaps	2
Approximating Global Optimum for Probabilistic Truth Discovery	2
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint	2
Finding Matching Cuts in H-Free Graphs	2
Online Makespan Scheduling with Job Migration on Uniform Machines	2
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings	2
Edge Exploration of Temporal Graphs	2
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem	2
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem	2
Solving String Problems on Graphs Using the Labeled Direct Product	2
Greed is Good for Deterministic Scale-Free Networks	2
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes	2
Algorithms and Complexity on Indexing Founder Graphs	2
An Axiomatic Approach to Time-Dependent Shortest Path Oracles	2
Parallel Online Algorithms for the Bin Packing Problem	2
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints	2
Approximating k-Connected m-Dominating Sets	2
Structural Parameterizations with Modulator Oblivion	2
Parameterized Complexity of Maximum Edge Colorable Subgraph	2
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number	2
Graph Searches and Their End Vertices	2
Learning Privately with Labeled and Unlabeled Examples	2
CNF Satisfiability in a Subspace and Related Problems	2
Embedding Graphs into Embedded Graphs	2
Exponential-Time Quantum Algorithms for Graph Coloring Problems	2
Improved Bounds for Open Online Dial-a-Ride on the Line	2
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes	2
Faster Minimization of Tardy Processing Time on a Single Machine	2
Algorithms for p-Faulty Search on a Half-Line	2
Optimal Matroid Partitioning Problems	2

A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes	2
Computing Minimal Unique Substrings for a Sliding Window	2
Space-Efficient Vertex Separators for Treewidth	2
Optimal Centrality Computations Within Bounded Clique-Width Graphs	2
The Inverse Voronoi Problem in Graphs II: Trees	2
Correction to: Guess Free Maximization of Submodular and Linear Sums	2
Enumerating k-Arc-Connected Orientations	2
Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location	2