| 2026 | AAAI | Theoretical and Empirical Analysis of Lehmer Codes to Search Permutation Spaces with Evolutionary Algorithms. | Yuxuan Ma, Valentino Santucci, Carsten Witt |
| 2026 | EvoCOP | A Self-adjusting Compact Genetic Algorithm. | Sumit Adak, Carsten Witt |
| 2026 | PPSN | Runtime Analysis of a Compact Genetic Algorithm on a Truly Multi-Valued OneMax Function. | Martin S. Krejca, Carsten Witt |
| 2025 | EvoCOP | A Runtime Analysis of the Multi-valued Compact Genetic Algorithm on Generalized LeadingOnes. | Sumit Adak, Carsten Witt |
| 2025 | FOGA | Runtime Analysis of a Compact Genetic Algorithm with High Selection Pressure. | Sumit Adak, Carsten Witt |
| 2025 | FOGA | Population Dynamics and Improved Runtime Guarantees for the (μ+1) EA on BinVal. | Martin S. Krejca, Frank Neumann, Carsten Witt |
| 2025 | GECCO | Improved Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Two Generalized OneMax Problems. | Sumit Adak, Carsten Witt |
| 2024 | GECCO | A Runtime Analysis of Bias-invariant Neuroevolution and Dynamic Fitness Evaluation. | Paul Fischer, John Alasdair Warwicker, Carsten Witt |
| 2024 | GECCO | A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive. | Martin S. Krejca, Carsten Witt |
| 2024 | PPSN | Runtime Analysis of a Multi-valued Compact Genetic Algorithm on Generalized OneMax. | Sumit Adak, Carsten Witt |
| 2024 | PPSN | Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints. | Frank Neumann, Carsten Witt |
| 2023 | ECAI | Fast Pareto Optimization Using Sliding Window Selection. | Frank Neumann, Carsten Witt |
| 2023 | FOGA | First Steps Towards a Runtime Analysis of Neuroevolution. | Paul Fischer, Emil Lundt Larsen, Carsten Witt |
| 2023 | GECCO | 3-Objective Pareto Optimization for Problems with Chance Constraints. | Frank Neumann, Carsten Witt |
| 2023 | GECCO | How Well Does the Metropolis Algorithm Cope With Local Optima? | Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt |
| 2022 | GECCO | The compact genetic algorithm struggles on Cliff functions. | Frank Neumann, Dirk Sudholt, Carsten Witt |
| 2022 | GECCO | Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. | Benjamin Doerr, Amirhossein Rajabi, Carsten Witt |
| 2022 | IJCAI | Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. | Frank Neumann, Carsten Witt |
| 2022 | PPSN | Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions. | Frank Neumann, Carsten Witt |
| 2021 | FOGA | On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms. | Carsten Witt |
| 2021 | GECCO | Stagnation detection in highly multimodal fitness landscapes. | Amirhossein Rajabi, Carsten Witt |
| 2020 | GECCO | A tight lower bound on the expected runtime of standard steady state genetic algorithms. | Pietro S. Oliveto, Dirk Sudholt, Carsten Witt |
| 2020 | GECCO | Self-adjusting evolutionary algorithms for multimodal optimization. | Amirhossein Rajabi, Carsten Witt |
| 2020 | GECCO | Theory of estimation-of-distribution algorithms. | Carsten Witt |
| 2020 | PPSN | Improved Fixed-Budget Results via Drift Analysis. | Timo Ktzing, Carsten Witt |
| 2020 | PPSN | Evolutionary Algorithms with Self-adjusting Asymmetric Mutation. | Amirhossein Rajabi, Carsten Witt |
| 2019 | FOGA | Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools. | Hsien-Kuei Hwang, Carsten Witt |
| 2019 | GECCO | Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint. | Frank Neumann, Mojgan Pourhassan, Carsten Witt |
| 2019 | GECCO | Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs. | Andrew M. Sutton, Carsten Witt |
| 2019 | GECCO | Theory of estimation-of-distribution algorithms. | Carsten Witt |
| 2018 | GECCO | Runtime analysis for self-adaptive mutation rates. | Benjamin Doerr, Carsten Witt, Jing Yang |
| 2018 | GECCO | Medium step sizes are harmful for the compact genetic algorithm. | Johannes Lengler, Dirk Sudholt, Carsten Witt |
| 2018 | GECCO | Domino convergence: why one should hill-climb on linear functions. | Carsten Witt |
| 2018 | GECCO | Theory of estimation-of-distribution algorithms. | Carsten Witt |
| 2017 | FOGA | Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax. | Martin S. Krejca, Carsten Witt |
| 2017 | GECCO | The (1+ | Benjamin Doerr, Christian Gieen, Carsten Witt, Jing Yang |
| 2017 | GECCO | Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax. | Carsten Witt |
| 2016 | GECCO | Optimal Mutation Rates for the (1+λ) EA on OneMax. | Christian Gieen, Carsten Witt |
| 2016 | GECCO | The Impact of Migration Topology on the Runtime of Island Models in Dynamic Optimization. | Andrei Lissovoi, Carsten Witt |
| 2016 | GECCO | Update Strength in EDAs and ACO: How to Avoid Genetic Drift. | Dirk Sudholt, Carsten Witt |
| 2015 | FOGA | (1+1) EA on Generalized Dynamic OneMax. | Timo Ktzing, Andrei Lissovoi, Carsten Witt |
| 2015 | GECCO | Population Size vs. Mutation Strength for the (1+λ) EA on OneMax. | Christian Gieen, Carsten Witt |
| 2015 | GECCO | On the Utility of Island Models in Dynamic Optimization. | Andrei Lissovoi, Carsten Witt |
| 2015 | IJCAI | On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling. | Frank Neumann, Carsten Witt |
| 2014 | GECCO | MMAS vs. population-based EA on a family of dynamic fitness functions. | Andrei Lissovoi, Carsten Witt |
| 2014 | GECCO | Revised analysis of the (1+1) ea for the minimum spanning tree problem. | Carsten Witt |
| 2014 | GECCO | Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. | Carsten Witt |
| 2014 | ISAAC | Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift. | Per Kristian Lehre, Carsten Witt |
| 2013 | FOGA | When do evolutionary algorithms optimize separable functions in parallel? | Benjamin Doerr, Dirk Sudholt, Carsten Witt |
| 2013 | GECCO | Evolutionary algorithms for the detection of structural breaks in time series: extended abstract. | Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt |
| 2013 | GECCO | A method to derive fixed budget results from expected optimisation times. | Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges |
| 2013 | GECCO | Runtime analysis of ant colony optimization on dynamic shortest path problems. | Andrei Lissovoi, Carsten Witt |
| 2013 | GECCO | Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. | Frank Neumann, Carsten Witt |
| 2013 | GECCO | Improved runtime analysis of the simple genetic algorithm. | Pietro S. Oliveto, Carsten Witt |
| 2012 | GECCO | Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. | Frank Neumann, Carsten Witt |
| 2012 | GECCO | On the analysis of the simple genetic algorithm. | Pietro S. Oliveto, Carsten Witt |
| 2012 | STACS | Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. | Carsten Witt |
| 2011 | FCT | Edge-Matching Problems with Rotations. | Martin Ebbesen, Paul Fischer, Carsten Witt |
| 2011 | GECCO | Sharp bounds by probability-generating functions and variable drift. | Benjamin Doerr, Mahmoud Fouz, Carsten Witt |
| 2011 | GECCO | Theory of randomized search heuristics in combinatorial optimization. | Carsten Witt |
| 2010 | GECCO | Quasirandom evolutionary algorithms. | Benjamin Doerr, Mahmoud Fouz, Carsten Witt |
| 2010 | GECCO | Black-box search by unbiased variation. | Per Kristian Lehre, Carsten Witt |
| 2010 | GECCO | A few ants are enough: ACO with iteration-best update. | Frank Neumann, Dirk Sudholt, Carsten Witt |
| 2010 | GECCO | Theory of randomised search heuristics in combinatorial optimisation. | Carsten Witt |
| 2009 | FOGA | Why standard particle swarm optimisers elude a theoretical runtime analysis. | Carsten Witt |
| 2009 | GECCO | Theoretical analysis of fitness-proportional selection: landscapes and efficiency. | Frank Neumann, Pietro S. Oliveto, Carsten Witt |
| 2009 | GECCO | Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. | Carsten Witt |
| 2009 | TAMC | Greedy Local Search and Vertex Cover in Sparse Random Graphs. | Carsten Witt |
| 2008 | GECCO | Theoretical analysis of diversity mechanisms for global exploration. | Tobias Friedrich, Pietro S. Oliveto, Dirk Sudholt, Carsten Witt |
| 2008 | GECCO | Runtime analysis of binary PSO. | Dirk Sudholt, Carsten Witt |
| 2008 | GECCO | Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. | Carsten Witt |
| 2008 | PPSN | Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. | Pietro S. Oliveto, Carsten Witt |
| 2007 | CEC | On improving approximate solutions by evolutionary algorithms. | Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt |
| 2007 | GECCO | On the runtime analysis of the 1-ANT ACO algorithm. | Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt |
| 2007 | GECCO | Approximating covering problems by randomized search heuristics using multi-objective models. | Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt |
| 2006 | ISAAC | Runtime Analysis of a Simple Ant Colony Optimization Algorithm. | Frank Neumann, Carsten Witt |
| 2005 | GECCO | Rigorous runtime analysis of a (+1)ES for the sphere function. | Jens Jgerskpper, Carsten Witt |
| 2005 | STACS | Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. | Carsten Witt |
| 2004 | GECCO | An Analysis of the (+1) EA on Simple Pseudo-Boolean Functions. | Carsten Witt |
| 2003 | CEC | Population size vs. runtime of a simple EA. | Carsten Witt |
| 2003 | GECCO | On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. | Ingo Wegener, Carsten Witt |