| Publication | Date of Publication | Type |
|---|
| First Steps Towards a Runtime Analysis of Neuroevolution | 2024-02-23 | Paper |
| Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem | 2024-01-09 | Paper |
| How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys | 2023-04-20 | Paper |
| Tail bounds on hitting times of randomized search heuristics using variable drift analysis | 2023-03-30 | Paper |
| Tight bounds on the expected runtime of a standard steady state genetic algorithm | 2022-06-01 | Paper |
| Self-adjusting evolutionary algorithms for multimodal optimization | 2022-06-01 | Paper |
| On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms | 2022-05-16 | Paper |
| Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs | 2021-11-05 | Paper |
| Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint | 2021-11-05 | Paper |
| Stagnation detection with randomized local search | 2021-10-18 | Paper |
| Runtime analysis for self-adaptive mutation rates | 2021-04-08 | Paper |
| The complex parameter landscape of the compact genetic algorithm | 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 | 2020-05-26 | Paper |
| Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools | 2020-02-11 | Paper |
| On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization | 2019-04-25 | Paper |
| The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate | 2019-02-14 | Paper |
| Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax | 2019-02-14 | Paper |
| The impact of a sparse migration topology on the runtime of island models in dynamic optimization | 2018-05-18 | Paper |
| Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis | 2018-05-18 | Paper |
| Why standard particle swarm optimisers elude a theoretical runtime analysis | 2017-07-14 | Paper |
| When do evolutionary algorithms optimize separable functions in parallel? | 2017-07-14 | Paper |
| The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax | 2017-07-07 | Paper |
| A runtime analysis of parallel evolutionary algorithms in dynamic optimization | 2017-07-07 | Paper |
| Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax | 2017-06-13 | Paper |
| (1+1) EA on Generalized Dynamic OneMax | 2017-05-10 | Paper |
| MMAS versus population-based EA on a family of dynamic fitness functions | 2016-08-31 | Paper |
| Improved time complexity analysis of the simple genetic algorithm | 2015-10-30 | Paper |
| Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift | 2015-09-11 | Paper |
| Fitness levels with tail bounds for the analysis of randomized search heuristics | 2015-06-25 | Paper |
| Runtime analysis of ant colony optimization on dynamic shortest path problems | 2014-12-02 | Paper |
| On the runtime analysis of the simple genetic algorithm | 2014-07-10 | Paper |
| Black-box search by unbiased variation | 2013-04-03 | Paper |
| Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions | 2013-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904781 | 2012-08-23 | Paper |
| Analysis of an iterated local search algorithm for vertex cover in sparse random graphs | 2012-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224107 | 2012-03-29 | Paper |
| Edge-Matching Problems with Rotations | 2011-08-19 | Paper |
| Simplified drift analysis for proving lower bounds in evolutionary computation | 2011-03-30 | Paper |
| Runtime analysis of the 1-ANT ant colony optimizer | 2011-03-29 | Paper |
| Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity | 2010-11-18 | Paper |
| Ant colony optimization and the minimum spanning tree problem | 2010-05-27 | Paper |
| Runtime analysis of a binary particle swarm optimizer | 2010-05-27 | Paper |
| Runtime analysis of a simple ant colony optimization algorithm | 2009-06-22 | Paper |
| Greedy Local Search and Vertex Cover in Sparse Random Graphs | 2009-06-03 | Paper |
| Population size versus runtime of a simple evolutionary algorithm | 2009-01-15 | Paper |
| Runtime Analysis of a Simple Ant Colony Optimization Algorithm | 2008-04-24 | Paper |
| Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions | 2007-11-29 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions | 2005-05-04 | Paper |
| On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436870 | 2003-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785464 | 2003-02-04 | Paper |
