| 2011 | The role of selective pressure when solving symmetric functions in polynomial time. | Lars Kaden, Nicole Weicker, Karsten Weicker |
| 2011 | Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. | Thomas Jansen, Christine Zarges |
| 2011 | The logarithmic hypervolume indicator. | Tobias Friedrich, Karl Bringmann, Thomas Vo, Christian Igel |
| 2011 | Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. | Greg Durrett, Frank Neumann, Una-May O'Reilly |
| 2011 | Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. | Benjamin Doerr, Daniel Johannsen, Martin Schmidt |
| 2011 | Faster black-box algorithms through higher arity operators. | Benjamin Doerr, Daniel Johannsen, Timo Ktzing, Per Kristian Lehre, Markus Wagner, Carola Winzen |
| 2011 | Handling expensive optimization with large noise. | Rmi Coulom, Philippe Rolet, Nataliya Sokolovska, Olivier Teytaud |
| 2011 | Non-uniform mutation rates for problems with unknown solution lengths. | Stephan Cathabard, Per Kristian Lehre, Xin Yao |
| 2011 | Convergence rates of SMS-EMOA on continuous bi-objective problem classes. | Nicola Beume, Marco Laumanns, Gnter Rudolph |
| 2011 | Using multivariate quantitative genetics theory to assist in EA customization. | Jeffrey Kermes Bassett, Kenneth A. De Jong |
| 2011 | Analyzing the impact of mirrored sampling and sequential selection in elitist evolution strategies. | Anne Auger, Dimo Brockhoff, Nikolaus Hansen |
| 2011 | On the behaviour of the (1, λ)-es for a simple constrained problem. | Dirk V. Arnold |
| 2009 | On the utility of the population size for inversely fitness proportional mutation rates. | Christine Zarges |
| 2009 | Why standard particle swarm optimisers elude a theoretical runtime analysis. | Carsten Witt |
| 2009 | Cooperative coevolution and univariate estimation of distribution algorithms. | Christopher Vo, Liviu Panait, Sean Luke |
| 2009 | Unbiased coevolutionary solution concepts. | Travis C. Service |
| 2009 | On the size of weights in randomized search heuristics. | Joachim Reichel, Martin Skutella |
| 2009 | Monotonicity versus performance in co-optimization. | Elena Popovici, Kenneth A. De Jong |
| 2009 | Free lunches for function and program induction. | Riccardo Poli, Mario Graff, Nicholas Freitag McPhee |
| 2009 | A gaussian random field model of smooth fitness landscapes. | Alberto Moraglio, Yossi Borenstein |
| 2009 | On the impact of the mutation-selection balance on the runtime of evolutionary algorithms. | Per Kristian Lehre, Xin Yao |
| 2009 | Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. | Christian Horoba, Frank Neumann |
| 2009 | Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem. | Christian Horoba |
| 2009 | Single- and multi-objective evolutionary algorithms for graph bisectioning. | Gero Greiner |
| 2009 | Weighted recombination evolution strategy on a class of PDQF's. | Steffen Finck, Hans-Georg Beyer |