Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?
C. Doerr, J. Lengler
Journal of Evolutionary Computation, 2016
Connectivity Thresholds for Bounded Size Rules
H. Einarsson, J. Lengler, F. Mousset, K. Panagiotou, A. Steger
Annals of Applied Probability, 2016, 26 (5), 3206-3250
A short proof of the Random Ramsey Theorem
R. Nenadov and A. Steger
Combinatorics, Probability, and Computing 25, 2016, 130-144.
OneMax in Black-Box Models with Several Restrictions
C. Doerr, J. Lengler
Algorithmica, 2016, 1-31.
Random directed graphs are robustly Hamiltonian
D. Hefetz, A. Steger and B. Sudakov
Random Structures & Algorithms 49, 2016, 345-362.
On the threshold for the Maker-Breaker H-game
R. Nenadov, A. Steger and M. Stojaković
Random Structures & Algorithms 49, 2016, 558-578.
The (1+1) Elitist Black-Box Complexity of LeadingOnes is Theta(n^2)
C. Doerr, J. Lengler
Genetic and Evolutionary Computation Conference (GECCO 2016), 2016, to appear.
Bootstrap percolation on geometric inhomogeneous random graphs
C. Koch, J. Lengler
Automata, Languages, and Programming - 43rd International Colloquium (ICALP 2016), 2016, to appear.
Random Sampling with Removal
B. Gärtner, J. Lengler, M. Szedlak
32nd International Symposium on Computational Geometry (SoCG 2016), 2016, to appear.
