Algorithmica

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
A New Lower Bound for Classic Online Bin Packing	15
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization	15
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers	14
Self-Adjusting Mutation Rates with Provably Optimal Success Rules	14
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
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem	13
Matching Cut in Graphs with Large Minimum Degree	11
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
Compact Distributed Certification of Planar Graphs	9
Twin-width and Polynomial Kernels	8
Fixed-Target Runtime Analysis	8
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set	8
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
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

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
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
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
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
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
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
Online Makespan Scheduling with Job Migration on Uniform Machines	3
On the Complexity of Recognizing Wheeler Graphs	3
Runtime Analysis for Permutation-based Evolutionary Algorithms	3
The Heaviest Induced Ancestors Problem: Better Data Structures and Applications	3
A Meta-Theorem for Distributed Certification	3
A Polynomial Kernel for Diamond-Free Editing	3
CNF Satisfiability in a Subspace and Related Problems	3
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints	3
Edge Exploration of Temporal Graphs	3
Gapped Indexing for Consecutive Occurrences	3
Double String Tandem Repeats	3
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem	3
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes	3
A Refined Branching Algorithm for the Maximum Satisfiability Problem	3
Succinct Permutation Graphs	3
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality	3
Finding Matching Cuts in H-Free Graphs	3

Dynamic Data Structures for Timed Automata Acceptance	3
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint	3
Cluster Deletion on Interval Graphs and Split Related Graphs	3
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings	3
Mechanisms for (Mis)allocating Scientific Credit	3
On Subgraph Complementation to H-free Graphs	3
Online Multistage Subset Maximization Problems	3
Relaxing the Irrevocability Requirement for Online Graph Algorithms	3
$${\mathcal {U}}$$-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited	3
A Fast Algorithm for the Product Structure of Planar Graphs	3
Asymptotic Analysis of q-Recursive Sequences	3
Agglomerative Clustering of Growing Squares	3
Mincut Sensitivity Data Structures for the Insertion of an Edge	3
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes	3
Linear-Time Recognition of Double-Threshold Graphs	3
Parameterized Complexity of Graph Burning	3
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs	3
Exponential-Time Quantum Algorithms for Graph Coloring Problems	3
Additive Approximation of Generalized Turán Questions	3
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics	3
Maximizing Dominance in the Plane and its Applications	3
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution	3
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows	3
Finding and Counting Permutations via CSPs	3
Internal Dictionary Matching	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
Solving String Problems on Graphs Using the Labeled Direct Product	3
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
Improved Bounds for Open Online Dial-a-Ride on the Line	2
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem	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
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
Sample-Based Distance-Approximation for Subsequence-Freeness	1
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality	1
Polynomial-time Combinatorial Algorithm for General Max–Min Fair Allocation	1
Unique Response Roman Domination: Complexity and Algorithms	1
Path Cover Problems with Length Cost	1
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints	1
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes	1
Scheduling in the Random-Order Model	1
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm	1

On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs	1
A Weight-Scaling Algorithm for f-Factors of Multigraphs	1
Group Activity Selection with Few Agent Types	1
A General Framework for Enumerating Equivalence Classes of Solutions	1
On the Minimum Consistent Subset Problem	1
Dynamic Kernels for Hitting Sets and Set Packing	1
Diverse Pairs of Matchings	1
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates	1
Adaptive Succinctness	1
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets	1
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items	1
Preclustering Algorithms for Imprecise Points	1
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width	1
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model	1
Succinct Encoding of Binary Strings Representing Triangulations	1
Approximation in (Poly-) Logarithmic Space	1
Bounding the Inefficiency of Compromise in Opinion Formation	1
Embedding Arbitrary Boolean Circuits into Fungal Automata	1
A Tight $$(3/2+\varepsilon )$$-Approximation for Skewed Strip Packing	1
Local Routing in Sparse and Lightweight Geometric Graphs	1
On Proper Labellings of Graphs with Minimum Label Sum	1
Lazy Queue Layouts of Posets	1
Parameterized Inapproximability of Independent Set in H-Free Graphs	1
List Covering of Regular Multigraphs with Semi-edges	1
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times	1
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions	1
Parameterized Complexity of $$(A,\ell )$$-Path Packing	1
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs	1
Perfect Matchings with Crossings	1
On the Complexity of Broadcast Domination and Multipacking in Digraphs	1
Vertex Deletion into Bipartite Permutation Graphs	1
Fair Allocation of Indivisible Items with Conflict Graphs	1
Encoding Two-Dimensional Range Top-k Queries	1
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes	1
A Semi Brute-Force Search Approach for (Balanced) Clustering	1
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs	1
Multidimensional Period Recovery	1
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations	1
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions	1
Publisher Correction: Longest Common Substring with Approximately k Mismatches	1
Almost-Smooth Histograms and Sliding-Window Graph Algorithms	1
Better Distance Labeling for Unweighted Planar Graphs	1
Universal Slope Sets for Upward Planar Drawings	1
Online Bin Packing of Squares and Cubes	1
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs	1
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem	1
Bounded-Angle Minimum Spanning Trees	1
A New Lower Bound for Deterministic Truthful Scheduling	1
Beating Treewidth for Average-Case Subgraph Isomorphism	1
Online Budgeted Maximum Coverage	1
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center	1
Recognizing Map Graphs of Bounded Treewidth	1
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient	1
Obtaining a Proportional Allocation by Deleting Items	1
Deterministic Dynamic Matching in Worst-Case Update Time	1
Truthful Matching with Online Items and Offline Agents	1
Parameter Analysis for Guarding Terrains	1
Network Design under General Wireless Interference	1
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs	1
Opinion Dynamics with Limited Information	1
On the Tractability of Covering a Graph with 2-Clubs	1
Component Order Connectivity in Directed Graphs	1
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic	1
Leader Election in Well-Connected Graphs	1
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage	1
Theoretical Analysis of Git Bisect	1
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive	1
Fast Exact Algorithms Using Hadamard Product of Polynomials	1
A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks	1
On the Parameterized Complexity of Compact Set Packing	1
Combination Algorithms for Steiner Tree Variants	1
Machine Covering in the Random-Order Model	1
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width	1
Efficient Isomorphism for $$S_d$$-Graphs and T-Graphs	1
Empty Squares in Arbitrary Orientation Among Points	1
A Queueing Network-Based Distributed Laplacian Solver	1
On the d-Claw Vertex Deletion Problem	1
Complexity Issues on of Secondary Domination Number	1
Strongly Polynomial FPTASes for Monotone Dynamic Programs	1
On the Parameterized Complexity of Maximum Degree Contraction Problem	1
Composed Degree-Distance Realizations of Graphs	1
Intersecting Longest Cycles in Archimedean Tilings	1
On the Kernel and Related Problems in Interval Digraphs	1
Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$	1
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size	1
Parameterized Study of Steiner Tree on Unit Disk Graphs	1
Peak Demand Minimization via Sliced Strip Packing	1
Near Isometric Terminal Embeddings for Doubling Metrics	1
Light Spanners for High Dimensional Norms via Stochastic Decompositions	1
On Approximating Degree-Bounded Network Design Problems	1
Competitive Vertex Recoloring	1
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings	1
Winner Determination Algorithms for Graph Games with Matching Structures	1
On Finding the Best and Worst Orientations for the Metric Dimension	1
On Colorful Vertex and Edge Cover Problems	1