| Publication | Date of Publication | Type |
|---|
| Experimental and theoretical analysis of local search optimising OBDD variable orderings | 2024-11-12 | Paper |
Introduction to the theory of complexity and approximation algorithms
Lectures on Proof Verification and Approximation Algorithms | 2018-07-03 | Paper |
Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Approximating vertex cover using edge-based representations
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII | 2017-07-14 | Paper |
Populations can be essential in tracking dynamic optima
Algorithmica | 2017-07-07 | Paper |
On easiest functions for mutation operators in bio-inspired optimisation
Algorithmica | 2017-07-07 | Paper |
On the black-box complexity of example functions: the real jump function
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII | 2017-05-10 | Paper |
Black-box complexity for bounding the performance of randomized search heuristics
Theory and Principled Methods for the Design of Metaheuristics | 2016-01-11 | Paper |
Performance analysis of randomised search heuristics operating with a fixed budget
Theoretical Computer Science | 2014-07-10 | Paper |
| scientific article; zbMATH DE number 6019551 (Why is no real title available?) | 2012-03-29 | Paper |
Analyzing different variants of immune inspired somatic contiguous hypermutations
Theoretical Computer Science | 2011-02-21 | Paper |
On benefits and drawbacks of aging strategies for randomized search heuristics
Theoretical Computer Science | 2011-02-21 | Paper |
Analyzing evolutionary algorithms. The computer science perspective.
Natural Computing Series | 2010-12-08 | Paper |
Stability in the self-organized evolution of networks
Algorithmica | 2010-03-04 | Paper |
Analysis of evolutionary algorithms for the longest common subsequence problem
Algorithmica | 2010-03-04 | Paper |
On the analysis of a dynamic evolutionary algorithm
Journal of Discrete Algorithms | 2008-01-11 | Paper |
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
Theoretical Computer Science | 2007-10-25 | Paper |
On the Brittleness of Evolutionary Algorithms
Foundations of Genetic Algorithms | 2007-09-07 | Paper |
Upper and lower bounds for randomized search heuristics in black-box optimization
Theory of Computing Systems | 2006-10-25 | Paper |
Foundations of Genetic Algorithms
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Real royal road functions -- where crossover provably is essential
Discrete Applied Mathematics | 2005-09-02 | Paper |
| scientific article; zbMATH DE number 2065676 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2043783 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 2013477 (Why is no real title available?) | 2003-12-04 | Paper |
Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
Theoretical Computer Science | 2003-01-21 | Paper |
The analysis of evolutionary algorithms -- A proof that crossover really can help
Algorithmica | 2002-12-01 | Paper |
On the analysis of the \((1+1)\) evolutionary algorithm
Theoretical Computer Science | 2002-07-15 | Paper |
| Dynamic parameter control in simple evolutionary algorithms | 2002-02-28 | Paper |
| scientific article; zbMATH DE number 1664964 (Why is no real title available?) | 2001-10-21 | Paper |
| scientific article; zbMATH DE number 1405791 (Why is no real title available?) | 2000-02-23 | Paper |
