| Bioinspired Computation in Combinatorial Optimization - Combinatorial optimization and computational complexity F Neumann, C Witt Springer, Berlin, Heidelberg, 2010 | 332* | 2010 |
| Runtime analysis of the (μ+ 1) EA on simple pseudo-Boolean functions C Witt Evolutionary Computation 14 (1), 65-86, 2006 | 183* | 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 | 160 | 2005 |
| Black-box search by unbiased variation PK Lehre, C Witt Algorithmica 64 (4), 623-642, 2012 | 146 | 2012 |
| 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 | 128 | 2010 |
| 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 | 112 | 2013 |
| Simplified drift analysis for proving lower bounds in evolutionary computation PS Oliveto, C Witt Algorithmica 59 (3), 369-386, 2011 | 111 | 2011 |
| Ant colony optimization and the minimum spanning tree problem F Neumann, C Witt Theoretical Computer Science 411 (25), 2406-2413, 2010 | 90 | 2010 |
| Runtime analysis of a simple ant colony optimization algorithm F Neumann, C Witt International Symposium on Algorithms and Computation, 618-627, 2006 | 83 | 2006 |
| 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 | 81 | 2009 |
| Analysis of diversity-preserving mechanisms for global exploration* T Friedrich, PS Oliveto, D Sudholt, C Witt Evolutionary Computation 17 (4), 455-476, 2009 | 81 | 2009 |
| Analysis of different MMAS ACO algorithms on unimodal functions and plateaus F Neumann, D Sudholt, C Witt Swarm Intelligence 3 (1), 35-68, 2009 | 79* | 2009 |
| Runtime analysis of a simple ant colony optimization algorithm F Neumann, C Witt Algorithmica 54 (2), 243, 2009 | 72 | 2009 |
| 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 | 72 | 2007 |
| 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 | 72* | 2005 |
| Concentrated hitting times of randomized search heuristics with variable drift PK Lehre, C Witt International Symposium on Algorithms and Computation, 686-697, 2014 | 67* | 2014 |
| Population size versus runtime of a simple evolutionary algorithm C Witt Theoretical Computer Science 403 (1), 104-120, 2008 | 67* | 2008 |
| Runtime analysis of a binary particle swarm optimizer D Sudholt, C Witt Theoretical Computer Science 411 (21), 2084-2100, 2010 | 62* | 2010 |
| Improved time complexity analysis of the simple genetic algorithm PS Oliveto, C Witt Theoretical Computer Science 605, 21-41, 2015 | 60 | 2015 |
Frank NeumannOptimisation and Logistics, School of ComputerVerified email at adelaide.edu.au
