Bossek, Jakob, and Dirk Sudholt. “Runtime Analysis of Quality Diversity Algorithms.”https://doi.org/10.1145/3583131.3590383__In Proceedings of the Genetic and Evolutionary Computation Conference, 1546–1554. GECCO’23. New York, NY, USA: Association for Computing Machinery, 2023.https://doi.org/10.1145/3583131.3590383 .

Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up Evolutionary Algorithms?”https://doi.org/10.1016/j.tcs.2023.113757__Theoretical Computer Science, 2023, 113757.https://doi.org/10.1016/j.tcs.2023.113757 .

Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem.”https://doi.org/10.1145/3449639.3459363__In Proceedings of the Genetic and Evolutionary Computation Conference, 198–206. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021.https://doi.org/10.1145/3449639.3459363 .

Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary Algorithms?” In Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 1–11. New York, NY, USA: Association for Computing Machinery, 2021.

Roostapour, Vahid, Jakob Bossek, and Frank Neumann. “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.”https://doi.org/10.1145/3377930.3390168__In Proceedings of the 2020 Genetic and Evolutionary Computation Conference, 551–559. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020.https://doi.org/10.1145/3377930.3390168 .

Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem.”https://doi.org/10.1145/3299904.3340311__In Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 102–115. FOGA ’19. New York, NY, USA: Association for Computing Machinery, 2019.https://doi.org/10.1145/3299904.3340311 .