| Publication | Date of Publication | Type |
|---|
| Runtime analysis of quality diversity algorithms | 2024-10-24 | Paper |
| Analysing equilibrium states for population diversity | 2024-08-02 | Paper |
| Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation | 2024-07-03 | Paper |
| Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function | 2024-04-30 | Paper |
| Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter | 2024-01-25 | Paper |
| The cost of randomness in evolutionary algorithms: crossover can save random bits | 2024-01-12 | Paper |
| Do additional target points speed up evolutionary algorithms? | 2023-03-17 | Paper |
| Tight bounds on the expected runtime of a standard steady state genetic algorithm | 2022-06-01 | Paper |
| Self-adjusting offspring population sizes outperform fixed parameters on the cliff function | 2022-05-16 | Paper |
| Do additional optima speed up evolutionary algorithms? | 2022-05-16 | Paper |
| On the impact of the performance metric on efficient algorithm configuration | 2022-03-02 | Paper |
| Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem | 2021-11-05 | Paper |
| Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial | 2021-04-08 | Paper |
| The complex parameter landscape of the compact genetic algorithm | 2021-04-08 | Paper |
| Memetic algorithms outperform evolutionary algorithms in multimodal optimisation | 2020-11-16 | Paper |
| Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation | 2020-05-26 | Paper |
| Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem | 2020-02-11 | Paper |
| On the benefits and risks of using fitness sharing for multimodal optimisation | 2019-05-21 | Paper |
| On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization | 2019-04-25 | Paper |
| On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements? | 2019-02-14 | Paper |
| How to escape local optima in black box optimisation: when non-elitism outperforms elitism | 2018-05-18 | Paper |
| Using markov-chain mixing time estimates for the analysis of ant colony optimization | 2017-07-14 | Paper |
| Simple max-min ant systems and the optimization of linear pseudo-boolean functions | 2017-07-14 | Paper |
| Adaptive population models for offspring populations and parallel evolutionary algorithms | 2017-07-14 | Paper |
| When do evolutionary algorithms optimize separable functions in parallel? | 2017-07-14 | Paper |
| Towards a runtime comparison of natural and artificial evolution | 2017-07-07 | Paper |
| On easiest functions for mutation operators in bio-inspired optimisation | 2017-07-07 | Paper |
| Analysis of the Clearing Diversity-Preserving Mechanism | 2017-06-13 | Paper |
| Black-box Complexity of Parallel Search with Distributed Populations | 2017-05-10 | Paper |
| Toward a unifying framework for evolutionary processes | 2016-08-18 | Paper |
| Design and analysis of migration in parallel evolutionary algorithms | 2015-11-23 | Paper |
| Design and analysis of different alternating variable searches for search-based software testing | 2015-10-30 | Paper |
| Analysis of speedups in parallel evolutionary algorithms and \((1 + \lambda)\) EAs for combinatorial optimization | 2014-08-29 | Paper |
| The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm | 2014-07-10 | Paper |
| A simple ant colony optimizer for stochastic shortest path problems | 2013-04-03 | Paper |
| Running time analysis of ant colony optimization for shortest path problems | 2012-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224105 | 2012-03-29 | Paper |
| Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization | 2011-12-16 | Paper |
| Hybridizing evolutionary algorithms with variable-depth search to overcome local optima | 2011-03-30 | Paper |
| Runtime analysis of the 1-ANT ant colony optimizer | 2011-03-29 | Paper |
| Analysis of an Iterated Local Search Algorithm for Vertex Coloring | 2010-12-09 | Paper |
| Runtime analysis of a binary particle swarm optimizer | 2010-05-27 | Paper |
| A self-stabilizing algorithm for cut problems in synchronous networks | 2010-04-06 | Paper |
| The impact of parametrization in memetic evolutionary algorithms | 2009-07-10 | Paper |
| Self-stabilizing Cuts in Synchronous Networks | 2008-07-10 | Paper |
| Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency | 2008-04-24 | Paper |
| Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions | 2007-11-29 | Paper |
