| 2026 | AAAI | Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer. | Benjamin Doerr, Martin S. Krejca, Milan Stankovic |
| 2026 | AAAI | Superior Runtime Guarantees for the MOEA/D Multi-Objective Optimizer via Weighted-Sum Decomposition. | Danyang Zhang, Zerong Zhong, Weijie Zheng, Benjamin Doerr |
| 2026 | GECCO | Hot off the Press: Proven Approximation Superiority of SPEA2 over NSGA-II. | Yasser Alghouass, Benjamin Doerr, Martin S. Krejca, Mohammad Lagmah |
| 2026 | GECCO | Hot off the Press: Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It. | Denis Antipov, Benjamin Doerr |
| 2026 | GECCO | Hot off the Press: Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator. | Abderrahim Bendahi, Benjamin Doerr, Adrien Fradin, Johannes F. Lutzeyer |
| 2026 | GECCO | Hot off the Press: The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III). | Renzhong Deng, Weijie Zheng, Benjamin Doerr |
| 2026 | GECCO | Hot off the Press: The Runtime of Randomized Local Search on the Generalized Needle Problem. | Benjamin Doerr, Andrew James Kelley |
| 2026 | GECCO | Hot of the Press: Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm. | Benjamin Doerr, Martin S. Krejca, Andre Opris |
| 2026 | GECCO | Hot off the Press: Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer. | Benjamin Doerr, Martin S. Krejca, Milan Stankovic |
| 2026 | GECCO | Hot off the Press: Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy. | Mingfeng Li, Weijie Zheng, Benjamin Doerr |
| 2026 | GECCO | Hot off the Press: Why Popular MOEAs Are Popular: Proven Advantages in Approximating the Pareto Front. | Mingfeng Li, Qiang Zhang, Weijie Zheng, Benjamin Doerr |
| 2026 | GECCO | Hot off the Press: Superior Runtime Guarantees for the MOEA/D Multi-Objective Optimizer via Weighted-Sum Decomposition. | Danyang Zhang, Zerong Zhong, Weijie Zheng, Benjamin Doerr |
| 2025 | AAAI | From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms (Journal Track). | Weijie Zheng, Benjamin Doerr |
| 2025 | AAAI | Speeding Up the NSGA-II with a Simple Tie-Breaking Rule. | Benjamin Doerr, Tudor Ivan, Martin S. Krejca |
| 2025 | AAAI | Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces. | Benjamin Doerr, Martin S. Krejca, Gnter Rudolph |
| 2025 | AAAI | (1+1) Genetic Programming with Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error. | Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto |
| 2025 | GECCO | Hot off the Press: First Steps Towards a Runtime Analysis When Starting With a Good Solution. | Denis Antipov, Maxim Buzdalov, Benjamin Doerr |
| 2025 | GECCO | Hot off the Press: Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark. | Marcel Chwialkowski, Benjamin Doerr, Martin S. Krejca |
| 2025 | GECCO | Hot off the Press: Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem. | Renzhong Deng, Weijie Zheng, Mingfeng Li, Jie Liu, Benjamin Doerr |
| 2025 | GECCO | Tutorial: A Gentle Introduction to Theory (for Non-Theoreticians). | Benjamin Doerr |
| 2025 | GECCO | Hot off the Press: Speeding Up the NSGA-II With a Simple Tie-Breaking Rule. | Benjamin Doerr, Tudor Ivan, Martin S. Krejca |
| 2025 | GECCO | Hot off the Press: Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces. | Benjamin Doerr, Martin S. Krejca, Gnter Rudolph |
| 2025 | GECCO | Hot off the Press: Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions. | Benjamin Doerr, Martin S. Krejca, No Weeks |
| 2025 | GECCO | Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. | Simon Wietheger, Benjamin Doerr |
| 2025 | IJCAI | Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II. | Yasser Alghouass, Benjamin Doerr, Martin S. Krejca, Mohammed Lagmah |
| 2025 | IJCAI | Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It. | Denis Antipov, Benjamin Doerr |
| 2025 | IJCAI | Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator. | Abderrahim Bendahi, Benjamin Doerr, Adrien Fradin, Johannes F. Lutzeyer |
| 2025 | IJCAI | The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III). | Renzhong Deng, Weijie Zheng, Benjamin Doerr |
| 2025 | IJCAI | Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm. | Benjamin Doerr, Martin S. Krejca, Andre Opris |
| 2025 | IJCAI | Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy. | Mingfeng Li, Weijie Zheng, Benjamin Doerr |
| 2024 | AAAI | Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. | Weijie Zheng, Benjamin Doerr |
| 2024 | AAAI | How to Use the Metropolis Algorithm for Multi-Objective Optimization? | Weijie Zheng, Mingfeng Li, Renzhong Deng, Benjamin Doerr |
| 2024 | AAAI | Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations. | Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, Martin S. Krejca |
| 2024 | GECCO | Hot off the Press: Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives. | Weijie Zheng, Benjamin Doerr |
| 2024 | GECCO | Hot off the Press: Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. | Weijie Zheng, Benjamin Doerr |
| 2024 | GECCO | How to Use the Metropolis Algorithm for Multi-Objective Optimization? | Weijie Zheng, Mingfeng Li, Renzhong Deng, Benjamin Doerr |
| 2024 | GECCO | Already Moderate Population Sizes Provably Yield Strong Robustness to Noise. | Denis Antipov, Benjamin Doerr, Alexandra Ivanova |
| 2024 | GECCO | Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. | Sacha Cerf, Benjamin Doerr, Benjamin Hebras, Yakob Kahane, Simon Wietheger |
| 2024 | GECCO | Hot off the Press: Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. | Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle, Sebastian Will |
| 2024 | GECCO | A Gentle Introduction to Theory (for Non-Theoreticians). | Benjamin Doerr |
| 2024 | GECCO | Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations. | Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, Martin S. Krejca |
| 2024 | GECCO | A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. | Benjamin Doerr, Joshua D. Knowles, Aneta Neumann, Frank Neumann |
| 2024 | GECCO | Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics. | Benjamin Doerr, Martin S. Krejca, Nguyen Vu |
| 2024 | GECCO | A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). | Simon Wietheger, Benjamin Doerr |
| 2024 | PPSN | Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem. | Renzhong Deng, Weijie Zheng, Mingfeng Li, Jie Liu, Benjamin Doerr |
| 2024 | PPSN | Proven Runtime Guarantees for How the MOEA/D: Computes the Pareto Front from the Subproblem Solutions. | Benjamin Doerr, Martin S. Krejca, No Weeks |
| 2024 | PPSN | Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. | Simon Wietheger, Benjamin Doerr |
| 2023 | AAAI | Runtime Analysis for the NSGA-II: Provable Speed-Ups from Crossover. | Benjamin Doerr, Zhongdi Qu |
| 2023 | AAAI | From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. | Benjamin Doerr, Zhongdi Qu |
| 2023 | GECCO | A Gentle Introduction to Theory (for Non-Theoreticians). | Benjamin Doerr |
| 2023 | GECCO | How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs. | Benjamin Doerr, Arthur Dremaux, Johannes F. Lutzeyer, Aurlien Stumpf |
| 2023 | GECCO | How Well Does the Metropolis Algorithm Cope With Local Optima? | Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt |
| 2023 | GECCO | Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. | Benjamin Doerr, Andrew James Kelley |
| 2023 | GECCO | Hot off the Press: A First Runtime Analysis of the NSGA-II on a Multimodal Problem. | Benjamin Doerr, Zhongdi Qu |
| 2023 | GECCO | Hot off the Press: From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. | Benjamin Doerr, Zhongdi Qu |
| 2023 | GECCO | Hot off the Press: Runtime Analysis for the NSGA-II - Provable Speed-Ups From Crossover. | Benjamin Doerr, Zhongdi Qu |
| 2023 | GECCO | Larger Offspring Populations Help the (1 + (λ, λlambda)) Genetic Algorithm to Overcome the Noise. | Alexandra Ivanova, Denis Antipov, Benjamin Doerr |
| 2023 | GECCO | Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables. | Firas Ben Jedidia, Benjamin Doerr, Martin S. Krejca |
| 2023 | IJCAI | The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. | Sacha Cerf, Benjamin Doerr, Benjamin Hebras, Yakob Kahane, Simon Wietheger |
| 2023 | IJCAI | Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. | Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle, Sebastian Will |
| 2023 | IJCAI | A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). | Simon Wietheger, Benjamin Doerr |
| 2022 | AAAI | A First Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II). | Weijie Zheng, Yufei Liu, Benjamin Doerr |
| 2022 | GECCO | Better approximation guarantees for the NSGA-II by using the current crowding distance. | Weijie Zheng, Benjamin Doerr |
| 2022 | GECCO | A first mathematical runtime analysis of the non-dominated sorting genetic algorithm II (NSGA-II): (hot-off-the-press track at GECCO 2022). | Weijie Zheng, Yufei Liu, Benjamin Doerr |
| 2022 | GECCO | Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022). | Denis Antipov, Benjamin Doerr |
| 2022 | GECCO | A gentle introduction to theory (for non-theoreticians). | Benjamin Doerr |
| 2022 | GECCO | Towards a stronger theory for permutation-based evolutionary algorithms. | Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim |
| 2022 | GECCO | The (1 + (λ, λ)) global SEMO algorithm. | Benjamin Doerr, Omar El Hadri, Adrien Pinard |
| 2022 | GECCO | Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. | Benjamin Doerr, Amirhossein Rajabi, Carsten Witt |
| 2022 | GECCO | Automated algorithm selection for radar network configuration. | Quentin Renau, Johann Dro, Alain Peres, Yann Semet, Carola Doerr, Benjamin Doerr |
| 2022 | GECCO | Choosing the right algorithm with hints from complexity theory: (hot-off-the-press track at GECCO 2022). | Shouda Wang, Weijie Zheng, Benjamin Doerr |
| 2022 | PPSN | General Univariate Estimation-of-Distribution Algorithms. | Benjamin Doerr, Marc Dufay |
| 2022 | PPSN | A First Runtime Analysis of the NSGA-II on a Multimodal Problem. | Benjamin Doerr, Zhongdi Qu |
| 2021 | AAAI | Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives. | Benjamin Doerr, Weijie Zheng |
| 2021 | GECCO | Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. | Denis Antipov, Maxim Buzdalov, Benjamin Doerr |
| 2021 | GECCO | Generalized jump functions. | Henry Bambury, Antoine Bultel, Benjamin Doerr |
| 2021 | GECCO | A rigorous runtime analysis of the 2-MMAS | Riade Benbaki, Ziyad Benomar, Benjamin Doerr |
| 2021 | GECCO | Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives: (hot-off-the-press track at GECCO 2021). | Benjamin Doerr, Weijie Zheng |
| 2021 | GECCO | Runtime analysis via symmetry arguments: (hot-off-the-press track at GECCO 2021). | Benjamin Doerr |
| 2021 | GECCO | A gentle introduction to theory (for non-theoreticians). | Benjamin Doerr |
| 2021 | GECCO | Lower bounds from fitness levels made easy. | Benjamin Doerr, Timo Ktzing |
| 2021 | IJCAI | Choosing the Right Algorithm With Hints From Complexity Theory. | Shouda Wang, Weijie Zheng, Benjamin Doerr |
| 2020 | AAAI | Optimization of Chance-Constrained Submodular Functions. | Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton |
| 2020 | GECCO | Fast mutation in crossover-based algorithms. | Denis Antipov, Maxim Buzdalov, Benjamin Doerr |
| 2020 | GECCO | The (1 + ( | Denis Antipov, Benjamin Doerr, Vitalii Karavaev |
| 2020 | GECCO | Fixed-target runtime analysis. | Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov |
| 2020 | GECCO | A gentle introduction to theory (for non-theoreticians). | Benjamin Doerr |
| 2020 | GECCO | Does comma selection help to cope with local optima? | Benjamin Doerr |
| 2020 | GECCO | The univariate marginal distribution algorithm copes well with deception and epistasis. | Benjamin Doerr, Martin S. Krejca |
| 2020 | GECCO | Bivariate estimation-of-distribution algorithms can find an exponential number of optima. | Benjamin Doerr, Martin S. Krejca |
| 2020 | GECCO | Sharp bounds for genetic drift in estimation of distribution algorithms (Hot-off-the-press track at GECCO 2020). | Benjamin Doerr, Weijie Zheng |
| 2020 | GECCO | From understanding genetic drift to a smart-restart parameter-less compact genetic algorithm. | Benjamin Doerr, Weijie Zheng |
| 2020 | PPSN | First Steps Towards a Runtime Analysis When Starting with a Good Solution. | Denis Antipov, Maxim Buzdalov, Benjamin Doerr |
| 2020 | PPSN | Runtime Analysis of a Heavy-Tailed (1+(λ , λ )) Genetic Algorithm on Jump Functions. | Denis Antipov, Benjamin Doerr |
| 2020 | PPSN | Lower Bounds for Non-elitist Evolutionary Algorithms via Negative Multiplicative Drift. | Benjamin Doerr |
| 2020 | PPSN | Exponential Upper Bounds for the Runtime of Randomized Search Heuristics. | Benjamin Doerr |
| 2020 | PPSN | Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy. | Quentin Renau, Carola Doerr, Johann Dro, Benjamin Doerr |
| 2019 | FOGA | A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones. | Denis Antipov, Benjamin Doerr, Vitalii Karavaev |
| 2019 | FOGA | An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. | Benjamin Doerr |
| 2019 | GECCO | The efficiency threshold for the offspring population size of the ( | Denis Antipov, Benjamin Doerr, Quentin Yang |
| 2019 | GECCO | A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost. | Benjamin Doerr |
| 2019 | GECCO | Theory for non-theoreticians: introductory tutorial. | Benjamin Doerr |
| 2019 | GECCO | Fast re-optimization via structural diversity. | Benjamin Doerr, Carola Doerr, Frank Neumann |
| 2019 | GECCO | Self-adjusting mutation rates with provably optimal success rules. | Benjamin Doerr, Carola Doerr, Johannes Lengler |
| 2019 | GECCO | Multiplicative up-drift. | Benjamin Doerr, Timo Ktzing |
| 2019 | GECCO | Evolving boolean functions with conjunctions and disjunctions via genetic programming. | Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto |
| 2019 | GECCO | When resampling to cope with noise, use median, not mean. | Benjamin Doerr, Andrew M. Sutton |
| 2019 | GECCO | Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem. | Vitalii Karavaev, Denis Antipov, Benjamin Doerr |
| 2019 | GECCO | Expressiveness and robustness of landscape features. | Quentin Renau, Johann Dro, Carola Doerr, Benjamin Doerr |
| 2019 | GECCO | Fixed-target runtime analysis of the (1 + 1) EA with resampling. | Dmitry Vinokurov, Maxim Buzdalov, Arina Buzdalova, Benjamin Doerr, Carola Doerr |
| 2018 | GECCO | A tight runtime analysis for the (μ + λ) EA. | Denis Antipov, Benjamin Doerr, Jiefeng Fang, Tangi Hetet |
| 2018 | GECCO | A new analysis method for evolutionary optimization of dynamic and noisy objective functions. | Raphal Dang-Nhu, Thibault Dardinier, Benjamin Doerr, Gautier Izacard, Dorian Nogneng |
| 2018 | GECCO | Better runtime guarantees via stochastic domination (hot-off-the-press track at GECCO 2018). | Benjamin Doerr |
| 2018 | GECCO | Theory for non-theoreticians: tutorial. | Benjamin Doerr |
| 2018 | GECCO | Significance-based estimation-of-distribution algorithms. | Benjamin Doerr, Martin S. Krejca |
| 2018 | GECCO | On the runtime analysis of selection hyper-heuristics with adaptive learning periods. | Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker |
| 2018 | GECCO | Runtime analysis for self-adaptive mutation rates. | Benjamin Doerr, Carsten Witt, Jing Yang |
| 2018 | GECCO | Working principles of binary differential evolution. | Weijie Zheng, Guangwen Yang, Benjamin Doerr |
| 2018 | PPSN | Precise Runtime Analysis for Plateaus. | Denis Antipov, Benjamin Doerr |
| 2017 | GECCO | Runtime analysis of the (1 + ( | Maxim Buzdalov, Benjamin Doerr |
| 2017 | GECCO | The unrestricted black-box complexity of jump functions. | Maxim Buzdalov, Benjamin Doerr, Mikhail Kever |
| 2017 | GECCO | Theory for non-theoreticians. | Benjamin Doerr |
| 2017 | GECCO | Unknown solution length problems with no asymptotically optimal run time. | Benjamin Doerr, Carola Doerr, Timo Ktzing |
| 2017 | GECCO | Island models meet rumor spreading. | Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Ktzing, Martin Schirneck |
| 2017 | GECCO | The (1+ | Benjamin Doerr, Christian Gieen, Carsten Witt, Jing Yang |
| 2017 | GECCO | Bounding bloat in genetic programming. | Benjamin Doerr, Timo Ktzing, J. A. Gregor Lagodzinski, Johannes Lengler |
| 2017 | GECCO | Fast genetic algorithms. | Benjamin Doerr, Huu Phuoc Le, Rgis Makhmara, Ta Duy Nguyen |
| 2017 | ICALP | Randomized Rumor Spreading Revisited. | Benjamin Doerr, Anatolii Kostrygin |
| 2016 | GECCO | Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm. | Benjamin Doerr |
| 2016 | GECCO | Theory for Non-Theoreticians. | Benjamin Doerr, Carola Doerr |
| 2016 | GECCO | The Right Mutation Strength for Multi-Valued Decision Variables. | Benjamin Doerr, Carola Doerr, Timo Ktzing |
| 2016 | GECCO | Optimal Parameter Choices via Precise Black-Box Analysis. | Benjamin Doerr, Carola Doerr, Jing Yang |
| 2016 | GECCO | Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax. | Benjamin Doerr, Wanru Gao, Frank Neumann |
| 2016 | ICALP | Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. | Benjamin Doerr, Marvin Knnemann |
| 2016 | PPSN | Tutorials at PPSN 2016. | Carola Doerr, Nicolas Bredche, Enrique Alba, Thomas Bartz-Beielstein, Dimo Brockhoff, Benjamin Doerr, Gusz Eiben, Michael G. Epitropakis, Carlos M. Fonseca, Andreia P. Guerreiro, Evert Haasdijk, Jacqueline Heinerman, Julien Hubert, Per Kristian Lehre, Luigi Malag, Juan Julin Merelo Guervs, Julian Francis Miller, Boris Naujoks, Pietro S. Oliveto, Stjepan Picek, Nelishia Pillay, Mike Preuss, Patricia Ryser-Welch, Giovanni Squillero, Jrg Stork, Dirk Sudholt, Alberto Paolo Tonda, L. Darrell Whitley, Martin Zaefferer |
| 2016 | PPSN | Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables. | Benjamin Doerr, Carola Doerr, Timo Ktzing |
| 2016 | PPSN | k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation. | Benjamin Doerr, Carola Doerr, Jing Yang |
| 2015 | GECCO | Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings. | Benjamin Doerr, Carola Doerr |
| 2015 | GECCO | A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax. | Benjamin Doerr, Carola Doerr |
| 2015 | GECCO | Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. | Benjamin Doerr, Carola Doerr, Timo Ktzing |
| 2015 | GECCO | Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. | Benjamin Doerr, Frank Neumann, Andrew M. Sutton |
| 2015 | GECCO | Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization. | Axel de Perthuis de Laillevault, Benjamin Doerr, Carola Doerr |
| 2014 | GECCO | Monotonic functions in EC: anything but monotone! | Sylvain Colin, Benjamin Doerr, Gaspard Frey |
| 2014 | GECCO | The impact of random initialization on the runtime of randomized search heuristics. | Benjamin Doerr, Carola Doerr |
| 2014 | GECCO | Black-box complexity: from complexity theory to playing mastermind. | Benjamin Doerr, Carola Doerr |
| 2014 | GECCO | Unbiased black-box complexities of jump functions: how to cross large plateaus. | Benjamin Doerr, Carola Doerr, Timo Ktzing |
| 2013 | CEC | Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations. | Benjamin Doerr, Marvin Knnemann |
| 2013 | CEC | Lower bounds for the runtime of a global multi-objective evolutionary algorithm. | Benjamin Doerr, Bojana Kodric, Marco Voigt |
| 2013 | FOGA | When do evolutionary algorithms optimize separable functions in parallel? | Benjamin Doerr, Dirk Sudholt, Carsten Witt |
| 2013 | GECCO | Black-box complexity: from complexity theory to playing mastermind. | Benjamin Doerr, Carola Doerr |
| 2013 | GECCO | Lessons from the black-box: fast crossover-based genetic algorithms. | Benjamin Doerr, Carola Doerr, Franziska Ebel |
| 2013 | GECCO | Evolutionary algorithms for the detection of structural breaks in time series: extended abstract. | Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt |
| 2013 | GECCO | A method to derive fixed budget results from expected optimisation times. | Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges |
| 2013 | GECCO | How the (1+λ) evolutionary algorithm optimizes linear functions. | Benjamin Doerr, Marvin Knnemann |
| 2013 | ICALP | Online Checkpointing with Improved Worst-Case Guarantees. | Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan |
| 2013 | SODA | Playing Mastermind with Many Colors. | Benjamin Doerr, Reto Sphel, Henning Thomas, Carola Winzen |
| 2012 | GECCO | Black-box complexity: from complexity theory to playing mastermind. | Benjamin Doerr |
| 2012 | GECCO | Ants easily solve stochastic shortest path problems. | Benjamin Doerr, Ashish Ranjan Hota, Timo Ktzing |
| 2012 | GECCO | Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet. | Benjamin Doerr, Sebastian Pohl |
| 2012 | GECCO | Reducing the arity in unbiased black-box complexity. | Benjamin Doerr, Carola Winzen |
| 2012 | STACS | Playing Mastermind With Constant-Size Memory. | Benjamin Doerr, Carola Winzen |
| 2011 | ALENEX | Dependent Randomized Rounding: The Bipartite Case. | Benjamin Doerr, Marvin Knnemann, Magnus Wahlstrm |
| 2011 | CSR | Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. | Benjamin Doerr, Carola Winzen |
| 2011 | FOGA | Faster black-box algorithms through higher arity operators. | Benjamin Doerr, Daniel Johannsen, Timo Ktzing, Per Kristian Lehre, Markus Wagner, Carola Winzen |
| 2011 | FOGA | Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. | Benjamin Doerr, Daniel Johannsen, Martin Schmidt |
| 2011 | GECCO | Drift analysis. | Benjamin Doerr |
| 2011 | GECCO | Sharp bounds by probability-generating functions and variable drift. | Benjamin Doerr, Mahmoud Fouz, Carsten Witt |
| 2011 | GECCO | Too fast unbiased black-box algorithms. | Benjamin Doerr, Timo Ktzing, Carola Winzen |
| 2011 | GECCO | Black-box complexities of combinatorial problems. | Benjamin Doerr, Johannes Lengler, Timo Ktzing, Carola Winzen |
| 2011 | ICALP | Asymptotically Optimal Randomized Rumor Spreading. | Benjamin Doerr, Mahmoud Fouz |
| 2011 | STOC | Social networks spread rumors in sublogarithmic time. | Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich |
| 2011 | SPAA | Stabilizing consensus with the power of two choices. | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler |
| 2010 | CEC | Drift analysis and linear functions revisited. | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
| 2010 | GECCO | Quasirandom evolutionary algorithms. | Benjamin Doerr, Mahmoud Fouz, Carsten Witt |
| 2010 | GECCO | Edge-based representation beats vertex-based representation in shortest path problems. | Benjamin Doerr, Daniel Johannsen |
| 2010 | GECCO | Multiplicative drift analysis. | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
| 2010 | PPSN | Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. | Sntje Bttcher, Benjamin Doerr, Frank Neumann |
| 2010 | PPSN | Adaptive Drift Analysis. | Benjamin Doerr, Leslie Ann Goldberg |
| 2010 | PPSN | Drift Analysis with Tail Bounds. | Benjamin Doerr, Leslie Ann Goldberg |
| 2010 | PPSN | More Effective Crossover Operators for the All-Pairs Shortest Path Problem. | Benjamin Doerr, Daniel Johannsen, Timo Ktzing, Frank Neumann, Madeleine Theile |
| 2010 | PPSN | Optimizing Monotone Functions Can Be Difficult. | Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges |
| 2009 | ALENEX | Quasirandom Rumor Spreading: An Experimental Analysis. | Benjamin Doerr, Tobias Friedrich, Marvin Knnemann, Thomas Sauerwald |
| 2009 | ALENEX | Randomized Rounding in the Presence of a Cardinality Constraint. | Benjamin Doerr, Magnus Wahlstrm |
| 2009 | FOGA | Computing single source shortest paths using single-objective fitness. | Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann |
| 2009 | GECCO | Evolutionary algorithms and dynamic programming. | Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile |
| 2009 | GECCO | BBOB: Nelder-Mead with resize and halfruns. | Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, Magnus Wahlstrm |
| 2009 | GECCO | Improved analysis methods for crossover-based algorithms. | Benjamin Doerr, Madeleine Theile |
| 2009 | ICALP | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. | Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald |
| 2009 | ISAAC | Strong Robustness of Randomized Rumor Spreading Protocols. | Benjamin Doerr, Anna Huber, Ariel Levavi |
| 2008 | CEC | Directed trees: A powerful representation for sorting and ordering problems. | Benjamin Doerr, Edda Happ |
| 2008 | GECCO | Crossover can provably be useful in evolutionary computation. | Benjamin Doerr, Edda Happ, Christian Klein |
| 2008 | GECCO | Comparing global and local mutations on bit strings. | Benjamin Doerr, Thomas Jansen, Christian Klein |
| 2008 | PPSN | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. | Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang |
| 2008 | SODA | Deterministic random walks on regular trees. | Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer |
| 2008 | SODA | Quasirandom rumor spreading. | Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald |
| 2007 | CEC | A rigorous view on neutrality. | Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann |
| 2007 | CEC | A tight analysis of the (1 + 1)-EA for the single source shortest path problem. | Benjamin Doerr, Edda Happ, Christian Klein |
| 2007 | CEC | Refined runtime analysis of a basic ant colony optimization algorithm. | Benjamin Doerr, Daniel Johannsen |
| 2007 | GECCO | Adjacency list matchings: an ideal genotype for cycle covers. | Benjamin Doerr, Daniel Johannsen |
| 2007 | GECCO | On the runtime analysis of the 1-ANT ACO algorithm. | Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt |
| 2007 | STACS | Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. | Benjamin Doerr |
| 2006 | ISAAC | Deterministic Random Walks on the Two-Dimensional Grid. | Benjamin Doerr, Tobias Friedrich |
| 2006 | ISAAC | The Interval Liar Game. | Benjamin Doerr, Johannes Lengler, David Steurer |
| 2006 | PPSN | Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. | Benjamin Doerr, Nils Hebbinghaus, Frank Neumann |
| 2006 | STACS | Generating Randomized Roundings with Cardinality Constraints and Derandomizations. | Benjamin Doerr |
| 2005 | SODA | Matrix rounding with low error in small submatrices. | Benjamin Doerr |
| 2005 | STACS | Roundings Respecting Hard Constraints. | Benjamin Doerr |
| 2005 | WAOA | On the Minimum Load Coloring Problem. | Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prvetiv, Anand Srivastav |
| 2005 | WAOA | Rounding of Sequences and Matrices, with Applications. | Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild |
| 2004 | MFCS | Improved Bounds and Schemes for the Declustering Problem. | Benjamin Doerr, Nils Hebbinghaus, Sren Werth |
| 2004 | SODA | Matrix rounding and approximation. | Benjamin Doerr |
| 2003 | SODA | Non-independent randomized rounding. | Benjamin Doerr |
| 2002 | ESA | Non-independent Randomized Rounding and an Application to Digital Halftoning. | Benjamin Doerr, Henning Schnieder |
| 2002 | ICALP | Antirandomizing the Wrong Game. | Benjamin Doerr |
| 2002 | STACS | Balanced Coloring: Equally Easy for All Numbers of Colors? | Benjamin Doerr |
| 2001 | FCT | Structured Randomized Rounding and Coloring. | Benjamin Doerr |
| 2001 | SODA | Lattice approximation and linear discrepency of totally unimodular matrices. | Benjamin Doerr |
| 2001 | STACS | Recursive Randomized Coloring Beats Fair Dice Random Colorings. | Benjamin Doerr, Anand Srivastav |