Benjamin Doerr

Venues

Frequent coauthors

Papers

1. Hot of the Press: Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
   GECCO 2026 · Benjamin Doerr
2. Hot off the Press: Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It
   GECCO 2026 ·

   Denis Antipov

   DBLP profile ↗ORCID search ↗
3. Hot off the Press: Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
   GECCO 2026 · Benjamin Doerr
4. Hot off the Press: Proven Approximation Superiority of SPEA2 over NSGA-II
   GECCO 2026 ·

   Yasser Alghouass

   DBLP profile ↗ORCID search ↗
5. Hot off the Press: Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy
   GECCO 2026 ·

   Mingfeng Li

   DBLP profile ↗ORCID search ↗
6. Hot off the Press: Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator
   GECCO 2026 ·

   Abderrahim Bendahi

   DBLP profile ↗ORCID search ↗
7. Hot off the Press: Superior Runtime Guarantees for the MOEA/D Multi-Objective Optimizer via Weighted-Sum Decomposition
   GECCO 2026 ·

   Danyang Zhang

   DBLP profile ↗ORCID search ↗
8. Hot off the Press: The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
   GECCO 2026 ·

   Renzhong Deng

   DBLP profile ↗ORCID search ↗
9. Hot off the Press: The Runtime of Randomized Local Search on the Generalized Needle Problem
   GECCO 2026 · Benjamin Doerr
10. Hot off the Press: Why Popular MOEAs Are Popular: Proven Advantages in Approximating the Pareto Front
    GECCO 2026 ·

    Mingfeng Li

    DBLP profile ↗ORCID search ↗
11. Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
    AAAI 2026 · Benjamin Doerr
12. Superior Runtime Guarantees for the MOEA/D Multi-Objective Optimizer via Weighted-Sum Decomposition
    AAAI 2026 ·

    Danyang Zhang

    DBLP profile ↗ORCID search ↗
13. (1+1) Genetic Programming with Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error
    AAAI 2025 · Benjamin Doerr
14. Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It
    IJCAI 2025 ·

    Denis Antipov

    DBLP profile ↗ORCID search ↗
15. From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms (Journal Track)
    AAAI 2025 ·

    Weijie Zheng

    DBLP profile ↗ORCID search ↗
16. Hot off the Press: First Steps Towards a Runtime Analysis When Starting With a Good Solution
    GECCO 2025 ·

    Denis Antipov

    DBLP profile ↗ORCID search ↗
17. Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
    GECCO 2025 ·

    Simon Wietheger

    DBLP profile ↗ORCID search ↗
18. Hot off the Press: Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions
    GECCO 2025 · Benjamin Doerr
19. Hot off the Press: Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces
    GECCO 2025 · Benjamin Doerr
20. Hot off the Press: Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem
    GECCO 2025 ·

    Renzhong Deng

    DBLP profile ↗ORCID search ↗
21. Hot off the Press: Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark
    GECCO 2025 ·

    Marcel Chwialkowski

    DBLP profile ↗ORCID search ↗
22. Hot off the Press: Speeding Up the NSGA-II With a Simple Tie-Breaking Rule
    GECCO 2025 · Benjamin Doerr
23. Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
    IJCAI 2025 ·

    Yasser Alghouass

    DBLP profile ↗ORCID search ↗
24. Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces
    AAAI 2025 · Benjamin Doerr
25. Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy
    IJCAI 2025 ·

    Mingfeng Li

    DBLP profile ↗ORCID search ↗
26. Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator
    IJCAI 2025 ·

    Abderrahim Bendahi

    DBLP profile ↗ORCID search ↗
27. Speeding Up the NSGA-II with a Simple Tie-Breaking Rule
    AAAI 2025 · Benjamin Doerr
28. The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
    IJCAI 2025 ·

    Renzhong Deng

    DBLP profile ↗ORCID search ↗
29. Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
    IJCAI 2025 · Benjamin Doerr
30. Tutorial: A Gentle Introduction to Theory (for Non-Theoreticians)
    GECCO 2025 · Benjamin Doerr
31. Why Popular MOEAs Are Popular: Proven Advantages in Approximating the Pareto Front
    NeurIPS 2025 ·

    Mingfeng Li

    DBLP profile ↗ORCID search ↗
32. How to Use the Metropolis Algorithm for Multi-Objective Optimization?
    AAAI 2024 ·

    Weijie Zheng

    DBLP profile ↗ORCID search ↗
33. Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
    PPSN 2024 ·

    Simon Wietheger

    DBLP profile ↗ORCID search ↗
34. Proven Runtime Guarantees for How the MOEA/D: Computes the Pareto Front from the Subproblem Solutions
    PPSN 2024 · Benjamin Doerr
35. Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem
    PPSN 2024 ·

    Renzhong Deng

    DBLP profile ↗ORCID search ↗
36. Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations
    AAAI 2024 · Benjamin Doerr
37. Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
    AAAI 2024 ·

    Weijie Zheng

    DBLP profile ↗ORCID search ↗