1. P.S. Oliveto, J. He, X. Yao: Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results, Int. J. Autom. Comput. 4(3), 281–293 (2007)
2. F. Neumann, C. Witt: Bioinspired Computation in Combinatorial Optimization – Algorithms and Their Computational Complexity (Springer, Berlin, Heidelberg 2010)
3. J. Lässig, D. Sudholt: The benefit of migration in parallel evolutionary algorithms, Proc. Genet. Evol. Comput. Conf. (GECCO 2010) (ACM, New York 2010) pp. 1105–1112
4. J. Lässig, D. Sudholt: General scheme for analyzing running times of parallel evolutionary algorithms, 11th Int. Conf. Parallel Probl. Solving Nat. (PPSN 2010) (Springer, Berlin, Heidelberg 2010) pp. 234–243
5. J. Lässig, D. Sudholt: Adaptive population models for offspring populations and parallel evolutionary algorithms, Proc. 11th Workshop Found. Genet. Algorithms (FOGA 2011) (ACM, Berlin, Heidelberg 2011) pp. 181–192