Johannes Textor: Efficient Negative Selection Algorithms by Sampling and Approximate Counting.
32-41
Youhei Akimoto, Anne Auger, Nikolaus Hansen: Convergence of the Continuous Time Trajectories of Isotropic Evolution Strategies on Monotonic $\mathcal C^2$ -composite Functions.
42-51
Andrew M. Sutton, Frank Neumann: A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling.
52-61
Chao Qian, Yang Yu, Zhi-Hua Zhou: On Algorithm-Dependent Boundary Case Identification for Problem Classes.
62-71
Tommaso Urli, Markus Wagner, Frank Neumann: Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics.
102-112