1. Antipov, D., Buzdalov, M., Doerr, B.: Fast mutation in crossover-based algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1268–1276. ACM (2020)
2. Antipov, D., Buzdalov, M., Doerr, B.: First steps towards a runtime analysis when starting with a good solution. In: Bäck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12270, pp. 560–573. Springer, Switzerland (2020). https://doi.org/10.1007/978-3-030-58115-2_39
3. Antipov, D., Doerr, B.: Runtime analysis of a heavy-tailed (1+($$\lambda $$, $$\lambda $$)) genetic algorithm on jump functions. CoRR abs/2006.03523 (2020). https://arxiv.org/abs/2006.03523
4. Antipov, D., Doerr, B., Karavaev, V.: A tight runtime analysis for the $${(1 + (\lambda ,\lambda ))}$$ GA on LeadingOnes. In: Foundations of Genetic Algorithms, FOGA 2019, pp. 169–182. ACM (2019)
5. Antipov, D., Doerr, B., Karavaev, V.: The $$(1 + (\lambda ,\lambda ))$$ GA is even faster on multimodal problems. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1259–1267. ACM (2020)