Benjamin Doerr

25 papers · 2020–2026 · 3 conferences · across top CS/AI conferences

Achievements

🏃 Academic Marathon (5) 🧭 Keyword Pioneer 🐝 Cross-Pollinator (11) 🗺️ Taxonomy Completionist (13) 🌉 Interdisciplinary Bridge 🐣 Hot Topic Early Bird 🌍 Conference Polyglot (3) 🤝 Dynamic Duo (10) 🧬 Topic Evolution 🏆 Keyword Champion (2) 🔬 Deep Specialist (13) 🔥 Unstoppable (6) ⚡ Prolific Year (10) 💎 Century Club (23) ❓ The Questioner 📈 Trend Setter 🗃️ Keyword Collector (56)

Conferences

AAAI (14) IJCAI (10) JMLR (1)

Top co-authors

Weijie Zheng (10) Martin S. Krejca (6) Mingfeng Li (2) Simon Wietheger (2) Renzhong Deng (2) Zhongdi Qu (2) Aymen Echarghaoui (1) Ulysse Hennebelle (1) Günter Rudolph (1) Sacha Cerf (1)

Keywords

evolutionary algorithm (21) runtime analysis (17) multi-objective optimization (16) pareto front (15) genetic algorithm (6) population dynamics (4) approximation guarantee (2) population size (2) local optima (2) crossover operator (2) noise robustness (2) metropolis algorithm (2) runtime guarantee (2) chance constraint (1) chernoff bound (1) lower bound (1) boolean function (1) markov chain (1) stochastic optimization (1) approximation algorithm (1)

Papers

Superior Runtime Guarantees for the MOEA/D Multi-Objective Optimizer via Weighted-Sum Decomposition AAAI 2026

Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer AAAI 2026

Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy IJCAI 2025

Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces AAAI 2025

Speeding Up the NSGA-II with a Simple Tie-Breaking Rule AAAI 2025

(1+1) Genetic Programming with Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error AAAI 2025

From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms (Journal Track) AAAI 2025

Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II IJCAI 2025

Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It IJCAI 2025

Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator IJCAI 2025

The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III) IJCAI 2025

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm IJCAI 2025

Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations AAAI 2024

Runtime Analysis of the SMS-EMOA for Many-Objective Optimization AAAI 2024

How to Use the Metropolis Algorithm for Multi-Objective Optimization? AAAI 2024

The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem IJCAI 2023

Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise IJCAI 2023

A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III) IJCAI 2023

From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms JMLR 2023

Runtime Analysis for the NSGA-II: Provable Speed-Ups from Crossover AAAI 2023

From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds AAAI 2023

A First Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) AAAI 2022

Choosing the Right Algorithm With Hints From Complexity Theory IJCAI 2021

Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives AAAI 2021

Optimization of Chance-Constrained Submodular Functions AAAI 2020