Algorithmica

Article	Citations
The Runtime of the Compact Genetic Algorithm on Jump Functions	24
Runtime Analysis for Self-adaptive Mutation Rates	21
Finding Temporal Paths Under Waiting Time Constraints	20
Guess Free Maximization of Submodular and Linear Sums	18
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	15
Multiplicative Up-Drift	14
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem	14
Fast Mutation in Crossover-Based Algorithms	13
Self-Adjusting Mutation Rates with Provably Optimal Success Rules	12
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization	12
A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions	12
A New Lower Bound for Classic Online Bin Packing	12
Dynamic and Internal Longest Common Substring	12
Paired-Domination Problem on Distance-Hereditary Graphs	11
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem	11
Does Comma Selection Help to Cope with Local Optima?	11
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint	11
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers	11
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest	10
Matching Cut in Graphs with Large Minimum Degree	9
On the Tree Augmentation Problem	9
Upward Planar Morphs	9
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
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths	7
The Power of Linear-Time Data Reduction for Maximum Matching	7
List 3-Coloring Graphs with No Induced $$P_6+rP_3$$	7
Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm	7
Compact Distributed Certification of Planar Graphs	7
Online Stochastic Matching: New Algorithms and Bounds	7
Deterministic Treasure Hunt in the Plane with Angular Hints	6
Faster algorithms for counting subgraphs in sparse graphs	6
Best Fit Bin Packing with Random Order Revisited	6
Packing Arc-Disjoint Cycles in Tournaments	6
Improved Online Algorithms for Knapsack and GAP in the Random Order Model	6
Parameterized Dynamic Cluster Editing	6
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width	6
Parameterized Complexity of Independent Set in H-Free Graphs	6
Parameterized Leaf Power Recognition via Embedding into Graph Products	6
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees	5
Succinct Encodings for Families of Interval Graphs	5
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata	5
On Structural Parameterizations of the Edge Disjoint Paths Problem	5
Characterizing Star-PCGs	5
Distance and Routing Labeling Schemes for Cube-Free Median Graphs	5
The Largest Connected Subgraph Game	5
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping	5
Approximating the Canadian Traveller Problem with Online Randomization	5
Building a Nest by an Automaton	5
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions	5
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness	5
Flip Distances Between Graph Orientations	4
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization	4
A Unified Model and Algorithms for Temporal Map Labeling	4
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs	4
Computing the Largest Bond and the Maximum Connected Cut of a Graph	4
On Scheduling Coflows	4
Translation Invariant Fréchet Distance Queries	4
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks	4
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games	4
Budget Feasible Mechanisms on Matroids	4
Online Node- and Edge-Deletion Problems with Advice	4
Fixed-Target Runtime Analysis	4
Fault-Tolerant Covering Problems in Metric Spaces	4
On H-Topological Intersection Graphs	4
A New Algorithm for the $$^K$$DMDGP Subclass of Distance Geometry Problems with Exact Distances	4
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots	4
Twin-width and Polynomial Kernels	4
Conflict-Free Coloring Bounds on Open Neighborhoods	4
Runtime Analyses of the Population-Based Univariate Estimation of Distribution Algorithms on LeadingOnes	4
Popular Matchings in Complete Graphs	4
Asymptotic Analysis of q-Recursive Sequences	3

Online Multistage Subset Maximization Problems	3
Internal Dictionary Matching	3
Mechanisms for (Mis)allocating Scientific Credit	3
Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization	3
Fast and Longest Rollercoasters	3
Graph Isomorphism for $$(H_1,H_2)$$-Free Graphs: An Almost Complete Dichotomy	3
A Polynomial Kernel for Distance-Hereditary Vertex Deletion	3
Covert Computation in Self-Assembled Circuits	3
Metric Dimension Parameterized By Treewidth	3
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time	3
Additive Approximation of Generalized Turán Questions	3
An Improved Upper Bound on the Queue Number of Planar Graphs	3
On the Complexity of Recognizing Wheeler Graphs	3
The Heaviest Induced Ancestors Problem: Better Data Structures and Applications	3
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs	3
Towards a Polynomial Kernel for Directed Feedback Vertex Set	3
Enumeration of Maximal Common Subsequences Between Two Strings	3
Approximate Minimum Selection with Unreliable Comparisons	3
Linear-Time Recognition of Double-Threshold Graphs	3
Tight Bounds for Online Coloring of Basic Graph Classes	3
Mincut Sensitivity Data Structures for the Insertion of an Edge	3
Subgraph Isomorphism on Graph Classes that Exclude a Substructure	3
Approximate Generalized Matching: f-Matchings and f-Edge Covers	3
Maximizing Dominance in the Plane and its Applications	3
Dynamic Data Structures for Timed Automata Acceptance	3
Parameterized Complexity of Graph Burning	3
Online Unit Clustering and Unit Covering in Higher Dimensions	3
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality	3
A Fast Algorithm for the Product Structure of Planar Graphs	3
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions	3
The Inverse Voronoi Problem in Graphs I: Hardness	3
Hardness of Metric Dimension in Graphs of Constant Treewidth	3
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems	3
Correlation Clustering in Data Streams	3
Approximation Algorithms for Maximally Balanced Connected Graph Partition	3
Agglomerative Clustering of Growing Squares	3
Eulerian Walks in Temporal Graphs	3
Relaxing the Irrevocability Requirement for Online Graph Algorithms	3
Cluster Deletion on Interval Graphs and Split Related Graphs	3
Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs	3
Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location	2
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees	2
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling	2
Enumeration of Support-Closed Subsets in Confluent Systems	2
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes	2
Improved Bounds for Open Online Dial-a-Ride on the Line	2
Solving String Problems on Graphs Using the Labeled Direct Product	2
Double String Tandem Repeats	2
Simultaneous Feedback Edge Set: A Parameterized Perspective	2
Facility Reallocation on the Line	2
Optimal Centrality Computations Within Bounded Clique-Width Graphs	2
Lipschitz Continuity and Approximate Equilibria	2
Computing Minimal Unique Substrings for a Sliding Window	2
The Inverse Voronoi Problem in Graphs II: Trees	2
Approximating k-Connected m-Dominating Sets	2
Finding Matching Cuts in H-Free Graphs	2
Compression of Dynamic Graphs Generated by a Duplication Model	2
Online Makespan Scheduling with Job Migration on Uniform Machines	2
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings	2
Faster Minimization of Tardy Processing Time on a Single Machine	2
Embedding Graphs into Embedded Graphs	2
A Polynomial Kernel for Diamond-Free Editing	2
Near-Optimal Search Time in $$\delta $$-Optimal Space, and Vice Versa	2
Greed is Good for Deterministic Scale-Free Networks	2
An Axiomatic Approach to Time-Dependent Shortest Path Oracles	2
On the Approximate Compressibility of Connected Vertex Cover	2
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints	2
Parallel Online Algorithms for the Bin Packing Problem	2
Practical Budgeted Submodular Maximization	2
Optimal Matroid Partitioning Problems	2
A Refined Branching Algorithm for the Maximum Satisfiability Problem	2
Sorting a Permutation by Best Short Swaps	2
Graph Searches and Their End Vertices	2
Enumerating k-Arc-Connected Orientations	2
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint	2
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem	2
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth	2
Algorithms and Complexity on Indexing Founder Graphs	2
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes	2
Sequential Metric Dimension	2

Algorithms for p-Faulty Search on a Half-Line	2
Exponential-Time Quantum Algorithms for Graph Coloring Problems	2
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes	2
On Maximizing Sums of Non-monotone Submodular and Linear Functions	2
Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule	2
Approximation Schemes for the Generalized Extensible Bin Packing Problem	2
Structural Parameterizations with Modulator Oblivion	2
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints	2
Approximating Global Optimum for Probabilistic Truth Discovery	2
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs	2
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number	2
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model	1
Gapped Indexing for Consecutive Occurrences	1
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs	1
Group Activity Selection with Few Agent Types	1
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality	1
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates	1
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic	1
On Finding the Best and Worst Orientations for the Metric Dimension	1
A Meta-Theorem for Distributed Certification	1
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between	1
On the Complexity of Broadcast Domination and Multipacking in Digraphs	1
Happy Set Problem on Subclasses of Co-comparability Graphs	1
Encoding Two-Dimensional Range Top-k Queries	1
Parameterized Complexity of Maximum Edge Colorable Subgraph	1
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows	1
Learning Privately with Labeled and Unlabeled Examples	1
Strongly Polynomial FPTASes for Monotone Dynamic Programs	1
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient	1
Fault Tolerant Approximate BFS Structures with Additive Stretch	1
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times	1
Dynamic Kernels for Hitting Sets and Set Packing	1
Local Routing in Sparse and Lightweight Geometric Graphs	1
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center	1
Particle-Based Assembly Using Precise Global Control	1
Connected Subgraph Defense Games	1
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive	1
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs	1
Parameterized Counting of Partially Injective Homomorphisms	1
Efficient Online String Matching Based on Characters Distance Text Sampling	1
Machine Covering in the Random-Order Model	1
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes	1
Adaptive Succinctness	1
Online Bin Packing of Squares and Cubes	1
Competitive Vertex Recoloring	1
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items	1
Parameterized Complexity of $$(A,\ell )$$-Path Packing	1
Parameter Analysis for Guarding Terrains	1
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm	1
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics	1
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints	1
Scheduling in the Random-Order Model	1
A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks	1
Recognizing Map Graphs of Bounded Treewidth	1
Lazy Queue Layouts of Posets	1
Correction to: Guess Free Maximization of Submodular and Linear Sums	1
Finding and Counting Permutations via CSPs	1
Bounded-Angle Minimum Spanning Trees	1
Deterministic Dynamic Matching in Worst-Case Update Time	1
More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments	1
Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$	1
Intersecting Longest Cycles in Archimedean Tilings	1
Multidimensional Period Recovery	1
Fair Allocation of Indivisible Items with Conflict Graphs	1
Efficient Isomorphism for $$S_d$$-Graphs and T-Graphs	1
Online Budgeted Maximum Coverage	1
On the Kernel and Related Problems in Interval Digraphs	1
Perfect Matchings with Crossings	1
On the Parameterized Complexity of Maximum Degree Contraction Problem	1
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings	1
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees	1
A New Lower Bound for Deterministic Truthful Scheduling	1
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length	1
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations	1
Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter	1
Edge Exploration of Temporal Graphs	1
On Proper Labellings of Graphs with Minimum Label Sum	1
CNF Satisfiability in a Subspace and Related Problems	1
Component Order Connectivity in Directed Graphs	1
On Subgraph Complementation to H-free Graphs	1
Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives	1
On the d-Claw Vertex Deletion Problem	1
Complexity Issues on of Secondary Domination Number	1
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem	1
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets	1
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size	1
Bounding the Inefficiency of Compromise in Opinion Formation	1
Better Distance Labeling for Unweighted Planar Graphs	1
Iterative Partial Rounding for Vertex Cover with Hard Capacities	1
Succinct Encoding of Binary Strings Representing Triangulations	1
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width	1
Winner Determination Algorithms for Graph Games with Matching Structures	1
Extended MSO Model Checking via Small Vertex Integrity	1
Space-Efficient Vertex Separators for Treewidth	1
Approximation in (Poly-) Logarithmic Space	1