Geometric inhomogeneous random graphs K Bringmann, R Keusch, J Lengler Theoretical Computer Science 760, 35-54, 2019 | 62 | 2019 |

A general dichotomy of evolutionary algorithms on monotone functions J Lengler IEEE Transactions on Evolutionary Computation 24 (6), 995-1009, 2019 | 36 | 2019 |

Sampling geometric inhomogeneous random graphs in linear time K Bringmann, R Keusch, J Lengler arXiv preprint arXiv:1511.00576, 2015 | 33 | 2015 |

Reliable neuronal systems: the importance of heterogeneity J Lengler, F Jug, A Steger PloS one 8 (12), e80694, 2013 | 32 | 2013 |

Drift analysis and evolutionary algorithms revisited J Lengler, A Steger arXiv preprint arXiv:1608.03226, 2016 | 31 | 2016 |

Black-box complexities of combinatorial problems B Doerr, T Kötzing, J Lengler, C Winzen Theoretical Computer Science 471, 84-106, 2013 | 30 | 2013 |

Drift analysis J Lengler Theory of Evolutionary Computation, 89-131, 2020 | 28 | 2020 |

Average distance in a general class of scale-free networks with underlying geometry K Bringmann, R Keusch, J Lengler arXiv preprint arXiv:1602.05712, 2016 | 28 | 2016 |

Bootstrap percolation on geometric inhomogeneous random graphs C Koch, J Lengler arXiv preprint arXiv:1603.02057, 2016 | 27 | 2016 |

Greedy routing and the algorithmic small-world phenomenon K Bringmann, R Keusch, J Lengler, Y Maus, AR Molla Proceedings of the ACM Symposium on Principles of Distributed Computing, 371-380, 2017 | 26 | 2017 |

Medium step sizes are harmful for the compact genetic algorithm J Lengler, D Sudholt, C Witt Proceedings of the Genetic and Evolutionary Computation Conference, 1499-1506, 2018 | 21 | 2018 |

OneMax in Black-Box Models with Several Restrictions C Doerr, J Lengler Algorithmica 78 (2), 610-640, 2017 | 19 | 2017 |

Fixed budget performance of the (1+ 1) EA on linear functions J Lengler, N Spooner Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms …, 2015 | 19 | 2015 |

Bounding bloat in genetic programming B Doerr, T Kötzing, JAG Lagodzinski, J Lengler Proceedings of the Genetic and Evolutionary Computation Conference, 921-928, 2017 | 18 | 2017 |

Self-adjusting mutation rates with provably optimal success rules B Doerr, C Doerr, J Lengler Proceedings of the Genetic and Evolutionary Computation Conference, 1479-1487, 2019 | 17 | 2019 |

Elitist black-box models: Analyzing the impact of elitist selection on the performance of evolutionary algorithms C Doerr, J Lengler Proceedings of the 2015 Annual Conference on Genetic and Evolutionary …, 2015 | 17 | 2015 |

Bootstrap percolation with inhibition H Einarsson, J Lengler, K Panagiotou, F Mousset, A Steger arXiv preprint arXiv:1410.3291, 2014 | 17 | 2014 |

The Cohen-Lenstra heuristic for finite abelian groups J Lengler Verlag nicht ermittelbar, 2009 | 17 | 2009 |

Asymptotically optimal amplifiers for the Moran process LA Goldberg, J Lapinskas, J Lengler, F Meier, K Panagiotou, P Pfister Theoretical Computer Science 758, 73-93, 2019 | 13 | 2019 |

Nearly-tight analysis for 2-choice and 3-majority consensus dynamics M Ghaffari, J Lengler Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 13 | 2018 |