1. Runtime analysis for the (μ+λ) EA optimizing OneMax;Antipov,2018
2. Optimal fixed and adaptive mutation rates for the LeadingOnes problem;Böttcher,2010
3. Comparing evolutionary algorithms to the (1+1)-EA;Borisovsky;Theoret. Comput. Sci.,2008
4. Parameterized average-case complexity of the hypervolume indicator;Bringmann,2013
5. Unbiased black-box complexity of parallel search;Badkobeh,2014