| Publication | Date of Publication | Type |
|---|
Stagnation detection in highly multimodal fitness landscapes
Algorithmica | 2024-10-07 | Paper |
First Steps Towards a Runtime Analysis of Neuroevolution
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2024-02-23 | Paper |
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem
Algorithmica | 2024-01-09 | Paper |
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
Theoretical Computer Science | 2023-04-20 | Paper |
Tail bounds on hitting times of randomized search heuristics using variable drift analysis
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
Self-adjusting evolutionary algorithms for multimodal optimization
Algorithmica | 2022-06-01 | Paper |
Self-adjusting evolutionary algorithms for multimodal optimization
Algorithmica | 2022-06-01 | Paper |
Tight bounds on the expected runtime of a standard steady state genetic algorithm
Algorithmica | 2022-06-01 | Paper |
On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2022-05-16 | Paper |
Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs
Algorithmica | 2021-11-05 | Paper |
Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
Algorithmica | 2021-11-05 | Paper |
Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
Algorithmica | 2021-11-05 | Paper |
Stagnation detection with randomized local search
(available as arXiv preprint) | 2021-10-18 | Paper |
Runtime analysis for self-adaptive mutation rates
Algorithmica | 2021-04-08 | Paper |
Runtime analysis for self-adaptive mutation rates
Algorithmica | 2021-04-08 | Paper |
The complex parameter landscape of the compact genetic algorithm
Algorithmica | 2021-04-08 | Paper |
| Improved Fixed-Budget Results via Drift Analysis | 2020-06-12 | Paper |
Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax
Theoretical Computer Science | 2020-05-26 | Paper |
Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2020-02-11 | Paper |
Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2020-02-11 | Paper |
On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
Algorithmica | 2019-04-25 | Paper |
The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
Algorithmica | 2019-02-14 | Paper |
The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
Algorithmica | 2019-02-14 | Paper |
Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
Algorithmica | 2019-02-14 | Paper |
Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis
Algorithmica | 2018-05-18 | Paper |
The impact of a sparse migration topology on the runtime of island models in dynamic optimization
Algorithmica | 2018-05-18 | Paper |
Why standard particle swarm optimisers elude a theoretical runtime analysis
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms | 2017-07-14 | Paper |
When do evolutionary algorithms optimize separable functions in parallel?
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII | 2017-07-14 | Paper |
A runtime analysis of parallel evolutionary algorithms in dynamic optimization
Algorithmica | 2017-07-07 | Paper |
The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
Algorithmica | 2017-07-07 | Paper |
Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2017-06-13 | Paper |
(1+1) EA on Generalized Dynamic OneMax
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII | 2017-05-10 | Paper |
MMAS versus population-based EA on a family of dynamic fitness functions
Algorithmica | 2016-08-31 | Paper |
Improved time complexity analysis of the simple genetic algorithm
Theoretical Computer Science | 2015-10-30 | Paper |
Concentrated hitting times of randomized search heuristics with variable drift
Algorithms and Computation | 2015-09-11 | Paper |
Fitness levels with tail bounds for the analysis of randomized search heuristics
Information Processing Letters | 2015-06-25 | Paper |
Runtime analysis of ant colony optimization on dynamic shortest path problems
Theoretical Computer Science | 2014-12-02 | Paper |
On the runtime analysis of the simple genetic algorithm
Theoretical Computer Science | 2014-07-10 | Paper |
Black-box search by unbiased variation
Algorithmica | 2013-04-03 | Paper |
Tight bounds on the optimization time of a randomized search heuristic on linear functions
Combinatorics, Probability and Computing | 2013-03-14 | Paper |
| Optimizing linear functions with randomized search heuristics -- the robustness of mutation | 2012-08-23 | Paper |
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
Theoretical Computer Science | 2012-05-14 | Paper |
| scientific article; zbMATH DE number 6019552 (Why is no real title available?) | 2012-03-29 | Paper |
Edge-matching problems with rotations
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Simplified drift analysis for proving lower bounds in evolutionary computation
Algorithmica | 2011-03-30 | Paper |
Runtime analysis of the 1-ANT ant colony optimizer
Theoretical Computer Science | 2011-03-29 | Paper |
Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
Natural Computing Series | 2010-11-18 | Paper |
Runtime analysis of a binary particle swarm optimizer
Theoretical Computer Science | 2010-05-27 | Paper |
Ant colony optimization and the minimum spanning tree problem
Theoretical Computer Science | 2010-05-27 | Paper |
Runtime analysis of a simple ant colony optimization algorithm
Algorithmica | 2009-06-22 | Paper |
Greedy Local Search and Vertex Cover in Sparse Random Graphs
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Population size versus runtime of a simple evolutionary algorithm
Theoretical Computer Science | 2009-01-15 | Paper |
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Algorithms and Computation | 2008-04-24 | Paper |
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | 2007-11-29 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions
Journal of Discrete Algorithms | 2005-05-04 | Paper |
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Combinatorics, Probability and Computing | 2005-04-04 | Paper |
| scientific article; zbMATH DE number 2013513 (Why is no real title available?) | 2003-12-04 | Paper |
| scientific article; zbMATH DE number 1848286 (Why is no real title available?) | 2003-02-04 | Paper |
