Carsten Witt Vis

*	2009
32	EE	Frank Neumann, Pietro Simone Oliveto, Carsten Witt: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. GECCO 2009: 835-842
31	EE	Carsten Witt: Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. GECCO (Companion) 2009: 3551-3592
30	EE	Carsten Witt: Greedy Local Search and Vertex Cover in Sparse Random Graphs. TAMC 2009: 410-419
29	EE	Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Algorithmica 54(2): 243-255 (2009)
28	EE	Thomas Jansen, Melanie Schmidt, Dirk Sudholt, Carsten Witt, Christine Zarges: Ingo Wegener. Evolutionary Computation 17(1): 1-2 (2009)
27	EE	Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evolutionary Computation 17(1): 3-19 (2009)
	2008
26	EE	Frank Neumann, Dirk Sudholt, Carsten Witt: Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. ANTS Conference 2008: 132-143
25	EE	Dirk Sudholt, Carsten Witt: Runtime analysis of binary PSO. GECCO 2008: 135-142
24	EE	Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudholt, Carsten Witt: Theoretical analysis of diversity mechanisms for global exploration. GECCO 2008: 945-952
23	EE	Carsten Witt: Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. GECCO (Companion) 2008: 2907-2946
22	EE	Pietro Simone Oliveto, Carsten Witt: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. PPSN 2008: 82-91
21	EE	Carsten Witt: Population size versus runtime of a simple evolutionary algorithm. Theor. Comput. Sci. 403(1): 104-120 (2008)
	2007
20	EE	Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt: On the runtime analysis of the 1-ANT ACO algorithm. GECCO 2007: 33-40
19	EE	Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt: Approximating covering problems by randomized search heuristics using multi-objective models. GECCO 2007: 797-804
18	EE	Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: On improving approximate solutions by evolutionary algorithms. IEEE Congress on Evolutionary Computation 2007: 2614-2621
17	EE	Frank Neumann, Carsten Witt: Ant Colony Optimization and the Minimum Spanning Tree Problem. LION 2007: 153-166
16	EE	Frank Neumann, Dirk Sudholt, Carsten Witt: Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. SLS 2007: 61-75
15	EE	Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Electronic Colloquium on Computational Complexity (ECCC) 14(027): (2007)
14	EE	Jun He, Colin R. Reeves, Carsten Witt, Xin Yao: A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability. Evolutionary Computation 15(4): 435-443 (2007)
13	EE	Jörn Mehnen, Thomas Michelitsch, Carsten Witt: Collaborative Research Centre 531: Computational Intelligence - Theory and Practice (Sonderforschungsbereich 531: Computational Intelligence - Theorie und Praxis). it - Information Technology 49(1): 49- (2007)
	2006
12	EE	Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. ISAAC 2006: 618-627
11	EE	Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Theory of Evolutionary Algorithms 2006
10	EE	Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Electronic Colloquium on Computational Complexity (ECCC) 13(084): (2006)
9	EE	Frank Neumann, Carsten Witt: Ant Colony Optimization and the Minimum Spanning Tree Problem. Electronic Colloquium on Computational Complexity (ECCC) 13(143): (2006)
8	EE	Carsten Witt: Runtime Analysis of the (mu + 1) EA on Simple Pseudo-Boolean Functions. Evolutionary Computation 14(1): 65-86 (2006)
	2005
7	EE	Jens Jägersküpper, Carsten Witt: Rigorous runtime analysis of a (µ+1)ES for the sphere function. GECCO 2005: 849-856
6	EE	Carsten Witt: Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. STACS 2005: 44-56
5	EE	Ingo Wegener, Carsten Witt: On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. Combinatorics, Probability & Computing 14(1-2): 225-247 (2005)
4	EE	Ingo Wegener, Carsten Witt: On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. J. Discrete Algorithms 3(1): 61-78 (2005)
	2004
3	EE	Carsten Witt: An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions. GECCO (1) 2004: 761-773
	2003
2	EE	Ingo Wegener, Carsten Witt: On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. GECCO 2003: 622-633
	2001
1	EE	Susanne Albers, Carsten Witt: Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. RANDOM-APPROX 2001: 12-23

Coauthor Index

1	Susanne Albers	[1]
2	Benjamin Doerr	[20]
3	Tobias Friedrich	[15] [18] [19] [24] [27]
4	Jun He	[14] [15] [18] [19] [27]
5	Nils Hebbinghaus	[15] [18] [19] [27]
6	Jens Jägersküpper	[7]
7	Thomas Jansen	[28]
8	Jörn Mehnen	[13]
9	Thomas Michelitsch	[13]
10	Frank Neumann	[9] [10] [11] [12] [15] [16] [17] [18] [19] [20] [26] [27] [29] [32]
11	Pietro Simone Oliveto	[22] [24] [32]
12	Colin R. Reeves	[14]
13	Melanie Schmidt	[28]
14	Dirk Sudholt	[16] [20] [24] [25] [26] [28]
15	Ingo Wegener	[2] [4] [5]
16	Xin Yao	[14]
17	Christine Zarges	[28]

Colors in the list of coauthors