Dirk Sudholt

Dirk Sudholt

Universität Passau

H-index: 36

Europe-Germany

About Dirk Sudholt

Dirk Sudholt, With an exceptional h-index of 36 and a recent h-index of 23 (since 2020), a distinguished researcher at Universität Passau, specializes in the field of Theory of nature-inspired algorithms, randomised algorithms, natural computation, evolutionary computation.

His recent articles reflect a diverse array of research interests and contributions to the field:

Runtime Analyses of NSGA-III on Many-Objective Problems

A Tight Runtime Bound for a (+1) GA on Jump for Realistic Crossover Probabilities

Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation

The Cost of Randomness in Evolutionary Algorithms: Crossover can Save Random Bits

Analysing the robustness of NSGA-II under noise

Do additional target points speed up evolutionary algorithms?

Runtime analysis of quality diversity algorithms

Comma selection outperforms plus selection on OneMax with randomly planted optima

Dirk Sudholt Information

University

Position

Germany

Citations(all)

3902

Citations(since 2020)

1966

Cited By

2848

hIndex(all)

36

hIndex(since 2020)

23

i10Index(all)

101

i10Index(since 2020)

62

Email

University Profile Page

Universität Passau

Google Scholar

View Google Scholar Profile

Dirk Sudholt Skills & Research Interests

Theory of nature-inspired algorithms

randomised algorithms

natural computation

evolutionary computation

Top articles of Dirk Sudholt

Title

Journal

Author(s)

Publication Date

Runtime Analyses of NSGA-III on Many-Objective Problems

arXiv preprint arXiv:2404.11433

Andre Opris

Duc-Cuong Dang

Dirk Sudholt

2024/4/17

A Tight Runtime Bound for a (+1) GA on Jump for Realistic Crossover Probabilities

arXiv preprint arXiv:2404.07061

Andre Opris

Johannes Lengler

Dirk Sudholt

2024/4/10

Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation

Artificial Intelligence

Duc-Cuong Dang

Andre Opris

Dirk Sudholt

2024/2/27

The Cost of Randomness in Evolutionary Algorithms: Crossover can Save Random Bits

Carlo Kneissl

Dirk Sudholt

2023/3/31

Analysing the robustness of NSGA-II under noise

Duc-Cuong Dang

Andre Opris

Bahare Salehi

Dirk Sudholt

2023/7/15

Do additional target points speed up evolutionary algorithms?

Theoretical Computer Science

Jakob Bossek

Dirk Sudholt

2023/3/16

Runtime analysis of quality diversity algorithms

Jakob Bossek

Dirk Sudholt

2023/7/15

Comma selection outperforms plus selection on OneMax with randomly planted optima

Joost Jorritsma

Johannes Lengler

Dirk Sudholt

2023/7/15

Theoretical and empirical analysis of parameter control mechanisms in the (1+(λ, λ)) genetic algorithm

ACM Transactions on Evolutionary Learning

Mario Alejandro Hevia Fajardo

Dirk Sudholt

2023/1/14

Analysing Equilibrium States for Population Diversity

Johannes Lengler

Andre Opris

Dirk Sudholt

2023/7/15

A proof that using crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation

Proceedings of the AAAI Conference on Artificial Intelligence

Duc-Cuong Dang

Andre Opris

Bahare Salehi

Dirk Sudholt

2023/6/26

Hard problems are easier for success-based parameter control

Mario Alejandro Hevia Fajardo

Dirk Sudholt

2022/7/8

The compact genetic algorithm struggles on Cliff functions

Frank Neumann

Dirk Sudholt

Carsten Witt

2022/7/8

Tight bounds on the expected runtime of a standard steady state genetic algorithm

Algorithmica

Pietro S Oliveto

Dirk Sudholt

Carsten Witt

2022/6/1

Runtime analysis of restricted tournament selection for bimodal optimisation

Evolutionary Computation

Edgar Covantes Osuna

Dirk Sudholt

2022/3/1

Evolutionary algorithms for cardinality-constrained Ising models

Vijay Dhanjibhai Bhuva

Duc-Cuong Dang

Liam Huber

Dirk Sudholt

2022/8/15

On the impact of the performance metric on efficient algorithm configuration

Artificial Intelligence

George T Hall

Pietro S Oliveto

Dirk Sudholt

2022/2/1

Theory and practice of population diversity in evolutionary computation

Dirk Sudholt

Giovanni Squillero

2022/7/9

Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem

Algorithmica

Jakob Bossek

Frank Neumann

Pan Peng

Dirk Sudholt

2021/10

Editor’s Note: Special Issue on Genetic and Evolutionary Computation

Algorithmica

Multiplicative Up-Drift

Benjamin Doerr

Timo Kötzing

Carola Doerr Doerr

Johannes Lengler

...

2021

See List of Professors in Dirk Sudholt University(Universität Passau)

Co-Authors

H-index: 41
Carsten Witt

Carsten Witt

Danmarks Tekniske Universitet

H-index: 34
Thomas Jansen

Thomas Jansen

Aberystwyth University

H-index: 30
Per Kristian Lehre

Per Kristian Lehre

University of Birmingham

H-index: 25
Andrew M. Sutton

Andrew M. Sutton

University of Minnesota-Twin Cities

H-index: 21
Christine Zarges

Christine Zarges

Aberystwyth University

H-index: 21
Duc-Cuong Dang

Duc-Cuong Dang

University of Southampton

academic-engine