Carsten Witt
- 2013
- Published
Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions. / Witt, Carsten.
In: Combinatorics, Probability & Computing, Vol. 22, No. 2, 2013, p. 294-318.Publication: Research - peer-review › Journal article – Annual report year: 2013
- Published
When do evolutionary algorithms optimize separable functions in parallel?. / Doerr, Benjamin; Sudholt, Dirk; Witt, Carsten.
In: Proceedings of the 12th ACM Workshop on Foundations of Genetic Algorithms (FOGA 2013). The Association for Computing Machinery, 2013. p. 51-64.Publication: Research - peer-review › Article in proceedings – Annual report year: 2013
- 2012
- Published
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs. / Witt, Carsten.
In: Theoretical Computer Science, Vol. 425, 2012, p. 117-125.Publication: Research - peer-review › Journal article – Annual report year: 2012
- Published
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. / Neumann, Frank; Witt, Carsten.
In: Proceedings of the fourteenth international conference on Genetic and evolutionary computation: Companion. Association for Computing Machinery, 2012. p. 1035-1058.Publication: Research - peer-review › Article in proceedings – Annual report year: 2012
- Published
Black-Box Search by Unbiased Variation. / Lehre, Per Kristian; Witt, Carsten.
In: Algorithmica, Vol. 64, No. 4, 2012, p. 623-642.Publication: Research - peer-review › Journal article – Annual report year: 2012
- Published
On the Analysis of the Simple Genetic Algorithm. / Oliveto, Pietro S.; Witt, Carsten.
In: Proceedings of the fourteenth international conference on Genetic and evolutionary computation. ACM, 2012. p. 1341-1348.Publication: Research - peer-review › Article in proceedings – Annual report year: 2012
- Published
Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. / Witt, Carsten.
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). ed. / Christoph Dürr; Thomas Wilke. 2012. p. 420-431 (Leibniz International Proceedings in Informatics, Vol. 14).Publication: Research - peer-review › Article in proceedings – Annual report year: 2012
- Published
Theoretical analysis of two ACO approaches for the traveling salesman problem. / Kötzing, Timo; Neumann, Frank; Röglin, Heiko; Witt, Carsten.
In: Swarm Intelligence, Vol. 6, No. 1, 2012, p. 1-21.Publication: Research - peer-review › Journal article – Annual report year: 2012
- Published
Theory of Randomized Search Heuristics. / Auger, Anne; Witt, Carsten.
In: Algorithmica, Vol. 64, No. 4, 2012, p. 621-622.Publication: Research - peer-review › Editorial – Annual report year: 2012
- 2011
- Published
Edge-Matching Problems with Rotations. / Ebbesen, Martin; Fischer, Paul; Witt, Carsten.
In: Fundamentals of Computation Theory: 18th International Symposium, FCT 2011 Oslo, Norway, August 22-25, 2011 Proceedings. Springer, 2011. p. 114-125 (Lecture Notes in Computer Science; No. 6914).Publication: Research - peer-review › Article in proceedings – Annual report year: 2011