| Publication | Date of Publication | Type |
|---|
Comma selection outperforms plus selection on OneMax with randomly planted optima
Algorithmica | 2025-10-10 | Paper |
| Evolutionary algorithms for one-sided bipartite crossing minimisation (poster abstract) | 2025-10-07 | Paper |
Runtime analysis of quality diversity algorithms
Algorithmica | 2024-10-24 | Paper |
Analysing equilibrium states for population diversity
Algorithmica | 2024-08-02 | Paper |
Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
Artificial Intelligence | 2024-07-03 | Paper |
Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function
Artificial Intelligence | 2024-04-30 | Paper |
Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter
Algorithmica | 2024-01-25 | Paper |
The cost of randomness in evolutionary algorithms: crossover can save random bits
Evolutionary Computation in Combinatorial Optimization | 2024-01-12 | Paper |
Do additional target points speed up evolutionary algorithms?
Theoretical Computer Science | 2023-03-17 | Paper |
Tight bounds on the expected runtime of a standard steady state genetic algorithm
Algorithmica | 2022-06-01 | Paper |
Self-adjusting offspring population sizes outperform fixed parameters on the cliff function
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2022-05-16 | Paper |
Do additional optima speed up evolutionary algorithms?
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2022-05-16 | Paper |
On the impact of the performance metric on efficient algorithm configuration
Artificial Intelligence | 2022-03-02 | Paper |
Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
Algorithmica | 2021-11-05 | Paper |
Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
Algorithmica | 2021-04-08 | Paper |
The complex parameter landscape of the compact genetic algorithm
Algorithmica | 2021-04-08 | Paper |
Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
Artificial Intelligence | 2020-11-16 | Paper |
Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
Theoretical Computer Science | 2020-05-26 | Paper |
Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
Theoretical Computer Science | 2020-05-26 | Paper |
Time complexity analysis of RLS and (1+1) EA for the edge coloring problem
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2020-02-11 | Paper |
On the benefits and risks of using fitness sharing for multimodal optimisation
Theoretical Computer Science | 2019-05-21 | Paper |
On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
Algorithmica | 2019-04-25 | Paper |
On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements?
Algorithmica | 2019-02-14 | Paper |
How to escape local optima in black box optimisation: when non-elitism outperforms elitism
Algorithmica | 2018-05-18 | Paper |
Using Markov-chain mixing time estimates for the analysis of ant colony optimization
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Adaptive population models for offspring populations and parallel evolutionary algorithms
Proceedings of the 11th workshop proceedings 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 |
Towards a runtime comparison of natural and artificial evolution
Algorithmica | 2017-07-07 | Paper |
On easiest functions for mutation operators in bio-inspired optimisation
Algorithmica | 2017-07-07 | Paper |
Analysis of the clearing diversity-preserving mechanism
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2017-06-13 | Paper |
Analysis of the clearing diversity-preserving mechanism
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2017-06-13 | Paper |
Black-box Complexity of Parallel Search with Distributed Populations
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII | 2017-05-10 | Paper |
Toward a unifying framework for evolutionary processes
Journal of Theoretical Biology | 2016-08-18 | Paper |
Design and analysis of migration in parallel evolutionary algorithms
Soft Computing | 2015-11-23 | Paper |
Design and analysis of different alternating variable searches for search-based software testing
Theoretical Computer Science | 2015-10-30 | Paper |
Analysis of speedups in parallel evolutionary algorithms and \((1 + \lambda)\) EAs for combinatorial optimization
Theoretical Computer Science | 2014-08-29 | Paper |
The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
Theoretical Computer Science | 2014-07-10 | Paper |
A simple ant colony optimizer for stochastic shortest path problems
Algorithmica | 2013-04-03 | Paper |
Running time analysis of ant colony optimization for shortest path problems
Journal of Discrete Algorithms | 2012-05-11 | Paper |
| Memetic evolutionary algorithms | 2012-03-29 | Paper |
Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization (extended abstract)
Algorithms and Computation | 2011-12-16 | Paper |
Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
Algorithmica | 2011-03-30 | Paper |
Runtime analysis of the 1-ANT ant colony optimizer
Theoretical Computer Science | 2011-03-29 | Paper |
Analysis of an iterated local search algorithm for vertex coloring
Algorithms and Computation | 2010-12-09 | Paper |
Runtime analysis of a binary particle swarm optimizer
Theoretical Computer Science | 2010-05-27 | Paper |
A self-stabilizing algorithm for cut problems in synchronous networks
Theoretical Computer Science | 2010-04-06 | Paper |
The impact of parametrization in memetic evolutionary algorithms
Theoretical Computer Science | 2009-07-10 | Paper |
Self-stabilizing Cuts in Synchronous Networks
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
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 |
