Carsten Witt
TitleCited byYear
Combinatorial optimization and computational complexity
F Neumann, C Witt
Bioinspired Computation in Combinatorial Optimization, 9-19, 2010
3142010
Runtime analysis of the (μ+ 1) EA on simple pseudo-Boolean functions
C Witt
Evolutionary Computation 14 (1), 65-86, 2006
180*2006
Worst-case and average-case approximations by simple randomized search heuristics
C Witt
Annual Symposium on Theoretical Aspects of Computer Science, 44-56, 2005
1582005
Black-box search by unbiased variation
PK Lehre, C Witt
Algorithmica 64 (4), 623-642, 2012
1392012
Approximating covering problems by randomized search heuristics using multi-objective models
T Friedrich, J He, N Hebbinghaus, F Neumann, C Witt
Evolutionary Computation 18 (4), 617-633, 2010
1222010
Simplified drift analysis for proving lower bounds in evolutionary computation
PS Oliveto, C Witt
Algorithmica 59 (3), 369-386, 2011
1052011
Tight bounds on the optimization time of a randomized search heuristic on linear functions
C Witt
Combinatorics, Probability and Computing 22 (02), 294-318, 2013
1032013
Ant colony optimization and the minimum spanning tree problem
F Neumann, C Witt
Theoretical Computer Science 411 (25), 2406-2413, 2010
882010
Runtime analysis of a simple ant colony optimization algorithm
F Neumann, C Witt
International Symposium on Algorithms and Computation, 618-627, 2006
832006
On the optimization of monotone polynomials by simple randomized search heuristics
I Wegener, C Witt
Combinatorics, Probability and Computing 14 (1-2), 225-247, 2005
83*2005
Analysis of diversity-preserving mechanisms for global exploration
T Friedrich, PS Oliveto, D Sudholt, C Witt
Evolutionary Computation 17 (4), 455-476, 2009
792009
Analysis of diversity-preserving mechanisms for global exploration*
T Friedrich, PS Oliveto, D Sudholt, C Witt
Evolutionary Computation 17 (4), 455-476, 2009
792009
Analysis of different MMAS ACO algorithms on unimodal functions and plateaus
F Neumann, D Sudholt, C Witt
Swarm Intelligence 3 (1), 35-68, 2009
78*2009
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions
I Wegener, C Witt
Journal of Discrete Algorithms 3 (1), 61-78, 2005
71*2005
Runtime analysis of a simple ant colony optimization algorithm
F Neumann, C Witt
Algorithmica 54 (2), 243, 2009
702009
A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability
J He, C Reeves, C Witt, X Yao
Evolutionary Computation 15 (4), 435-443, 2007
692007
Population size versus runtime of a simple evolutionary algorithm
C Witt
Theoretical Computer Science 403 (1), 104-120, 2008
66*2008
Concentrated hitting times of randomized search heuristics with variable drift
PK Lehre, C Witt
International Symposium on Algorithms and Computation, 686-697, 2014
65*2014
Runtime analysis of a binary particle swarm optimizer
D Sudholt, C Witt
Theoretical Computer Science 411 (21), 2084-2100, 2010
61*2010
Improved time complexity analysis of the simple genetic algorithm
PS Oliveto, C Witt
Theoretical Computer Science 605, 21-41, 2015
572015
The system can't perform the operation now. Try again later.
Articles 1–20