Dirk Sudholt

According to our database1, Dirk Sudholt authored at least 121 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
On the benefits and risks of using fitness sharing for multimodal optimisation.
Theor. Comput. Sci., 2019

On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism.
Evolutionary Computation, 2019

On the Impact of the Cutoff Time on the Performance of Algorithm Configurators.
CoRR, 2019

Parallel Black-Box Complexity with Tail Bounds.
CoRR, 2019

On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization.
Algorithmica, 2019

On the Analysis of Trajectory-Based Search Algorithms: When is it Beneficial to Reject Improvements?
Algorithmica, 2019

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation.
Algorithmica, 2019

On the impact of the cutoff time on the performance of algorithm configurators.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Runtime analysis of randomized search heuristics for dynamic graph coloring.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

2018
Escaping Local Optima Using Crossover With Emergent Diversity.
IEEE Trans. Evolutionary Computation, 2018

Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial.
CoRR, 2018

Design and Analysis of Diversity-Based Parent Selection Schemes for Speeding Up Evolutionary Multi-objective Optimisation.
CoRR, 2018

Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems.
CoRR, 2018

Runtime Analysis of Probabilistic Crowding and Restricted Tournament Selection for Bimodal Optimisation.
CoRR, 2018

On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism.
CoRR, 2018

The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses.
CoRR, 2018

How to Escape Local Optima in Black Box Optimisation: When Non-elitism Outperforms Elitism.
Algorithmica, 2018

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation.
Algorithmica, 2018


Empirical Analysis of Diversity-Preserving Mechanisms on Example Landscapes for Multimodal Optimisation.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

On the robustness of evolutionary algorithms to noise: refined results and an example where noise helps.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Runtime analysis of probabilistic crowding and restricted tournament selection for bimodal optimisation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Memetic algorithms beat evolutionary algorithms on the class of hurdle problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Medium step sizes are harmful for the compact genetic algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017
How Crossover Speeds up Building Block Assembly in Genetic Algorithms.
Evolutionary Computation, 2017

Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
Evolutionary Computation, 2017

Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search.
Evolutionary Computation, 2017

Towards a Runtime Comparison of Natural and Artificial Evolution.
Algorithmica, 2017

On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation.
Algorithmica, 2017

Theory of swarm intelligence: tutorial at GECCO 2017.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Speeding up evolutionary multi-objective optimisation through diversity-based parent selection.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

When is it beneficial to reject improvements?
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Theoretical results on bet-and-run as an initialisation strategy.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Analysis of the Clearing Diversity-Preserving Mechanism.
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

2016
Update Strength in EDAs and ACO: How to Avoid Genetic Drift.
CoRR, 2016

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity.
CoRR, 2016


Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Update Strength in EDAs and ACO: How to Avoid Genetic Drift.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

When Non-Elitism Outperforms Elitism for Crossing Fitness Valleys.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Runtime Analysis for the Parameter-less Population Pyramid.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Escaping Local Optima with Diversity Mechanisms and Crossover.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

2015
Parallel Evolutionary Algorithms.
Proceedings of the Springer Handbook of Computational Intelligence, 2015

Design and analysis of different alternating variable searches for search-based software testing.
Theor. Comput. Sci., 2015

Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms.
Evolutionary Computation, 2015

First Steps Towards a Runtime Comparison of Natural and Artificial Evolution.
CoRR, 2015

First Steps Towards a Runtime Comparison of Natural and Artificial Evolution.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Black-box Complexity of Parallel Search with Distributed Populations.
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

2014
Improved Evolutionary Algorithm Design for the Project Scheduling Problem Based on Runtime Analysis.
IEEE Trans. Software Eng., 2014

The choice of the offspring population size in the (1, λ) evolutionary algorithm.
Theor. Comput. Sci., 2014

Analysis of speedups in parallel evolutionary algorithms and (1+λ) EAs for combinatorial optimization.
Theor. Comput. Sci., 2014

General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms.
Evolutionary Computation, 2014

How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms.
CoRR, 2014

On the Runtime Analysis of Fitness Sharing Mechanisms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Unbiased Black-Box Complexity of Parallel Search.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

On the runtime analysis of stochastic ageing mechanisms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

A fixed budget analysis of randomized search heuristics for the traveling salesperson problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Design and analysis of adaptive migration intervals in parallel evolutionary algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms.
IEEE Trans. Evolutionary Computation, 2013

Design and analysis of migration in parallel evolutionary algorithms.
Soft Comput., 2013

Mutation Rate Matters Even When Optimizing Monotonic Functions.
Evolutionary Computation, 2013

A theoretical runtime and empirical analysis of different alternating variable searches for search-based testing.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

When do evolutionary algorithms optimize separable functions in parallel?
Proceedings of the Foundations of Genetic Algorithms XII, 2013

2012
Parametrization and Balancing Local and Global Search.
Proceedings of the Handbook of Memetic Algorithms, 2012

Running time analysis of Ant Colony Optimization for shortest path problems.
J. Discrete Algorithms, 2012

General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms
CoRR, 2012

A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems.
Algorithmica, 2012

Homogeneous and Heterogeneous Island Models for the Set Cover Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

Crossover speeds up building-block assembly.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

The choice of the offspring population size in the (1, λ) EA.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Runtime analysis of convex evolutionary search.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
Runtime analysis of the 1-ANT ant colony optimizer.
Theor. Comput. Sci., 2011

Memetic Algorithms: Parametrization and Balancing Local and Global Search
CoRR, 2011

Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
CoRR, 2011

A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
CoRR, 2011

Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms
CoRR, 2011

Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima.
Algorithmica, 2011

Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract).
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Theory of swarm intelligence.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

On the effectiveness of crossover for migration in parallel evolutionary algorithms.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

How crossover helps in pseudo-boolean optimization.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Using markov-chain mixing time estimates for the analysis of ant colony optimization.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Adaptive population models for offspring populations and parallel evolutionary algorithms.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Simple max-min ant systems and the optimization of linear pseudo-boolean functions.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Memetic Evolutionary Algorithms.
Proceedings of the Theory of Randomized Search Heuristics: Foundations and Recent Developments., 2011

2010
Runtime analysis of a binary particle swarm optimizer.
Theor. Comput. Sci., 2010

A self-stabilizing algorithm for cut problems in synchronous networks.
Theor. Comput. Sci., 2010

Analysis of an Asymmetric Mutation Operator.
Evolutionary Computation, 2010

Optimizing Monotone Functions Can Be Difficult
CoRR, 2010

Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions
CoRR, 2010

General Lower Bounds for the Running Time of Evolutionary Algorithms.
Proceedings of the Parallel Problem Solving from Nature, 2010

General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms.
Proceedings of the Parallel Problem Solving from Nature, 2010

Experimental Supplements to the Theoretical Analysis of Migration in the Island Model.
Proceedings of the Parallel Problem Solving from Nature, 2010

Optimizing Monotone Functions Can Be Difficult.
Proceedings of the Parallel Problem Solving from Nature, 2010

Analysis of an Iterated Local Search Algorithm for Vertex Coloring.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A few ants are enough: ACO with iteration-best update.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

The benefit of migration in parallel evolutionary algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Ant colony optimization for stochastic shortest path problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009
Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search.
Proceedings of the Innovations in Swarm Intelligence, 2009

The impact of parametrization in memetic evolutionary algorithms.
Theor. Comput. Sci., 2009

Analysis of different MMAS ACO algorithms on unimodal functions and plateaus.
Swarm Intelligence, 2009

Ingo Wegener.
Evolutionary Computation, 2009

Analysis of Diversity-Preserving Mechanisms for Global Exploration.
Evolutionary Computation, 2009

Running Time Analysis of ACO Systems for Shortest Path Problems.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

2008
Computational complexity of evolutionary algorithms, hybridizations, and swarm intelligence.
PhD thesis, 2008

Self-stabilizing Cuts in Synchronous Networks.
Proceedings of the Structural Information and Communication Complexity, 2008

Runtime analysis of binary PSO.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Memetic algorithms with variable-depth search to overcome local optima.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Theoretical analysis of diversity mechanisms for global exploration.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2008

2007
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

On the runtime analysis of the 1-ANT ACO algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

2006
Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

On the analysis of the (1+1) memetic algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

2005
Crossover is provably essential for the ising model on trees.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Design and analysis of an asymmetric mutation operator.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2004
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.
Proceedings of the Parallel Problem Solving from Nature, 2004

Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.
Proceedings of the Parallel Problem Solving from Nature, 2004


  Loading...