| 2012 | SODA | Expanders are universal for the class of all spanning trees. | Daniel Johannsen, Michael Krivelevich, Wojciech Samotij |
| 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 |
| 2010 | CEC | Drift analysis and linear functions revisited. | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
| 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 | GECCO | Can quantum search accelerate evolutionary algorithms? | Daniel Johannsen, Piyush P. Kurur, Johannes Lengler |
| 2010 | PPSN | More Effective Crossover Operators for the All-Pairs Shortest Path Problem. | Benjamin Doerr, Daniel Johannsen, Timo Ktzing, Frank Neumann, Madeleine Theile |
| 2010 | SODA | Vertices of Degree k in Random Maps. | Daniel Johannsen, Konstantinos Panagiotou |
| 2009 | SAT | Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. | Daniel Johannsen, Igor Razgon, Magnus Wahlstrm |
| 2008 | GECCO | Rigorous analyses of fitness-proportional selection for optimizing linear functions. | Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann |
| 2008 | PPSN | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. | Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang |
| 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 |