Bossek, Jakob, and Dirk Sudholt. “Runtime Analysis of Quality Diversity Algorithms.”10.1145/3583131.3590383__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2023, pp. 1546–1554, doi:10.1145/3583131.3590383.

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

Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem.”10.1145/3449639.3459363__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 198–206, doi:10.1145/3449639.3459363.

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

Roostapour, Vahid, et al. “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.”10.1145/3377930.3390168__Proceedings of the 2020 Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 551–559, doi:10.1145/3377930.3390168.

Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem.”10.1145/3299904.3340311__Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, 2019, pp. 102–115, doi:10.1145/3299904.3340311.