Carsten Witt - RankMe

192 papers A* 3A 53B 7C 1Journal 92Unranked 28

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive. Algorithmica Martin S. Krejca, Carsten Witt
2026	B	`conf`	A Self-adjusting Compact Genetic Algorithm. EvoCOP Sumit Adak, Carsten Witt
2026	J	`jnl`	Mathematical runtime analysis of a multi-Valued estimation of distribution algorithm. Artif. Intell. Sumit Adak, Carsten Witt
2026	A*	`conf`	Theoretical and Empirical Analysis of Lehmer Codes to Search Permutation Spaces with Evolutionary Algorithms. AAAI Yuxuan Ma, Valentino Santucci, Carsten Witt
2025	J	`jnl`	A Runtime Analysis of the Multi-Valued Compact Genetic Algorithm on Generalized LeadingOnes. CoRR Sumit Adak, Carsten Witt
2025	—	`conf`	A Runtime Analysis of the Multi-valued Compact Genetic Algorithm on Generalized LeadingOnes. EvoCOP@EvoStar Sumit Adak, Carsten Witt
2025	J	`jnl`	Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 25092). Dagstuhl Reports Josu Ceberio Uribe, Benjamin Doerr, John A. W. McCall, Carsten Witt, Marcus Schmidbauer
2025	A	`conf`	Improved Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Two Generalized OneMax Problems. GECCO Sumit Adak, Carsten Witt
2025	J	`jnl`	Improved Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Two Generalized OneMax Problems. CoRR Sumit Adak, Carsten Witt
2025	A	`conf`	Population Dynamics and Improved Runtime Guarantees for the (μ+1) EA on BinVal. FOGA Martin S. Krejca, Frank Neumann, Carsten Witt
2025	J	`jnl`	Runtime Analysis of Single- and Multiobjective Evolutionary Algorithms for Chance-Constrained Optimization Problems with Normally Distributed Random Variables. Evol. Comput. Frank Neumann, Carsten Witt
2025	A	`conf`	Runtime Analysis of a Compact Genetic Algorithm with High Selection Pressure. FOGA Sumit Adak, Carsten Witt
2025	J	`jnl`	The Compact Genetic Algorithm Struggles on Cliff Functions. Algorithmica Frank Neumann, Dirk Sudholt, Carsten Witt
2025	J	`jnl`	Theoretical and Empirical Analysis of Lehmer Codes to Search Permutation Spaces with Evolutionary Algorithms. CoRR Yuxuan Ma, Valentino Santucci, Carsten Witt
2024	J	`jnl`	A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive. CoRR Martin S. Krejca, Carsten Witt
2024	A	`conf`	A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive. GECCO Martin S. Krejca, Carsten Witt
2024	A	`conf`	A Runtime Analysis of Bias-invariant Neuroevolution and Dynamic Fitness Evaluation. GECCO Paul Fischer, John Alasdair Warwicker, Carsten Witt
2024	J	`jnl`	Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Generalized OneMax. CoRR Sumit Adak, Carsten Witt
2024	—	`conf`	Runtime Analysis of a Multi-valued Compact Genetic Algorithm on Generalized OneMax. PPSN (3) Sumit Adak, Carsten Witt
2024	J	`jnl`	Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Algorithmica Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
2024	—	`conf`	Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints. PPSN (3) Frank Neumann, Carsten Witt
2024	J	`jnl`	Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints. CoRR Frank Neumann, Carsten Witt
2024	J	`jnl`	Stagnation Detection in Highly Multimodal Fitness Landscapes. Algorithmica Amirhossein Rajabi, Carsten Witt
2023	A	`conf`	3-Objective Pareto Optimization for Problems with Chance Constraints. GECCO Frank Neumann, Carsten Witt
2023	J	`jnl`	3-Objective Pareto Optimization for Problems with Chance Constraints. CoRR Frank Neumann, Carsten Witt
2023	A	`conf`	Fast Pareto Optimization Using Sliding Window Selection. ECAI Frank Neumann, Carsten Witt
2023	J	`jnl`	Fast Pareto Optimization Using Sliding Window Selection. CoRR Frank Neumann, Carsten Witt
2023	A	`conf`	First Steps Towards a Runtime Analysis of Neuroevolution. FOGA Paul Fischer, Emil Lundt Larsen, Carsten Witt
2023	J	`jnl`	First Steps towards a Runtime Analysis of Neuroevolution. CoRR Paul Fischer, Emil Lundt Larsen, Carsten Witt
2023	A	`conf`	How Well Does the Metropolis Algorithm Cope With Local Optima? GECCO Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt
2023	J	`jnl`	How Well Does the Metropolis Algorithm Cope With Local Optima? CoRR Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt
2023	J	`jnl`	How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. Theor. Comput. Sci. Carsten Witt
2023	J	`jnl`	Stagnation Detection with Randomized Local Search. Evol. Comput. Amirhossein Rajabi, Carsten Witt
2022	J	`jnl`	Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182). Dagstuhl Reports Josu Ceberio Uribe, Benjamin Doerr, Carsten Witt, Vicente P. Soloviev
2022	A*	`conf`	Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. IJCAI Frank Neumann, Carsten Witt
2022	—	`conf`	Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions. PPSN (2) Frank Neumann, Carsten Witt
2022	J	`jnl`	Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions. CoRR Frank Neumann, Carsten Witt
2022	J	`jnl`	Self-Adjusting Evolutionary Algorithms for Multimodal Optimization. Algorithmica Amirhossein Rajabi, Carsten Witt
2022	J	`jnl`	Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. CoRR Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
2022	A	`conf`	Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. GECCO Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
2022	J	`jnl`	The Compact Genetic Algorithm Struggles on Cliff Functions. CoRR Frank Neumann, Dirk Sudholt, Carsten Witt
2022	A	`conf`	The compact genetic algorithm struggles on Cliff functions. GECCO Frank Neumann, Dirk Sudholt, Carsten Witt
2022	J	`jnl`	Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm. Algorithmica Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
2021	J	`jnl`	Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. Algorithmica Frank Neumann, Mojgan Pourhassan, Carsten Witt
2021	J	`jnl`	Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs. Algorithmica Andrew M. Sutton, Carsten Witt
2021	J	`jnl`	On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials Is Best. ACM Trans. Evol. Learn. Optim. Dogan Corus, Andrei Lissovoi, Pietro S. Oliveto, Carsten Witt
2021	J	`jnl`	On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials is Best. CoRR Dogan Corus, Andrei Lissovoi, Pietro S. Oliveto, Carsten Witt
2021	A	`conf`	On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms. FOGA Carsten Witt
2021	J	`jnl`	Runtime Analysis for Self-adaptive Mutation Rates. Algorithmica Benjamin Doerr, Carsten Witt, Jing Yang
2021	J	`jnl`	Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. CoRR Frank Neumann, Carsten Witt
2021	J	`jnl`	Stagnation Detection in Highly Multimodal Fitness Landscapes. CoRR Amirhossein Rajabi, Carsten Witt
2021	B	`conf`	Stagnation Detection with Randomized Local Search. EvoCOP Amirhossein Rajabi, Carsten Witt
2021	J	`jnl`	Stagnation Detection with Randomized Local Search. CoRR Amirhossein Rajabi, Carsten Witt
2021	A	`conf`	Stagnation detection in highly multimodal fitness landscapes. GECCO Amirhossein Rajabi, Carsten Witt
2021	J	`jnl`	Tail bounds on hitting times of randomized search heuristics using variable drift analysis. Comb. Probab. Comput. Per Kristian Lehre, Carsten Witt
2021	J	`jnl`	The Complex Parameter Landscape of the Compact Genetic Algorithm. Algorithmica Johannes Lengler, Dirk Sudholt, Carsten Witt
2020	A	`conf`	A tight lower bound on the expected runtime of standard steady state genetic algorithms. GECCO Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
2020	—	`conf`	Evolutionary Algorithms with Self-adjusting Asymmetric Mutation. PPSN (1) Amirhossein Rajabi, Carsten Witt
2020	J	`jnl`	Evolutionary Algorithms with Self-adjusting Asymmetric Mutation. CoRR Amirhossein Rajabi, Carsten Witt
2020	—	`conf`	Improved Fixed-Budget Results via Drift Analysis. PPSN (2) Timo Kötzing, Carsten Witt
2020	J	`jnl`	Improved Fixed-Budget Results via Drift Analysis. CoRR Timo Kötzing, Carsten Witt
2020	J	`jnl`	Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. CoRR Frank Neumann, Mojgan Pourhassan, Carsten Witt
2020	J	`jnl`	Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax. Theor. Comput. Sci. Martin S. Krejca, Carsten Witt
2020	J	`jnl`	Self-Adjusting Evolutionary Algorithms for Multimodal Optimization. CoRR Amirhossein Rajabi, Carsten Witt
2020	A	`conf`	Self-adjusting evolutionary algorithms for multimodal optimization. GECCO Amirhossein Rajabi, Carsten Witt
2020	—	`ch.`	Theory of Estimation-of-Distribution Algorithms. Theory of Evolutionary Computation Martin S. Krejca, Carsten Witt
2020	—	`conf`	Theory of estimation-of-distribution algorithms. GECCO Companion Carsten Witt
2019	A	`conf`	Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint. GECCO Frank Neumann, Mojgan Pourhassan, Carsten Witt
2019	A	`conf`	Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs. GECCO Andrew M. Sutton, Carsten Witt
2019	J	`jnl`	On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization. Algorithmica Dirk Sudholt, Carsten Witt
2019	J	`jnl`	Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools. CoRR Hsien-Kuei Hwang, Carsten Witt
2019	A	`conf`	Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools. FOGA Hsien-Kuei Hwang, Carsten Witt
2019	J	`jnl`	The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. Algorithmica Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang
2019	—	`conf`	Theory of estimation-of-distribution algorithms. GECCO (Companion) Carsten Witt
2019	J	`jnl`	Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax. Algorithmica Carsten Witt
2018	A	`conf`	Domino convergence: why one should hill-climb on linear functions. GECCO Carsten Witt
2018	A	`conf`	Medium step sizes are harmful for the compact genetic algorithm. GECCO Johannes Lengler, Dirk Sudholt, Carsten Witt
2018	J	`jnl`	Optimal Mutation Rates for the (1+λ) EA on OneMax Through Asymptotically Tight Drift Analysis. Algorithmica Christian Gießen, Carsten Witt
2018	J	`jnl`	Runtime Analysis for Self-adaptive Mutation Rates. CoRR Benjamin Doerr, Carsten Witt, Jing Yang
2018	A	`conf`	Runtime analysis for self-adaptive mutation rates. GECCO Benjamin Doerr, Carsten Witt, Jing Yang
2018	J	`jnl`	The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization. Algorithmica Andrei Lissovoi, Carsten Witt
2018	J	`jnl`	Theory of Estimation-of-Distribution Algorithms. CoRR Martin S. Krejca, Carsten Witt
2018	—	`conf`	Theory of estimation-of-distribution algorithms. GECCO (Companion) Carsten Witt
2017	J	`jnl`	A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization. Algorithmica Andrei Lissovoi, Carsten Witt
2017	J	`jnl`	Detecting structural breaks in time series via genetic algorithms. Soft Comput. Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt
2017	J	`jnl`	Edge-matching Problems with Rotations. CoRR Martin Ebbesen, Paul Fischer, Carsten Witt
2017	A	`conf`	Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax. FOGA Martin S. Krejca, Carsten Witt
2017	A	`ed.`	Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2017, Copenhagen, Denmark, January 12-15, 2017 FOGA Christian Igel, Dirk Sudholt, Carsten Witt
2017	A	`conf`	The (1+ GECCO Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang
2017	J	`jnl`	The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. CoRR Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang
2017	J	`jnl`	The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax. Algorithmica Christian Gießen, Carsten Witt
2017	J	`jnl`	Upper Bounds on the Runtime of the Univariate Marginal Distribution Algorithm on OneMax. CoRR Carsten Witt
2017	A	`conf`	Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax. GECCO Carsten Witt
2016	J	`jnl`	Guest Editorial: Theory of Evolutionary Computation. Algorithmica Benjamin Doerr, Carsten Witt
2016	J	`jnl`	MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions. Algorithmica Andrei Lissovoi, Carsten Witt
2016	A	`conf`	Optimal Mutation Rates for the (1+λ) EA on OneMax. GECCO Christian Gießen, Carsten Witt
2016	A	`conf`	The Impact of Migration Topology on the Runtime of Island Models in Dynamic Optimization. GECCO Andrei Lissovoi, Carsten Witt
2016	A	`conf`	Update Strength in EDAs and ACO: How to Avoid Genetic Drift. GECCO Dirk Sudholt, Carsten Witt
2016	J	`jnl`	Update Strength in EDAs and ACO: How to Avoid Genetic Drift. CoRR Dirk Sudholt, Carsten Witt
2015	A	`conf`	(1+1) EA on Generalized Dynamic OneMax. FOGA Timo Kötzing, Andrei Lissovoi, Carsten Witt
2015	J	`jnl`	Improved time complexity analysis of the Simple Genetic Algorithm. Theor. Comput. Sci. Pietro S. Oliveto, Carsten Witt
2015	A*	`conf`	On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling. IJCAI Frank Neumann, Carsten Witt
2015	J	`jnl`	On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling. CoRR Frank Neumann, Carsten Witt
2015	A	`conf`	On the Utility of Island Models in Dynamic Optimization. GECCO Andrei Lissovoi, Carsten Witt
2015	A	`conf`	Population Size vs. Mutation Strength for the (1+λ) EA on OneMax. GECCO Christian Gießen, Carsten Witt
2015	J	`jnl`	Runtime analysis of ant colony optimization on dynamic shortest path problems. Theor. Comput. Sci. Andrei Lissovoi, Carsten Witt
2014	—	`conf`	Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. GECCO (Companion) Carsten Witt
2014	B	`conf`	Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift. ISAAC Per Kristian Lehre, Carsten Witt
2014	J	`jnl`	Fitness levels with tail bounds for the analysis of randomized search heuristics. Inf. Process. Lett. Carsten Witt
2014	A	`conf`	MMAS vs. population-based EA on a family of dynamic fitness functions. GECCO Andrei Lissovoi, Carsten Witt
2014	J	`jnl`	On the runtime analysis of the Simple Genetic Algorithm. Theor. Comput. Sci. Pietro S. Oliveto, Carsten Witt
2014	A	`conf`	Revised analysis of the (1+1) ea for the minimum spanning tree problem. GECCO Carsten Witt
2013	A	`conf`	A method to derive fixed budget results from expected optimisation times. GECCO Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges
2013	—	`conf`	Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. GECCO (Companion) Frank Neumann, Carsten Witt
2013	—	`conf`	Evolutionary algorithms for the detection of structural breaks in time series: extended abstract. GECCO (Companion) Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt
2013	J	`jnl`	General Drift Analysis with Tail Bounds. CoRR Per Kristian Lehre, Carsten Witt
2013	A	`conf`	Improved runtime analysis of the simple genetic algorithm. GECCO Pietro S. Oliveto, Carsten Witt
2013	A	`conf`	Runtime analysis of ant colony optimization on dynamic shortest path problems. GECCO Andrei Lissovoi, Carsten Witt
2013	J	`jnl`	The Fitness Level Method with Tail Bounds. CoRR Carsten Witt
2013	J	`jnl`	Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions. Comb. Probab. Comput. Carsten Witt
2013	A	`conf`	When do evolutionary algorithms optimize separable functions in parallel? FOGA Benjamin Doerr, Dirk Sudholt, Carsten Witt
2012	J	`jnl`	Analysis of an iterated local search algorithm for vertex cover in sparse random graphs. Theor. Comput. Sci. Carsten Witt
2012	—	`conf`	Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. GECCO (Companion) Frank Neumann, Carsten Witt
2012	J	`jnl`	Black-Box Search by Unbiased Variation. Algorithmica Per Kristian Lehre, Carsten Witt
2012	J	`jnl`	Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. CoRR Pietro S. Oliveto, Carsten Witt
2012	A	`conf`	On the analysis of the simple genetic algorithm. GECCO Pietro S. Oliveto, Carsten Witt
2012	A	`conf`	Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. STACS Carsten Witt
2012	J	`jnl`	Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intell. Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
2012	J	`jnl`	Theory of Randomized Search Heuristics. Algorithmica Anne Auger, Carsten Witt
2011	B	`conf`	Edge-Matching Problems with Rotations. FCT Martin Ebbesen, Paul Fischer, Carsten Witt
2011	J	`jnl`	Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation CoRR Per Kristian Lehre, Carsten Witt
2011	J	`jnl`	Runtime analysis of the 1-ANT ant colony optimizer. Theor. Comput. Sci. Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt
2011	A	`conf`	Sharp bounds by probability-generating functions and variable drift. GECCO Benjamin Doerr, Mahmoud Fouz, Carsten Witt
2011	J	`jnl`	Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. Algorithmica Pietro S. Oliveto, Carsten Witt
2011	—	`ch.`	Theory of Particle Swarm Optimization. Theory of Randomized Search Heuristics Carsten Witt
2011	—	`conf`	Theory of randomized search heuristics in combinatorial optimization. GECCO (Companion) Carsten Witt
2011	J	`jnl`	Tight Bounds on the Optimization Time of the (1+1) EA on Linear Functions CoRR Carsten Witt
2010	—	`conf`	10361 Abstracts Collection and Executive Summary - Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms Anne Auger, Jonathan L. Shapiro, L. Darrell Whitley, Carsten Witt
2010	A	`conf`	A few ants are enough: ACO with iteration-best update. GECCO Frank Neumann, Dirk Sudholt, Carsten Witt
2010	J	`jnl`	Ant Colony Optimization and the minimum spanning tree problem. Theor. Comput. Sci. Frank Neumann, Carsten Witt
2010	J	`jnl`	Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Evol. Comput. Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2010	—	`book`	Bioinspired Computation in Combinatorial Optimization Bioinspired Computation in Combinatorial Optimization Frank Neumann, Carsten Witt
2010	J	`jnl`	Black-Box Search by Unbiased Variation. Electron. Colloquium Comput. Complex. Per Kristian Lehre, Carsten Witt
2010	A	`conf`	Black-box search by unbiased variation. GECCO Per Kristian Lehre, Carsten Witt
2010	A	`conf`	Quasirandom evolutionary algorithms. GECCO Benjamin Doerr, Mahmoud Fouz, Carsten Witt
2010	J	`jnl`	Runtime analysis of a binary particle swarm optimizer. Theor. Comput. Sci. Dirk Sudholt, Carsten Witt
2010	—	`conf`	Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. ANTS Conference Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
2010	—	`ed.`	Theory of Evolutionary Algorithms, 05.09. - 10.09.2010 Theory of Evolutionary Algorithms Anne Auger, Jonathan L. Shapiro, L. Darrell Whitley, Carsten Witt
2010	—	`conf`	Theory of randomised search heuristics in combinatorial optimisation. GECCO (Companion) Carsten Witt
2009	J	`jnl`	Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evol. Comput. Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2009	J	`jnl`	Analysis of Diversity-Preserving Mechanisms for Global Exploration. Evol. Comput. Tobias Friedrich, Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
2009	J	`jnl`	Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intell. Frank Neumann, Dirk Sudholt, Carsten Witt
2009	—	`ch.`	Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search. Innovations in Swarm Intelligence Frank Neumann, Dirk Sudholt, Carsten Witt
2009	C	`conf`	Greedy Local Search and Vertex Cover in Sparse Random Graphs. TAMC Carsten Witt
2009	J	`jnl`	Ingo Wegener. Evol. Comput. Thomas Jansen, Melanie Schmidt, Dirk Sudholt, Carsten Witt, Christine Zarges
2009	J	`jnl`	Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Algorithmica Frank Neumann, Carsten Witt
2009	A	`conf`	Theoretical analysis of fitness-proportional selection: landscapes and efficiency. GECCO Frank Neumann, Pietro S. Oliveto, Carsten Witt
2009	—	`conf`	Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. GECCO (Companion) Carsten Witt
2009	A	`conf`	Why standard particle swarm optimisers elude a theoretical runtime analysis. FOGA Carsten Witt
2008	—	`conf`	08051 Abstracts Collection - Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms Dirk V. Arnold, Anne Auger, Carsten Witt, Jonathan E. Rowe
2008	—	`conf`	08051 Executive Summary - Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms Dirk V. Arnold, Anne Auger, Jonathan E. Rowe, Carsten Witt
2008	J	`jnl`	Population size versus runtime of a simple evolutionary algorithm. Theor. Comput. Sci. Carsten Witt
2008	—	`conf`	Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. ANTS Conference Frank Neumann, Dirk Sudholt, Carsten Witt
2008	—	`conf`	Runtime Analysis of Binary PSO. Theory of Evolutionary Algorithms Dirk Sudholt, Carsten Witt
2008	A	`conf`	Runtime analysis of binary PSO. GECCO Dirk Sudholt, Carsten Witt
2008	A	`conf`	Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. PPSN Pietro S. Oliveto, Carsten Witt
2008	A	`conf`	Theoretical analysis of diversity mechanisms for global exploration. GECCO Tobias Friedrich, Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
2008	—	`ed.`	Theory of Evolutionary Algorithms, 27.01. - 01.02.2008 Theory of Evolutionary Algorithms Dirk V. Arnold, Anne Auger, Jonathan E. Rowe, Carsten Witt
2008	—	`conf`	Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view. GECCO (Companion) Carsten Witt
2007	J	`jnl`	A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability. Evol. Comput. Jun He, Colin R. Reeves, Carsten Witt, Xin Yao
2007	—	`conf`	Ant Colony Optimization and the Minimum Spanning Tree Problem. LION Frank Neumann, Carsten Witt
2007	J	`jnl`	Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Electron. Colloquium Comput. Complex. Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2007	A	`conf`	Approximating covering problems by randomized search heuristics using multi-objective models. GECCO Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt
2007	J	`jnl`	Collaborative Research Centre 531: Computational Intelligence - Theory and Practice (Sonderforschungsbereich 531: Computational Intelligence - Theorie und Praxis). it Inf. Technol. Jörn Mehnen, Thomas Michelitsch, Carsten Witt
2007	—	`conf`	Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. SLS Frank Neumann, Dirk Sudholt, Carsten Witt
2007	B	`conf`	On improving approximate solutions by evolutionary algorithms. IEEE Congress on Evolutionary Computation Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2007	A	`conf`	On the runtime analysis of the 1-ANT ACO algorithm. GECCO Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt
2006	J	`jnl`	Ant Colony Optimization and the Minimum Spanning Tree Problem. Electron. Colloquium Comput. Complex. Frank Neumann, Carsten Witt
2006	—	`conf`	Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Theory of Evolutionary Algorithms Frank Neumann, Carsten Witt
2006	B	`conf`	Runtime Analysis of a Simple Ant Colony Optimization Algorithm. ISAAC Frank Neumann, Carsten Witt
2006	J	`jnl`	Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Electron. Colloquium Comput. Complex. Frank Neumann, Carsten Witt
2006	J	`jnl`	Runtime Analysis of the (mu + 1) EA on Simple Pseudo-Boolean Functions. Evol. Comput. Carsten Witt
2005	J	`jnl`	On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. Comb. Probab. Comput. Ingo Wegener, Carsten Witt
2005	J	`jnl`	On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. J. Discrete Algorithms Ingo Wegener, Carsten Witt
2005	A	`conf`	Rigorous runtime analysis of a (µ+1)ES for the sphere function. GECCO Jens Jägersküpper, Carsten Witt
2005	A	`conf`	Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. STACS Carsten Witt
2004	—	`conf`	An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions. GECCO (1) Carsten Witt
2004	—	`ch.`	Über die Analyse randomisierter Suchheuristiken und den Entwurf spezialisierter Algorithmen im Bereich der kombinatorischen Optimierung. Ausgezeichnete Informatikdissertationen Carsten Witt
2004	—	`—`	Über die Analyse randomisierter Suchheuristiken und den Entwurf spezialisierter Algorithmen im Bereich der kombinatorischen Optimierung. Carsten Witt
2003	A	`conf`	On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. GECCO Ingo Wegener, Carsten Witt
2003	B	`conf`	Population size vs. runtime of a simple EA. IEEE Congress on Evolutionary Computation Carsten Witt
2001	—	`conf`	Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. RANDOM-APPROX Susanne Albers, Carsten Witt