Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
6 Publications
2023 | Conference Paper | LibreCat-ID: 48872
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
| DOI
2023 | Journal Article | LibreCat-ID: 48871
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
| DOI
2021 | Conference Paper | LibreCat-ID: 48860
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
| DOI
2021 | Book Chapter | LibreCat-ID: 48862
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
2020 | Conference Paper | LibreCat-ID: 48895
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
| DOI
2019 | Conference Paper | LibreCat-ID: 48870
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
| DOI