| 2026 | PPSN | Improved Runtime Bound for the (μ +1) -EA on BinVal. | Joris Belder, Johannes Lengler, Raghu Raman Ravi |
| 2026 | PPSN | The (1+1) -EA in Dynamic Environments. | Georg Hasebe, Johannes Lengler, Raghu Raman Ravi |
| 2026 | PPSN | Runtime Analysis of the (μ + 1)-ES in a Homogenous Progress Model. | Johannes Lengler, Raghu Raman Ravi |
| 2026 | SODA | 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 |
| 2026 | STACS | The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs. | Zylan Benjert, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi |
| 2025 | FOGA | Diversity-Preserving Exploitation of Crossover. | Johannes Lengler, Tom Offermann |
| 2025 | GECCO | Runtime Analysis of Evolutionary Multitasking for Classical Benchmark Problems. | Johannes Lengler, Aneta Neumann, Frank Neumann |
| 2025 | WG | Expanders in Models of Social Networks. | Marc Kaufmann, Johannes Lengler, Ulysse Schaller, Konstantin Sturm |
| 2024 | EvoCOP | Hardest Monotone Functions for Evolutionary Algorithms. | Marc Kaufmann, Maxime Larcher, Johannes Lengler, Oliver Sieberling |
| 2024 | GECCO | Plus Strategies are Exponentially Slower for Planted Optima of Random Height. | Johannes Lengler, Leon Schiller, Oliver Sieberling |
| 2024 | GECCO | A Tight | Andre Opris, Johannes Lengler, Dirk Sudholt |
| 2024 | PPSN | How Population Diversity Influences the Efficiency of Crossover. | Sacha Cerf, Johannes Lengler |
| 2024 | PPSN | Faster Optimization Through Genetic Drift. | Cella Florescu, Marc Kaufmann, Johannes Lengler, Ulysse Schaller |
| 2024 | PPSN | Self-adjusting Evolutionary Algorithms are Slow on a Class of Multimodal Landscapes. | Johannes Lengler, Konstantin Sturm |
| 2024 | PPSN | Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler. | Diederick Vermetten, Johannes Lengler, Dimitri Rusin, Thomas Bck, Carola Doerr |
| 2023 | GECCO | Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions. | Carola Doerr, Duri Andrea Janett, Johannes Lengler |
| 2023 | GECCO | Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. | Joost Jorritsma, Johannes Lengler, Dirk Sudholt |
| 2023 | GECCO | Analysing Equilibrium States for Population Diversity. | Johannes Lengler, Andre Opris, Dirk Sudholt |
| 2022 | PPSN | Population Diversity Leads to Short Running Times of Lexicase Selection. | Thomas Helmuth, Johannes Lengler, William G. La Cava |
| 2022 | PPSN | Two-Dimensional Drift Analysis: - Optimizing Two Functions Simultaneously Can Be Hard. | Duri Janett, Johannes Lengler |
| 2022 | PPSN | Self-adjusting Population Sizes for the (1, λ )-EA on Monotone Functions. | Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou |
| 2020 | ESA | An Optimal Decentralized (Δ + 1)-Coloring Algorithm. | Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl |
| 2020 | PPSN | Large Population Sizes and Crossover Help in Dynamic Environments. | Johannes Lengler, Jonas Meier |
| 2019 | FOGA | Exponential slowdown for larger populations: the ( + 1)-EA on monotone functions. | Johannes Lengler, Xun Zou |
| 2019 | GECCO | Self-adjusting mutation rates with provably optimal success rules. | Benjamin Doerr, Carola Doerr, Johannes Lengler |
| 2019 | GECCO | The (1 + 1)-EA with mutation rate (1 + ϵ)/ | Johannes Lengler, Anders Martinsson, Angelika Steger |
| 2018 | GECCO | 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, Asier Mujika, Angelika Steger, Felix Weissenberger |
| 2018 | GECCO | Medium step sizes are harmful for the compact genetic algorithm. | Johannes Lengler, Dirk Sudholt, Carsten Witt |
| 2018 | PODC | Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics. | Mohsen Ghaffari, Johannes Lengler |
| 2018 | PPSN | Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. | Timo Ktzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko |
| 2018 | PPSN | A General Dichotomy of Evolutionary Algorithms on Monotone Functions. | Johannes Lengler |
| 2017 | ESA | Sampling Geometric Inhomogeneous Random Graphs in Linear Time. | Karl Bringmann, Ralph Keusch, Johannes Lengler |
| 2017 | GECCO | Bounding bloat in genetic programming. | Benjamin Doerr, Timo Ktzing, J. A. Gregor Lagodzinski, Johannes Lengler |
| 2017 | GECCO | Sorting by swaps with noisy comparisons. | Tomas Gavenciak, Barbara Geissmann, Johannes Lengler |
| 2017 | PODC | Greedy Routing and the Algorithmic Small-World Phenomenon. | Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla |
| 2016 | GECCO | The (1+1) Elitist Black-Box Complexity of LeadingOnes. | Carola Doerr, Johannes Lengler |
| 2016 | ICALP | Bootstrap Percolation on Geometric Inhomogeneous Random Graphs. | Christoph Koch, Johannes Lengler |
| 2015 | FOGA | Fixed Budget Performance of the (1+1) EA on Linear Functions. | Johannes Lengler, Nicholas Spooner |
| 2015 | GECCO | Elitist Black-Box Models: Analyzing the Impact of Elitist Selection on the Performance of Evolutionary Algorithms. | Carola Doerr, Johannes Lengler |
| 2015 | GECCO | OneMax in Black-Box Models with Several Restrictions. | Carola Doerr, Johannes Lengler |
| 2015 | ICALP | Normalization Phenomena in Asynchronous Networks. | Amin Karbasi, Johannes Lengler, Angelika Steger |
| 2011 | GECCO | Black-box complexities of combinatorial problems. | Benjamin Doerr, Johannes Lengler, Timo Ktzing, Carola Winzen |
| 2010 | GECCO | Can quantum search accelerate evolutionary algorithms? | Daniel Johannsen, Piyush P. Kurur, Johannes Lengler |
| 2006 | ISAAC | The Interval Liar Game. | Benjamin Doerr, Johannes Lengler, David Steurer |