Bossek, J., &; Sudholt, D. (2023). Runtime Analysis of Quality Diversity Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, 1546–1554.https://doi.org/10.1145/3583131.3590383 
LibreCat: /record/48872
DOI: 10.1145/3583131.3590383

Bossek, J., &; Sudholt, D. (2023). Do Additional Target Points Speed Up Evolutionary Algorithms? Theoretical Computer Science, 113757.https://doi.org/10.1016/j.tcs.2023.113757 
LibreCat: /record/48871
DOI: 10.1016/j.tcs.2023.113757

Bossek, J., &; Neumann, F. (2021). Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 198–206.https://doi.org/10.1145/3449639.3459363 
LibreCat: /record/48860
DOI: 10.1145/3449639.3459363

Bossek, J., &; Sudholt, D. (2021). Do Additional Optima Speed up Evolutionary Algorithms? In Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (pp. 1–11). Association for Computing Machinery.
LibreCat: /record/48862

Roostapour, V., Bossek, J., &; Neumann, F. (2020). Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. Proceedings of the 2020 Genetic and Evolutionary Computation Conference, 551–559.https://doi.org/10.1145/3377930.3390168 
LibreCat: /record/48895
DOI: 10.1145/3377930.3390168

Bossek, J., &; Sudholt, D. (2019). Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem. Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 102–115.https://doi.org/10.1145/3299904.3340311 
LibreCat: /record/48870
DOI: 10.1145/3299904.3340311