The Interval Liar Game. - Benjamin Doerr; Johannes Lengler; David Steurer (Electron. Notes Discret. Math., 2007)

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

Black-box complexities of combinatorial problems. - Benjamin Doerr; Timo Kötzing; Johannes Lengler; Carola Winzen (Theor. Comput. Sci., 2013)

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

A high-capacity model for one shot association learning in the brain. - Hafsteinn Einarsson; Johannes Lengler; Angelika Steger (Frontiers Comput. Neurosci., 2014)

Fixed Budget Performance of the (1+1) EA on Linear Functions. - Johannes Lengler; Nicholas Spooner (FOGA, 2015)

Elitist Black-Box Models: Analyzing the Impact of Elitist Selection on the Performance of Evolutionary Algorithms. - Carola Doerr; Johannes Lengler (GECCO, 2015)

Normalization Phenomena in Asynchronous Networks. - Amin Karbasi; Johannes Lengler; Angelika Steger (ICALP (2), 2015)

Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms? - Carola Doerr; Johannes Lengler (CoRR, 2015)

Random Sampling with Removal. - Bernd Gärtner; Johannes Lengler; May Szedlák (SoCG, 2016)

Bootstrap Percolation on Geometric Inhomogeneous Random Graphs. - Christoph Koch 006; Johannes Lengler (ICALP, 2016)

Average Distance in a General Class of Scale-Free Networks with Underlying Geometry. - Karl Bringmann; Ralph Keusch; Johannes Lengler (CoRR, 2016)

Greedy Routing and the Algorithmic Small-World Phenomenom. - Karl Bringmann; Ralph Keusch; Johannes Lengler; Yannic Maus; Anisur Rahaman Molla (CoRR, 2016)

Sampling Geometric Inhomogeneous Random Graphs in Linear Time. - Karl Bringmann; Ralph Keusch; Johannes Lengler (ESA, 2017)

Bounding bloat in genetic programming. - Benjamin Doerr; Timo Kötzing; J. A. Gregor Lagodzinski; Johannes Lengler (GECCO, 2017)

OneMax in Black-Box Models with Several Restrictions. - Carola Doerr; Johannes Lengler (Algorithmica, 2017)

Note on the coefficient of variations of neuronal spike trains. - Johannes Lengler; Angelika Steger (Biol. Cybern., 2017)

Tight Analysis for the 3-Majority Consensus Dynamics. - Mohsen Ghaffari 001; Johannes Lengler (CoRR, 2017)

Drift Analysis. - Johannes Lengler (CoRR, 2017)

Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms? - Carola Doerr; Johannes Lengler (Evol. Comput., 2017)

A Model of Fast Hebbian Spike Latency Normalization. - Hafsteinn Einarsson; Marcelo M. Gauy; Johannes Lengler; Angelika Steger (Frontiers Comput. Neurosci., 2017)

Long Synfire Chains Emerge by Spike-Timing Dependent Plasticity Modulated by Population Activity. - Felix Weissenberger; Florian Meier 002; Johannes Lengler; Hafsteinn Einarsson; Angelika Steger (Int. J. Neural Syst., 2017)

The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates. - Hafsteinn Einarsson; Johannes Lengler; Marcelo Matheus Gauy; Florian Meier 002; Asier Mujika; Angelika Steger; Felix Weissenberger (GECCO, 2018)

Medium step sizes are harmful for the compact genetic algorithm. - Johannes Lengler; Dirk Sudholt; Carsten Witt (GECCO, 2018)

Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics. - Mohsen Ghaffari 001; Johannes Lengler (PODC, 2018)

The (1+1)-EA on Noisy Linear Functions with Random Positive Weights. - Johannes Lengler; Ulysse Schaller (SSCI, 2018)

The (1+1) Elitist Black-Box Complexity of LeadingOnes. - Carola Doerr; Johannes Lengler (Algorithmica, 2018)

Drift Analysis and Evolutionary Algorithms Revisited. - Johannes Lengler; Angelika Steger (Comb. Probab. Comput., 2018)

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. - Johannes Lengler; Anders Martinsson; Angelika Steger (ANALCO, 2019)

The Maximum Label Propagation Algorithm on Sparse Random Graphs. - Charlotte Knierim; Johannes Lengler; Pascal Pfister; Ulysse Schaller; Angelika Steger (APPROX-RANDOM, 2019)

Exponential slowdown for larger populations: the (µ + 1)-EA on monotone functions. - Johannes Lengler; Xun Zou (FOGA, 2019)

The (1 + 1)-EA with mutation rate (1 + ϵ)/n is efficient on monotone functions: an entropy compression argument. (hot-off-the-press track at GECCO 2019). - Johannes Lengler; Anders Martinsson; Angelika Steger (GECCO (Companion), 2019)

Sorting by Swaps with Noisy Comparisons. - Tomas Gavenciak; Barbara Geissmann; Johannes Lengler (Algorithmica, 2019)

Bootstrap percolation with inhibition. - Hafsteinn Einarsson; Johannes Lengler; Frank Mousset; Konstantinos Panagiotou; Angelika Steger (Random Struct. Algorithms, 2019)

Geometric inhomogeneous random graphs. - Karl Bringmann; Ralph Keusch; Johannes Lengler (Theor. Comput. Sci., 2019)

The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates. - Hafsteinn Einarsson; Marcelo Matheus Gauy; Johannes Lengler; Florian Meier 002; Asier Mujika; Angelika Steger; Felix Weissenberger (Theor. Comput. Sci., 2019)

Asymptotically optimal amplifiers for the Moran process. - Leslie Ann Goldberg; John Lapinskas; Johannes Lengler; Florian Meier 002; Konstantinos Panagiotou; Pascal Pfister (Theor. Comput. Sci., 2019)

An Optimal Decentralized (Δ + 1)-Coloring Algorithm. - Daniel Bertschinger; Johannes Lengler; Anders Martinsson; Robert Meier; Angelika Steger; Milos Trujic; Emo Welzl (ESA, 2020)

Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs. - Júlia Komjáthy; John Lapinskas; Johannes Lengler (CoRR, 2020)

Runtime analysis of the (mu+1)-EA on the Dynamic BinVal function. - Johannes Lengler; Simone Riedi (CoRR, 2020)

Random Sampling with Removal. - Kenneth L. Clarkson; Bernd Gärtner; Johannes Lengler; May Szedlák (Discret. Comput. Geom., 2020)

The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time. - Benjamin Doerr; Timo Kötzing; J. A. Gregor Lagodzinski; Johannes Lengler (Theor. Comput. Sci., 2020)

Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming. - Timo Kötzing; J. A. Gregor Lagodzinski; Johannes Lengler; Anna Melnichenko (Theor. Comput. Sci., 2020)

A General Dichotomy of Evolutionary Algorithms on Monotone Functions. - Johannes Lengler (IEEE Trans. Evol. Comput., 2020)

Drift Analysis. - Johannes Lengler (Theory of Evolutionary Computation, 2020)

Self-Adjusting Mutation Rates with Provably Optimal Success Rules. - Benjamin Doerr; Carola Doerr; Johannes Lengler (Algorithmica, 2021)

The Complex Parameter Landscape of the Compact Genetic Algorithm. - Johannes Lengler; Dirk Sudholt; Carsten Witt (Algorithmica, 2021)

Exponential slowdown for larger populations: The (μ + 1)-EA on monotone functions. - Johannes Lengler; Xun Zou (Theor. Comput. Sci., 2021)

Population Diversity Leads to Short Running Times of Lexicase Selection. - Thomas Helmuth; Johannes Lengler; William G. La Cava (PPSN (2), 2022)

Self-adjusting Population Sizes for the (1, λ )-EA on Monotone Functions. - Marc Kaufmann; Maxime Larcher; Johannes Lengler; Xun Zou (PPSN (2), 2022)

Editorial. - Johannes Lengler; Frank Neumann 001 (Algorithmica, 2022)

Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081). - Anne Auger; Carlos M. Fonseca; Tobias Friedrich 001; Johannes Lengler (Dagstuhl Reports, 2022)

Greedy routing and the algorithmic small-world phenomenon. - Karl Bringmann; Ralph Keusch; Johannes Lengler; Yannic Maus; Anisur Rahaman Molla (J. Comput. Syst. Sci., 2022)

Runtime Analysis of the (μ + 1)-EA on the Dynamic BinVal Function. - Johannes Lengler; Simone Riedi (SN Comput. Sci., 2022)

Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. - Joost Jorritsma; Johannes Lengler; Dirk Sudholt (GECCO, 2023)

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I. - Júlia Komjáthy; John Lapinskas; Johannes Lengler; Ulysse Schaller (CoRR, 2023)

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II. - Júlia Komjáthy; John Lapinskas; Johannes Lengler; Ulysse Schaller (CoRR, 2023)

Two-dimensional drift analysis: Optimizing two functions simultaneously can be hard. - Duri Janett; Johannes Lengler (Theor. Comput. Sci., 2023)

Self-adjusting population sizes for the (1,λ)-EA on monotone functions. - Marc Kaufmann; Maxime Larcher; Johannes Lengler; Xun Zou (Theor. Comput. Sci., 2023)

Improved Bounds for Graph Distances in Scale Free Percolation and Related Models. - Kostas Lakis; Johannes Lengler; Kalina Petrova; Leon Schiller (APPROX/RANDOM, 2024)

Plus Strategies are Exponentially Slower for Planted Optima of Random Height. - Johannes Lengler; Leon Schiller; Oliver Sieberling (GECCO, 2024)

A Tight O(4k/pc) Runtime Bound for a (μ+1)GA on Jumpk for Realistic Crossover Probabilities. - Andre Opris; Johannes Lengler; Dirk Sudholt (GECCO, 2024)

How Population Diversity Influences the Efficiency of Crossover. - Sacha Cerf; Johannes Lengler (PPSN (3), 2024)

Faster Optimization Through Genetic Drift. - Cella Florescu; Marc Kaufmann; Johannes Lengler; Ulysse Schaller (PPSN (3), 2024)

Self-adjusting Evolutionary Algorithms are Slow on a Class of Multimodal Landscapes. - Johannes Lengler; Konstantin Sturm (PPSN (3), 2024)

Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler. - Diederick Vermetten; Johannes Lengler; Dimitri Rusin; Thomas Bäck; Carola Doerr (PPSN (2), 2024)

A Tight O(4k/pc) Runtime Bound for a (μ+1) GA on Jumpk for Realistic Crossover Probabilities. - Andre Opris; Johannes Lengler; Dirk Sudholt (CoRR, 2024)

Self-Adjusting Evolutionary Algorithms Are Slow on Multimodal Landscapes. - Johannes Lengler; Konstantin Sturm (CoRR, 2024)

Improved bounds for polylogarithmic graph distances in scale-free percolation and related models. - Kostas Lakis; Johannes Lengler; Kalina Petrova; Leon Schiller (CoRR, 2024)

Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models. - Marc Kaufmann; Kostas Lakis; Johannes Lengler; Raghu Raman Ravi; Ulysse Schaller; Konstantin Sturm (CoRR, 2024)

Balanced Bidirectional Breadth-First Search on Scale-Free Networks. - Sacha Cerf; Benjamin Dayan; Umberto De Ambroggio; Marc Kaufmann; Johannes Lengler; Ulysse Schaller (CoRR, 2024)

Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 24271). - Anne Auger; Tobias Glasmachers; Martin S. Krejca; Johannes Lengler; Alexander Jungeilges (Dagstuhl Reports, 2024)

On connectivity in random graph models with limited dependencies. - Johannes Lengler; Anders Martinsson; Kalina Petrova; Patrick Schnider; Raphael Steiner; Simon Weber 001; Emo Welzl (Random Struct. Algorithms, 2024)

Large population sizes and crossover help in dynamic environments. - Johannes Lengler; Jonas Meier (Nat. Comput., 2024)

Benchmarking Dynamic Binary Value Problems with IOHprofiler - Reproducibility files. - Diederick Vermetten; Johannes Lengler; Dimitri Rusin; Thomas Bäck; Carola Doerr (Zenodo, 2024)

Analysing Equilibrium States for Population Diversity. - Johannes Lengler; Andre Opris; Dirk Sudholt (Algorithmica, 2024)

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions. - Carola Doerr; Duri Andrea Janett; Johannes Lengler (Algorithmica, 2024)

Runtime Analysis of Evolutionary Multitasking for Classical Benchmark Problems. - Johannes Lengler; Aneta Neumann; Frank Neumann 001 (GECCO, 2025)

OneMax Is Not the Easiest Function for Fitness Improvements. - Marc Kaufmann; Maxime Larcher; Johannes Lengler; Xun Zou (Evol. Comput., 2025)

Expanders in Models of Social Networks. - Marc Kaufmann; Johannes Lengler; Ulysse Schaller; Konstantin Sturm (CoRR, 2025)

Hardest Monotone Functions for Evolutionary Algorithms. - Marc Kaufmann; Maxime Larcher; Johannes Lengler; Oliver Sieberling (SN Comput. Sci., 2025)

Diversity-Preserving Exploitation of Crossover. - Johannes Lengler; Tom Offermann (CoRR, 2025)

Assortativity in geometric and scale-free networks. - Marc Kaufmann; Ulysse Schaller; Thomas Bläsius; Johannes Lengler (CoRR, 2025)