| 2021 | Automatic adaptation of hypermutation rates for multimodal optimisation. | Dogan Corus, Pietro S. Oliveto, Donya Yazdani |
| 2021 | Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems. | Luke Branson, Andrew M. Sutton |
| 2021 | Do additional optima speed up evolutionary algorithms? | Jakob Bossek, Dirk Sudholt |
| 2021 | The effect of non-symmetric fitness: the analysis of crossover-based algorithms on RealJump functions. | Denis Antipov, Semen Naumov |
| 2019 | Steady state analysis of a multi-recombinative meta-ES on a conically constrained problem with comparison to σSA and CSA. | Patrick Spettel, Hans-Georg Beyer, Michael Hellwig |
| 2019 | The benefits and limitations of voting mechanisms in evolutionary optimisation. | Jonathan E. Rowe, Aishwaryaprajna |
| 2019 | Analysis of baseline evolutionary algorithms for the packing while travelling problem. | Vahid Roostapour, Mojgan Pourhassan, Frank Neumann |
| 2019 | Generalized drift analysis in continuous domain: linear convergence of (1 + 1)-ES on strongly convex functions with Lipschitz continuous gradients. | Daiki Morinaga, Youhei Akimoto |
| 2019 | Exponential slowdown for larger populations: the ( + 1)-EA on monotone functions. | Johannes Lengler, Xun Zou |
| 2019 | On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. | Per Kristian Lehre, Phan Trung Hai Nguyen |
| 2019 | Consistent population control: generate plenty of points, but with a bit of resampling. | Vasil Khalidov, Maxime Oquab, Jrmy Rapin, Olivier Teytaud |
| 2019 | Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools. | Hsien-Kuei Hwang, Carsten Witt |
| 2019 | An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. | Benjamin Doerr |
| 2019 | New features for continuous exploratory landscape analysis based on the SOO tree. | Bilel Derbel, Arnaud Liefooghe, Sbastien Vrel, Hernn E. Aguirre, Kiyoshi Tanaka |
| 2019 | Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem. | Jakob Bossek, Dirk Sudholt |
| 2019 | Evolving diverse TSP instances by means of novel and creative mutation operators. | Jakob Bossek, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, Heike Trautmann |
| 2019 | A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones. | Denis Antipov, Benjamin Doerr, Vitalii Karavaev |
| 2019 | Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem. | Feng Shi, Frank Neumann, Jianxin Wang |
| 2019 | Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. | Frank Neumann, Andrew M. Sutton |
| 2017 | Fast and Powerful Hashing using Tabulation. | Mikkel Thorup |
| 2017 | Convergence of Factored Evolutionary Algorithms. | Shane Strasser, John W. Sheppard |
| 2017 | On the Statistical Learning Ability of Evolution Strategies. | Ofer M. Shir, Amir Yehudayoff |
| 2017 | On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. | Mojgan Pourhassan, Tobias Friedrich, Frank Neumann |
| 2017 | An Application of Stochastic Differential Equations to Evolutionary Algorithms. | Tiago Paixo, Jorge Prez Heredia |
| 2017 | Analysis of the Clearing Diversity-Preserving Mechanism. | Edgar Covantes Osuna, Dirk Sudholt |