1. A. Auger, B. Doerr, Theory of Randomized Search Heuristics: Foundations and Recent Developments, vol. 1 (World Scientific, Singapore, 2011)
2. S. Baswana, S. Biswas, B. Doerr, T. Friedrich, P.P. Kurur, F. Neumann, Computing single source shortest paths using single-objective fitness functions, in Foundations of Genetic Algorithms (FOGA ’09) (ACM Press, New York, 2009), pp. 59–66
3. D. Corus, D.-C. Dang, A.V. Eremeev, P.K. Lehre, Level-based analysis of genetic algorithms and other search processes, in Proceedings of the 13th International Conference on Parallel Problem Solving from Nature (PPSN 2014) (Springer International Publishing, Ljubljana/Slovenia, 2014), pp. 912–921
4. D.-C. Dang, P.K. Lehre, Evolution under partial information, in Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2014), pp. 1359–1366 (2014)
5. D.-C. Dang, P.K. Lehre, Refined upper bounds on the expected runtime of non-elitist populations from fitness-levels, in Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2014) (2014), pp. 1367–1374