Refined runtime analysis of a basic ant colony optimization algorithm. - Benjamin Doerr; Daniel Johannsen (IEEE Congress on Evolutionary Computation, 2007)

Adjacency list matchings: an ideal genotype for cycle covers. - Benjamin Doerr; Daniel Johannsen (GECCO, 2007)

Rigorous analyses of fitness-proportional selection for optimizing linear functions. - Edda Happ; Daniel Johannsen; Christian Klein 001; Frank Neumann 001 (GECCO, 2008)

How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. - Benjamin Doerr; Daniel Johannsen; Ching Hoo Tang (PPSN, 2008)

Counting Defective Parking Functions. - Peter J. Cameron; Daniel Johannsen; Thomas Prellberg; Pascal Schweitzer (Electron. J. Comb., 2008)

Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. - Daniel Johannsen; Igor Razgon; Magnus Wahlström (SAT, 2009)

Drift analysis and linear functions revisited. - Benjamin Doerr; Daniel Johannsen; Carola Winzen (IEEE Congress on Evolutionary Computation, 2010)

Edge-based representation beats vertex-based representation in shortest path problems. - Benjamin Doerr; Daniel Johannsen (GECCO, 2010)

Can quantum search accelerate evolutionary algorithms? - Daniel Johannsen; Piyush P. Kurur; Johannes Lengler (GECCO, 2010)

Vertices of Degree k in Random Maps. - Daniel Johannsen; Konstantinos Panagiotou (SODA, 2010)

Random combinatorial structures and randomized search heuristics. - Daniel Johannsen (2010)

Evolutionary Computation in Combinatorial Optimization. - Daniel Johannsen (Theory of Randomized Search Heuristics, 2011)

Faster black-box algorithms through higher arity operators. - Benjamin Doerr; Daniel Johannsen; Timo Kötzing; Per Kristian Lehre; Markus Wagner 007; Carola Winzen (FOGA, 2011)

Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. - Benjamin Doerr; Daniel Johannsen; Martin Schmidt (FOGA, 2011)

Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. - Markus Mainberger; Sebastian Hoffmann 001; Joachim Weickert; Ching Hoo Tang; Daniel Johannsen; Frank Neumann 001; Benjamin Doerr (SSVM, 2011)

Multiplicative Drift Analysis. - Benjamin Doerr; Daniel Johannsen; Carola Winzen (Algorithmica, 2012)

Non-existence of linear universal drift functions. - Benjamin Doerr; Daniel Johannsen; Carola Winzen (Theor. Comput. Sci., 2012)

Expanders Are Universal for the Class of All Spanning Trees. - Daniel Johannsen; Michael Krivelevich; Wojciech Samotij (Comb. Probab. Comput., 2013)

More effective crossover operators for the all-pairs shortest path problem. - Benjamin Doerr; Daniel Johannsen; Timo Kötzing; Frank Neumann 001; Madeleine Theile (Theor. Comput. Sci., 2013)

Evolutionary Algorithms for Quantum Computers. - Daniel Johannsen; Piyush P. Kurur; Johannes Lengler (Algorithmica, 2014)

Optimising Spatial and Tonal Data for PDE-based Inpainting. - Laurent Hoeltgen; Markus Mainberger; Sebastian Hoffmann 001; Joachim Weickert; Ching Hoo Tang; Simon Setzer; Daniel Johannsen; Frank Neumann 001; Benjamin Doerr (CoRR, 2015)

An SQL-Based Query Language and Engine for Graph Pattern Matching. - Christian Krause 001; Daniel Johannsen; Radwan Deeb; Kai-Uwe Sattler; David Knacker; Anton Niadzelka (ICGT, 2016)