most citedPlus Strategies are Exponentially Slower for Planted Optima of Random Height

2 citations · 2 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2025

Sharp thresholds for higher powers of Hamilton cycles in random graphs

Tamás Makai, Matija Pasch, Kalina Petrova +1

For , we establish that is a sharp threshold for the existence of the -th power of a Hamilton cycle in the binomial random graph model. Our proof…

math.PR2024

Improved bounds for polylogarithmic graph distances in scale-free percolation and related models

Kostas Lakis, Johannes Lengler, Kalina Petrova +1

In this paper, we study graph distances in the geometric random graph models scale-free percolation SFP, geometric inhomogeneous random graphs GIRG, and hyperbolic random graphs HR…

cs.NE2024★ 2 cited

Plus Strategies are Exponentially Slower for Planted Optima of Random Height

Johannes Lengler, Leon Schiller, Oliver Sieberling

We compare the -EA and the -EA on the recently introduced benchmark DisOM, which is the OneMax function with randomly planted local optima. Previous work showed tha…