1. Upper and lower bounds for randomized search heuristics in black-box optimization;Droste;Theory Comput. Syst.,2006
2. From black-box complexity to designing new genetic algorithms;Doerr;Theor. Comput. Sci.,2015
3. Revised analysis of the (1+1) EA for the minimum spanning tree problem;Witt,2014
4. Computing single source shortest paths using single-objective fitness functions;Baswana,2009
5. Lower bounds for the runtime of a global multi-objective evolutionary algorithm;Doerr,2013