Johannsen, Daniel
294  results:
Search for persons X
?
7

Expanders Are Universal for the Class of All Spanning Trees:

JOHANNSEN, DANIEL ; KRIVELEVICH, MICHAEL ; SAMOTIJ, WOJCIECH
Combinatorics, Probability and Computing.  22 (2013)  2 - p. 253-281 , 2013
 
?
 
?
 
?
10

Expanders are universal for the class of all spanning trees:

, In: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms,
 
?
11

Runtime analysis of the (1+1) evolutionary algorithm on str..:

, In: Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms,
 
?
12

Faster black-box algorithms through higher arity operators:

, In: Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms,
Doerr, Benjamin ; Johannsen, Daniel ; Kötzing, Timo... - p. 163-172 , 2011
 
?
13

Can quantum search accelerate evolutionary algorithms?:

, In: Proceedings of the 12th annual conference on Genetic and evolutionary computation,
 
?
14

Vertices of degree k in random maps:

, In: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms,
 
?
15

Multiplicative drift analysis:

, In: Proceedings of the 12th annual conference on Genetic and evolutionary computation,
 
1-15