Carsten Witt

Cited by

	All	Since 2017
Citations	4352	2303
h-index	38	28
i10-index	68	58

460

230

115

345

2003200420052006200720082009201020112012201320142015201620172018201920202021202220 41 43 34 75 85 136 129 212 215 256 224 255 235 325 331 441 417 459 319

Public access

View all

49 articles

10 articles

available

not available

Based on funding mandates

Co-authors

Frank NeumannOptimisation and Logistics, School of ComputerVerified email at adelaide.edu.au
Dirk SudholtUniversity of Passau, GermanyVerified email at uni-passau.de
Pietro S. OlivetoProfessor of Computer Science, Chair in Algorithms, The University of SheffieldVerified email at sheffield.ac.uk
Benjamin DoerrProfessor at Ecole Polytechnique, FranceVerified email at lix.polytechnique.fr
Per Kristian LehreProfessor at University of Birmingham and UKRI Turing AI Acceleration FellowVerified email at cs.bham.ac.uk
Andrei LissovoiResearch Associate, University of SheffieldVerified email at sheffield.ac.uk
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyVerified email at hpi.de
Christian GießenContinental AGVerified email at giessen.io
Jun HeNottingham Trent UniversityVerified email at ntu.ac.uk
Thomas JansenAberystwyth UniversityVerified email at aber.ac.uk
Christine ZargesDepartment of Computer Science, Aberystwyth UniversityVerified email at aber.ac.uk
Xin YaoSouthern University of Science and Technology and University of Birmingham (UK)Verified email at cs.bham.ac.uk
Heiko RöglinProfessor of Computer Science, University of BonnVerified email at cs.uni-bonn.de
Martin S. KrejcaLIP6, CNRS, Sorbonne UniversityVerified email at lip6.fr
Johannes LenglerETH ZürichVerified email at inf.ethz.ch
Susanne AlbersProfessor of Computer Science, TU MuenchenVerified email at in.tum.de
Hsien-Kuei HwangDistinguished Research Fellow, Institute of Statistical Science, Academia SinicaVerified email at stat.sinica.edu.tw
Jonathan RoweSchool of Computer Science, University of Birmingham Verified email at cs.bham.ac.uk
Paul FischerDTU Compute, Technical University of DenmarkVerified email at dtu.dk

Carsten Witt

Technical University of Denmark

Verified email at imm.dtu.dk

Theoretical Computer Science Randomized Algorithms Search Heuristics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Bioinspired Computation in Combinatorial Optimization - Combinatorial optimization and computational complexity F Neumann, C Witt Springer, Berlin, Heidelberg, 2010	463*	2010
Runtime analysis of the (μ+ 1) EA on simple pseudo-Boolean functions C Witt Evolutionary Computation 14 (1), 65-86, 2006	215*	2006
Black-box search by unbiased variation PK Lehre, C Witt Algorithmica 64 (4), 623-642, 2012	194	2012
Worst-case and average-case approximations by simple randomized search heuristics C Witt Annual Symposium on Theoretical Aspects of Computer Science, 44-56, 2005	183	2005
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	159	2013
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	155	2010
Simplified drift analysis for proving lower bounds in evolutionary computation PS Oliveto, C Witt Algorithmica 59 (3), 369-386, 2011	134	2011
Ant colony optimization and the minimum spanning tree problem F Neumann, C Witt Theoretical Computer Science 411 (25), 2406-2413, 2010	109	2010
Analysis of diversity-preserving mechanisms for global exploration T Friedrich, PS Oliveto, D Sudholt, C Witt Evolutionary Computation 17 (4), 455-476, 2009	104	2009
Analysis of diversity-preserving mechanisms for global exploration* T Friedrich, PS Oliveto, D Sudholt, C Witt Evolutionary Computation 17 (4), 455-476, 2009	104	2009
Improved time complexity analysis of the simple genetic algorithm PS Oliveto, C Witt Theoretical Computer Science 605, 21-41, 2015	103	2015
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	93*	2005
Runtime analysis of a simple ant colony optimization algorithm F Neumann, C Witt International Symposium on Algorithms and Computation, 618-627, 2006	91	2006
Analysis of different MMAS ACO algorithms on unimodal functions and plateaus F Neumann, D Sudholt, C Witt Swarm Intelligence 3 (1), 35-68, 2009	90*	2009
Population size versus runtime of a simple evolutionary algorithm C Witt Theoretical Computer Science 403 (1), 104-120, 2008	86*	2008
Concentrated hitting times of randomized search heuristics with variable drift PK Lehre, C Witt International Symposium on Algorithms and Computation, 686-697, 2014	82*	2014
Runtime analysis of a simple ant colony optimization algorithm F Neumann, C Witt Algorithmica 54 (2), 243-255, 2009	81	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	79	2007
On the runtime analysis of the simple genetic algorithm PS Oliveto, C Witt Theoretical Computer Science 545, 2-19, 2014	74*	2014
Theoretical analysis of fitness-proportional selection: landscapes and efficiency F Neumann, PS Oliveto, C Witt Proceedings of the 11th Annual conference on Genetic and evolutionary …, 2009	74	2009

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors