214 citations · 235 across the 6 of their papers we have counts for
7 papers
Optimising Spatial and Tonal Data for PDE-based Inpainting
Laurent Hoeltgen, Markus Mainberger, Sebastian Hoffmann +6
Some recent methods for lossy signal and image compression store only a few selected pixels and fill in the missing structures by inpainting with a partial differential equation (P…
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
Benjamin Doerr, Daniel Johannsen, Timo Kötzing +2
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit…
Expanders Are Universal for the Class of All Spanning Trees
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs fo…
Multiplicative Drift Analysis
Benjamin Doerr, Daniel Johannsen, Carola Winzen
In this work, we introduce multiplicative drift analysis as a suitable way to analyze the runtime of randomized search heuristics such as evolutionary algorithms. We give a multipl…
Faster Black-Box Algorithms Through Higher Arity Operators
Benjamin Doerr, Daniel Johannsen, Timo Kötzing +3
We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show that already for binary op…
Non-Existence of Linear Universal Drift Functions
Benjamin Doerr, Daniel Johannsen, Carola Winzen
Drift analysis has become a powerful tool to prove bounds on the runtime of randomized search heuristics. It allows, for example, fairly simple proofs for the classical problem how…