214 citations · 235 across the 6 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 1 cited
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…
cs.NE2011★ 214 cited
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…