Carsten Witt

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 82

Top Venues

Dortmund University of Technology (PHD)

Education History

Dortmund University of Technology

PHD

Publications

Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Algorithmica 86 (1) (2024)
Carsten Witt
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. Theor. Comput. Sci. 940 (Part) (2023)
Amirhossein Rajabi, Carsten Witt
Stagnation Detection with Randomized Local Search. Evol. Comput. 31 (1) (2023)
Frank Neumann, Carsten Witt
Fast Pareto Optimization Using Sliding Window Selection. ECAI (2023)
Frank Neumann, Carsten Witt
Fast Pareto Optimization Using Sliding Window Selection. CoRR (2023)
Frank Neumann, Carsten Witt
3-Objective Pareto Optimization for Problems with Chance Constraints. CoRR (2023)
Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt
How Well Does the Metropolis Algorithm Cope With Local Optima? GECCO (2023)
Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt
How Well Does the Metropolis Algorithm Cope With Local Optima? CoRR (2023)
Paul Fischer, Emil Lundt Larsen, Carsten Witt
First Steps towards a Runtime Analysis of Neuroevolution. CoRR (2023)
Paul Fischer, Emil Lundt Larsen, Carsten Witt
First Steps Towards a Runtime Analysis of Neuroevolution. FOGA (2023)
Frank Neumann, Carsten Witt
3-Objective Pareto Optimization for Problems with Chance Constraints. GECCO (2023)
Amirhossein Rajabi, Carsten Witt
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization. Algorithmica 84 (6) (2022)
Frank Neumann, Carsten Witt
Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. IJCAI (2022)
Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. CoRR (2022)
Josu Ceberio Uribe, Benjamin Doerr, Carsten Witt, Vicente P. Soloviev
Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182). Dagstuhl Reports 12 (5) (2022)
Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. GECCO (2022)
Frank Neumann, Carsten Witt
Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions. PPSN (2) (2022)
Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm. Algorithmica 84 (6) (2022)
Frank Neumann, Dirk Sudholt, Carsten Witt
The Compact Genetic Algorithm Struggles on Cliff Functions. CoRR (2022)
Frank Neumann, Carsten Witt
Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions. CoRR (2022)
Frank Neumann, Dirk Sudholt, Carsten Witt
The compact genetic algorithm struggles on Cliff functions. GECCO (2022)
Amirhossein Rajabi, Carsten Witt
Stagnation Detection with Randomized Local Search. EvoCOP (2021)
Amirhossein Rajabi, Carsten Witt
Stagnation detection in highly multimodal fitness landscapes. GECCO (2021)
Frank Neumann, Mojgan Pourhassan, Carsten Witt
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. Algorithmica 83 (10) (2021)
Benjamin Doerr, Carsten Witt, Jing Yang
Runtime Analysis for Self-adaptive Mutation Rates. Algorithmica 83 (4) (2021)
Johannes Lengler, Dirk Sudholt, Carsten Witt
The Complex Parameter Landscape of the Compact Genetic Algorithm. Algorithmica 83 (4) (2021)
Carsten Witt
On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms. FOGA (2021)
Frank Neumann, Carsten Witt
Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. CoRR (2021)
Amirhossein Rajabi, Carsten Witt
Stagnation Detection with Randomized Local Search. CoRR (2021)
Per Kristian Lehre, Carsten Witt
Tail bounds on hitting times of randomized search heuristics using variable drift analysis. Comb. Probab. Comput. 30 (4) (2021)
Amirhossein Rajabi, Carsten Witt
Stagnation Detection in Highly Multimodal Fitness Landscapes. CoRR (2021)
Dogan Corus, Andrei Lissovoi, Pietro S. Oliveto, Carsten Witt
On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials is Best. CoRR (2021)
Andrew M. Sutton, Carsten Witt
Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs. Algorithmica 83 (10) (2021)
Dogan Corus, Andrei Lissovoi, Pietro S. Oliveto, Carsten Witt
On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials Is Best. ACM Trans. Evol. Learn. Optim. 1 (1) (2021)
Amirhossein Rajabi, Carsten Witt
Self-adjusting evolutionary algorithms for multimodal optimization. GECCO (2020)
Amirhossein Rajabi, Carsten Witt
Evolutionary Algorithms with Self-adjusting Asymmetric Mutation. CoRR (2020)
Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
A tight lower bound on the expected runtime of standard steady state genetic algorithms. GECCO (2020)
Martin S. Krejca, Carsten Witt
Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax. Theor. Comput. Sci. 832 (2020)
Carsten Witt
Theory of estimation-of-distribution algorithms. GECCO Companion (2020)
Timo Kötzing, Carsten Witt
Improved Fixed-Budget Results via Drift Analysis. PPSN (2) (2020)
Frank Neumann, Mojgan Pourhassan, Carsten Witt
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. CoRR (2020)
Amirhossein Rajabi, Carsten Witt
Evolutionary Algorithms with Self-adjusting Asymmetric Mutation. PPSN (1) (2020)
Timo Kötzing, Carsten Witt
Improved Fixed-Budget Results via Drift Analysis. CoRR (2020)
Amirhossein Rajabi, Carsten Witt
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization. CoRR (2020)
Hsien-Kuei Hwang, Carsten Witt
Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools. FOGA (2019)
Carsten Witt
Theory of estimation-of-distribution algorithms. GECCO (Companion) (2019)
Frank Neumann, Mojgan Pourhassan, Carsten Witt
Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint. GECCO (2019)
Carsten Witt
Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax. Algorithmica 81 (2) (2019)
Dirk Sudholt, Carsten Witt
On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization. Algorithmica 81 (4) (2019)
Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang
The ( $$1+\lambda $$ 1 + λ ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. Algorithmica 81 (2) (2019)
Andrew M. Sutton, Carsten Witt
Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs. GECCO (2019)
Hsien-Kuei Hwang, Carsten Witt
Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools. CoRR (2019)
Christian Gießen, Carsten Witt
Optimal Mutation Rates for the (1+ λ ) EA on OneMax Through Asymptotically Tight Drift Analysis. Algorithmica 80 (5) (2018)
Johannes Lengler, Dirk Sudholt, Carsten Witt
Medium step sizes are harmful for the compact genetic algorithm. GECCO (2018)
Benjamin Doerr, Carsten Witt, Jing Yang
Runtime Analysis for Self-adaptive Mutation Rates. CoRR (2018)
Andrei Lissovoi, Carsten Witt
The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization. Algorithmica 80 (5) (2018)
Martin S. Krejca, Carsten Witt
Theory of Estimation-of-Distribution Algorithms. CoRR (2018)
Carsten Witt
Domino convergence: why one should hill-climb on linear functions. GECCO (2018)
Benjamin Doerr, Carsten Witt, Jing Yang
Runtime analysis for self-adaptive mutation rates. GECCO (2018)
Carsten Witt
Theory of estimation-of-distribution algorithms. GECCO (Companion) (2018)
Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang
) evolutionary algorithm with self-adjusting mutation rate. GECCO (2017)
Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt
Detecting structural breaks in time series via genetic algorithms. Soft Comput. 21 (16) (2017)
Martin Ebbesen, Paul Fischer, Carsten Witt
Edge-matching Problems with Rotations. CoRR (2017)
Carsten Witt
Upper Bounds on the Runtime of the Univariate Marginal Distribution Algorithm on OneMax. CoRR (2017)
Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang
The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. CoRR (2017)
Andrei Lissovoi, Carsten Witt
A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization. Algorithmica 78 (2) (2017)
Martin S. Krejca, Carsten Witt
Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax. FOGA (2017)
Carsten Witt
Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax. GECCO (2017)
Christian Gießen, Carsten Witt
The Interplay of Population Size and Mutation Probability in the (1 + λ) EA on OneMax. Algorithmica 78 (2) (2017)
Benjamin Doerr, Carsten Witt
Guest Editorial: Theory of Evolutionary Computation. Algorithmica 75 (3) (2016)
Dirk Sudholt, Carsten Witt
Update Strength in EDAs and ACO: How to Avoid Genetic Drift. CoRR (2016)
Dirk Sudholt, Carsten Witt
Update Strength in EDAs and ACO: How to Avoid Genetic Drift. GECCO (2016)
Andrei Lissovoi, Carsten Witt
MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions. Algorithmica 75 (3) (2016)
Christian Gießen, Carsten Witt
Optimal Mutation Rates for the (1+λ) EA on OneMax. GECCO (2016)
Andrei Lissovoi, Carsten Witt
The Impact of Migration Topology on the Runtime of Island Models in Dynamic Optimization. GECCO (2016)
Andrei Lissovoi, Carsten Witt
On the Utility of Island Models in Dynamic Optimization. GECCO (2015)
Timo Kötzing, Andrei Lissovoi, Carsten Witt
(1+1) EA on Generalized Dynamic OneMax. FOGA (2015)
Frank Neumann, Carsten Witt
On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling. IJCAI (2015)
Andrei Lissovoi, Carsten Witt
Runtime analysis of ant colony optimization on dynamic shortest path problems. Theor. Comput. Sci. 561 (2015)
Pietro S. Oliveto, Carsten Witt
Improved time complexity analysis of the Simple Genetic Algorithm. Theor. Comput. Sci. 605 (2015)
Frank Neumann, Carsten Witt
On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling. CoRR (2015)
Christian Gießen, Carsten Witt
Population Size vs. Mutation Strength for the (1+λ) EA on OneMax. GECCO (2015)
Carsten Witt
Fitness levels with tail bounds for the analysis of randomized search heuristics. Inf. Process. Lett. 114 (1-2) (2014)
Andrei Lissovoi, Carsten Witt
MMAS vs. population-based EA on a family of dynamic fitness functions. GECCO (2014)
Carsten Witt
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. GECCO (Companion) (2014)
Per Kristian Lehre, Carsten Witt
Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift. ISAAC (2014)
Carsten Witt
Revised analysis of the (1+1) ea for the minimum spanning tree problem. GECCO (2014)
Pietro S. Oliveto, Carsten Witt
On the runtime analysis of the Simple Genetic Algorithm. Theor. Comput. Sci. 545 (2014)
Pietro S. Oliveto, Carsten Witt
Improved runtime analysis of the simple genetic algorithm. GECCO (2013)
Carsten Witt
The Fitness Level Method with Tail Bounds. CoRR (2013)
Per Kristian Lehre, Carsten Witt
General Drift Analysis with Tail Bounds. CoRR (2013)
Carsten Witt
Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions. Comb. Probab. Comput. 22 (2) (2013)
Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges
A method to derive fixed budget results from expected optimisation times. GECCO (2013)
Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt
Evolutionary algorithms for the detection of structural breaks in time series: extended abstract. GECCO (Companion) (2013)
Andrei Lissovoi, Carsten Witt
Runtime analysis of ant colony optimization on dynamic shortest path problems. GECCO (2013)
Benjamin Doerr, Dirk Sudholt, Carsten Witt
When do evolutionary algorithms optimize separable functions in parallel? FOGA (2013)
Frank Neumann, Carsten Witt
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. GECCO (Companion) (2013)
Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intell. 6 (1) (2012)
Carsten Witt
Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. STACS (2012)
Pietro S. Oliveto, Carsten Witt
On the analysis of the simple genetic algorithm. GECCO (2012)

Carsten Witt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Carsten Witt