Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. - Susanne Albers; Carsten Witt (RANDOM-APPROX, 2001)

Population size vs. runtime of a simple EA. - Carsten Witt (IEEE Congress on Evolutionary Computation, 2003)

On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. - Ingo Wegener; Carsten Witt (GECCO, 2003)

An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions. - Carsten Witt (GECCO (1), 2004)

Über die Analyse randomisierter Suchheuristiken und den Entwurf spezialisierter Algorithmen im Bereich der kombinatorischen Optimierung. - Carsten Witt (Ausgezeichnete Informatikdissertationen, 2004)

Über die Analyse randomisierter Suchheuristiken und den Entwurf spezialisierter Algorithmen im Bereich der kombinatorischen Optimierung. - Carsten Witt (2004)

Rigorous runtime analysis of a (µ+1)ES for the sphere function. - Jens Jägersküpper; Carsten Witt (GECCO, 2005)

Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. - Carsten Witt (STACS, 2005)

On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. - Ingo Wegener; Carsten Witt (Comb. Probab. Comput., 2005)

On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. - Ingo Wegener; Carsten Witt (J. Discrete Algorithms, 2005)

Runtime Analysis of the (mu + 1) EA on Simple Pseudo-Boolean Functions. - Carsten Witt (Evol. Comput., 2006)

Runtime Analysis of a Simple Ant Colony Optimization Algorithm. - Frank Neumann 001; Carsten Witt (Electron. Colloquium Comput. Complex., 2006)

On improving approximate solutions by evolutionary algorithms. - Tobias Friedrich 001; Jun He 004; Nils Hebbinghaus; Frank Neumann 001; Carsten Witt (IEEE Congress on Evolutionary Computation, 2007)

On the runtime analysis of the 1-ANT ACO algorithm. - Benjamin Doerr; Frank Neumann 001; Dirk Sudholt; Carsten Witt (GECCO, 2007)

Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. - Frank Neumann 001; Dirk Sudholt; Carsten Witt (SLS, 2007)

A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability. - Jun He 004; Colin R. Reeves; Carsten Witt; Xin Yao 001 (Evol. Comput., 2007)

Collaborative Research Centre 531: Computational Intelligence - Theory and Practice (Sonderforschungsbereich 531: Computational Intelligence - Theorie und Praxis). - Jörn Mehnen; Thomas Michelitsch; Carsten Witt (it Inf. Technol., 2007)

Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. - Frank Neumann 001; Dirk Sudholt; Carsten Witt (ANTS Conference, 2008)

08051 Executive Summary - Theory of Evolutionary Algorithms. - Dirk V. Arnold; Anne Auger; Jonathan E. Rowe; Carsten Witt (Theory of Evolutionary Algorithms, 2008)

08051 Abstracts Collection - Theory of Evolutionary Algorithms. - Dirk V. Arnold; Anne Auger; Carsten Witt; Jonathan E. Rowe (Theory of Evolutionary Algorithms, 2008)

Theoretical analysis of diversity mechanisms for global exploration. - Tobias Friedrich 001; Pietro S. Oliveto; Dirk Sudholt; Carsten Witt (GECCO, 2008)

Runtime analysis of binary PSO. - Dirk Sudholt; Carsten Witt (GECCO, 2008)

Population size versus runtime of a simple evolutionary algorithm. - Carsten Witt (Theor. Comput. Sci., 2008)

Why standard particle swarm optimisers elude a theoretical runtime analysis. - Carsten Witt (FOGA, 2009)

Theoretical analysis of fitness-proportional selection: landscapes and efficiency. - Frank Neumann 001; Pietro S. Oliveto; Carsten Witt (GECCO, 2009)

Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. - Carsten Witt (GECCO (Companion), 2009)

Greedy Local Search and Vertex Cover in Sparse Random Graphs. - Carsten Witt (TAMC, 2009)

Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. - Tobias Friedrich 001; Jun He 004; Nils Hebbinghaus; Frank Neumann 001; Carsten Witt (Evol. Comput., 2009)

Analysis of Diversity-Preserving Mechanisms for Global Exploration. - Tobias Friedrich 001; Pietro S. Oliveto; Dirk Sudholt; Carsten Witt (Evol. Comput., 2009)

Ingo Wegener. - Thomas Jansen 001; Melanie Schmidt 001; Dirk Sudholt; Carsten Witt; Christine Zarges (Evol. Comput., 2009)

Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. - Frank Neumann 001; Dirk Sudholt; Carsten Witt (Swarm Intell., 2009)

Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search. - Frank Neumann 001; Dirk Sudholt; Carsten Witt (Innovations in Swarm Intelligence, 2009)

Bioinspired Computation in Combinatorial Optimization - Frank Neumann 001; Carsten Witt (Bioinspired Computation in Combinatorial Optimization, 2010)

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. - Timo Kötzing; Frank Neumann 001; Heiko Röglin; Carsten Witt (ANTS Conference, 2010)

10361 Abstracts Collection and Executive Summary - Theory of Evolutionary Algorithms. - Anne Auger; Jonathan L. Shapiro; L. Darrell Whitley; Carsten Witt (Theory of Evolutionary Algorithms, 2010)

Quasirandom evolutionary algorithms. - Benjamin Doerr; Mahmoud Fouz; Carsten Witt (GECCO, 2010)

A few ants are enough: ACO with iteration-best update. - Frank Neumann 001; Dirk Sudholt; Carsten Witt (GECCO, 2010)

Theory of randomised search heuristics in combinatorial optimisation. - Carsten Witt (GECCO (Companion), 2010)

Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. - Tobias Friedrich 001; Jun He 004; Nils Hebbinghaus; Frank Neumann 001; Carsten Witt (Evol. Comput., 2010)

Black-Box Search by Unbiased Variation. - Per Kristian Lehre; Carsten Witt (Electron. Colloquium Comput. Complex., 2010)

Ant Colony Optimization and the minimum spanning tree problem. - Frank Neumann 001; Carsten Witt (Theor. Comput. Sci., 2010)

Runtime analysis of a binary particle swarm optimizer. - Dirk Sudholt; Carsten Witt (Theor. Comput. Sci., 2010)

Theory of Particle Swarm Optimization. - Carsten Witt (Theory of Randomized Search Heuristics, 2011)

Edge-Matching Problems with Rotations. - Martin Ebbesen; Paul Fischer; Carsten Witt (FCT, 2011)

Sharp bounds by probability-generating functions and variable drift. - Benjamin Doerr; Mahmoud Fouz; Carsten Witt (GECCO, 2011)

Theory of randomized search heuristics in combinatorial optimization. - Carsten Witt (GECCO (Companion), 2011)

Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. - Pietro S. Oliveto; Carsten Witt (Algorithmica, 2011)

Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation - Per Kristian Lehre; Carsten Witt (CoRR, 2011)

Tight Bounds on the Optimization Time of the (1+1) EA on Linear Functions - Carsten Witt (CoRR, 2011)

Runtime analysis of the 1-ANT ant colony optimizer. - Benjamin Doerr; Frank Neumann 001; Dirk Sudholt; Carsten Witt (Theor. Comput. Sci., 2011)

On the analysis of the simple genetic algorithm. - Pietro S. Oliveto; Carsten Witt (GECCO, 2012)

Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. - Carsten Witt (STACS, 2012)

Theory of Randomized Search Heuristics. - Anne Auger; Carsten Witt (Algorithmica, 2012)

Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. - Pietro S. Oliveto; Carsten Witt (CoRR, 2012)

Theoretical analysis of two ACO approaches for the traveling salesman problem. - Timo Kötzing; Frank Neumann 001; Heiko Röglin; Carsten Witt (Swarm Intell., 2012)

Analysis of an iterated local search algorithm for vertex cover in sparse random graphs. - Carsten Witt (Theor. Comput. Sci., 2012)

When do evolutionary algorithms optimize separable functions in parallel? - Benjamin Doerr; Dirk Sudholt; Carsten Witt (FOGA, 2013)

Evolutionary algorithms for the detection of structural breaks in time series: extended abstract. - Benjamin Doerr; Paul Fischer; Astrid Hilbert; Carsten Witt (GECCO (Companion), 2013)

A method to derive fixed budget results from expected optimisation times. - Benjamin Doerr; Thomas Jansen 001; Carsten Witt; Christine Zarges (GECCO, 2013)

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. - Frank Neumann 001; Carsten Witt (GECCO (Companion), 2013)

Improved runtime analysis of the simple genetic algorithm. - Pietro S. Oliveto; Carsten Witt (GECCO, 2013)

General Drift Analysis with Tail Bounds. - Per Kristian Lehre; Carsten Witt (CoRR, 2013)

The Fitness Level Method with Tail Bounds. - Carsten Witt (CoRR, 2013)

Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions. - Carsten Witt (Comb. Probab. Comput., 2013)

MMAS vs. population-based EA on a family of dynamic fitness functions. - Andrei Lissovoi; Carsten Witt (GECCO, 2014)

Revised analysis of the (1+1) ea for the minimum spanning tree problem. - Carsten Witt (GECCO, 2014)

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. - Carsten Witt (GECCO (Companion), 2014)

Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift. - Per Kristian Lehre; Carsten Witt (ISAAC, 2014)

Fitness levels with tail bounds for the analysis of randomized search heuristics. - Carsten Witt (Inf. Process. Lett., 2014)

On the runtime analysis of the Simple Genetic Algorithm. - Pietro S. Oliveto; Carsten Witt (Theor. Comput. Sci., 2014)

(1+1) EA on Generalized Dynamic OneMax. - Timo Kötzing; Andrei Lissovoi; Carsten Witt (FOGA, 2015)

Population Size vs. Mutation Strength for the (1+λ) EA on OneMax. - Christian Gießen; Carsten Witt (GECCO, 2015)

On the Utility of Island Models in Dynamic Optimization. - Andrei Lissovoi; Carsten Witt (GECCO, 2015)

On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling. - Frank Neumann 001; Carsten Witt (IJCAI, 2015)

Runtime analysis of ant colony optimization on dynamic shortest path problems. - Andrei Lissovoi; Carsten Witt (Theor. Comput. Sci., 2015)

Improved time complexity analysis of the Simple Genetic Algorithm. - Pietro S. Oliveto; Carsten Witt (Theor. Comput. Sci., 2015)

Optimal Mutation Rates for the (1+λ) EA on OneMax. - Christian Gießen; Carsten Witt (GECCO, 2016)

The Impact of Migration Topology on the Runtime of Island Models in Dynamic Optimization. - Andrei Lissovoi; Carsten Witt (GECCO, 2016)

Update Strength in EDAs and ACO: How to Avoid Genetic Drift. - Dirk Sudholt; Carsten Witt (GECCO, 2016)

Guest Editorial: Theory of Evolutionary Computation. - Benjamin Doerr; Carsten Witt (Algorithmica, 2016)

MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions. - Andrei Lissovoi; Carsten Witt (Algorithmica, 2016)

The (1+λ) evolutionary algorithm with self-adjusting mutation rate. - Benjamin Doerr; Christian Gießen; Carsten Witt; Jing Yang 016 (GECCO, 2017)

Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax. - Carsten Witt (GECCO, 2017)

The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax. - Christian Gießen; Carsten Witt (Algorithmica, 2017)

A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization. - Andrei Lissovoi; Carsten Witt (Algorithmica, 2017)

Detecting structural breaks in time series via genetic algorithms. - Benjamin Doerr; Paul Fischer; Astrid Hilbert; Carsten Witt (Soft Comput., 2017)

Medium step sizes are harmful for the compact genetic algorithm. - Johannes Lengler; Dirk Sudholt; Carsten Witt (GECCO, 2018)

Domino convergence: why one should hill-climb on linear functions. - Carsten Witt (GECCO, 2018)

Optimal Mutation Rates for the (1+λ) EA on OneMax Through Asymptotically Tight Drift Analysis. - Christian Gießen; Carsten Witt (Algorithmica, 2018)

The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization. - Andrei Lissovoi; Carsten Witt (Algorithmica, 2018)

Theory of Estimation-of-Distribution Algorithms. - Martin S. Krejca; Carsten Witt (CoRR, 2018)

Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools. - Hsien-Kuei Hwang; Carsten Witt (FOGA, 2019)

The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. - Benjamin Doerr; Christian Gießen; Carsten Witt; Jing Yang 016 (Algorithmica, 2019)

On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization. - Dirk Sudholt; Carsten Witt (Algorithmica, 2019)

Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax. - Carsten Witt (Algorithmica, 2019)

A tight lower bound on the expected runtime of standard steady state genetic algorithms. - Pietro S. Oliveto; Dirk Sudholt; Carsten Witt (GECCO, 2020)

Theory of estimation-of-distribution algorithms. - Carsten Witt (GECCO Companion, 2020)

Improved Fixed-Budget Results via Drift Analysis. - Timo Kötzing; Carsten Witt (PPSN (2), 2020)

Evolutionary Algorithms with Self-adjusting Asymmetric Mutation. - Amirhossein Rajabi; Carsten Witt (PPSN (1), 2020)

Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax. - Martin S. Krejca; Carsten Witt (Theor. Comput. Sci., 2020)

Theory of Estimation-of-Distribution Algorithms. - Martin S. Krejca; Carsten Witt (Theory of Evolutionary Computation, 2020)

On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms. - Carsten Witt (FOGA, 2021)

Runtime Analysis for Self-adaptive Mutation Rates. - Benjamin Doerr; Carsten Witt; Jing Yang 016 (Algorithmica, 2021)

The Complex Parameter Landscape of the Compact Genetic Algorithm. - Johannes Lengler; Dirk Sudholt; Carsten Witt (Algorithmica, 2021)

Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. - Frank Neumann 001; Mojgan Pourhassan; Carsten Witt (Algorithmica, 2021)

Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs. - Andrew M. Sutton; Carsten Witt (Algorithmica, 2021)

Tail bounds on hitting times of randomized search heuristics using variable drift analysis. - Per Kristian Lehre; Carsten Witt (Comb. Probab. Comput., 2021)

On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials Is Best. - Dogan Corus; Andrei Lissovoi; Pietro S. Oliveto; Carsten Witt (ACM Trans. Evol. Learn. Optim., 2021)

Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. - Frank Neumann 001; Carsten Witt (IJCAI, 2022)

Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions. - Frank Neumann 001; Carsten Witt (PPSN (2), 2022)

Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm. - Pietro S. Oliveto; Dirk Sudholt; Carsten Witt (Algorithmica, 2022)

Self-Adjusting Evolutionary Algorithms for Multimodal Optimization. - Amirhossein Rajabi; Carsten Witt (Algorithmica, 2022)

Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182). - Josu Ceberio Uribe; Benjamin Doerr; Carsten Witt; Vicente P. Soloviev (Dagstuhl Reports, 2022)

Fast Pareto Optimization Using Sliding Window Selection. - Frank Neumann 001; Carsten Witt (ECAI, 2023)

First Steps Towards a Runtime Analysis of Neuroevolution. - Paul Fischer; Emil Lundt Larsen; Carsten Witt (FOGA, 2023)

3-Objective Pareto Optimization for Problems with Chance Constraints. - Frank Neumann 001; Carsten Witt (GECCO, 2023)

How Well Does the Metropolis Algorithm Cope With Local Optima? - Benjamin Doerr; Taha El Ghazi El Houssaini; Amirhossein Rajabi; Carsten Witt (GECCO, 2023)

Stagnation Detection with Randomized Local Search. - Amirhossein Rajabi; Carsten Witt (Evol. Comput., 2023)

How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. - Carsten Witt (Theor. Comput. Sci., 2023)

A Runtime Analysis of Bias-invariant Neuroevolution and Dynamic Fitness Evaluation. - Paul Fischer; John Alasdair Warwicker; Carsten Witt (GECCO, 2024)

A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive. - Martin S. Krejca; Carsten Witt (GECCO, 2024)

Runtime Analysis of a Multi-valued Compact Genetic Algorithm on Generalized OneMax. - Sumit Adak; Carsten Witt (PPSN (3), 2024)

Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints. - Frank Neumann 001; Carsten Witt (PPSN (3), 2024)

Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. - Benjamin Doerr; Amirhossein Rajabi; Carsten Witt (Algorithmica, 2024)

Stagnation Detection in Highly Multimodal Fitness Landscapes. - Amirhossein Rajabi; Carsten Witt (Algorithmica, 2024)

A Runtime Analysis of the Multi-valued Compact Genetic Algorithm on Generalized LeadingOnes. - Sumit Adak; Carsten Witt (EvoCOP@EvoStar, 2025)

Improved Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Two Generalized OneMax Problems. - Sumit Adak; Carsten Witt (GECCO, 2025)

Runtime Analysis of Single- and Multiobjective Evolutionary Algorithms for Chance-Constrained Optimization Problems with Normally Distributed Random Variables. - Frank Neumann 001; Carsten Witt (Evol. Comput., 2025)

The Compact Genetic Algorithm Struggles on Cliff Functions. - Frank Neumann 001; Dirk Sudholt; Carsten Witt (Algorithmica, 2025)