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.
19 Publications
2023 | Conference Paper | LibreCat-ID: 48869
Bossek, J., Neumann, A., & Neumann, F. (2023). On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 248–256. https://doi.org/10.1145/3583131.3590384
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
2022 | Conference Paper | LibreCat-ID: 48894
Nikfarjam, A., Neumann, A., Bossek, J., & Neumann, F. (2022). Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem. In G. Rudolph, A. V. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, & T. Tu\v sar (Eds.), Parallel Problem Solving from Nature (PPSN XVII) (pp. 237–249). Springer International Publishing. https://doi.org/10.1007/978-3-031-14714-2_17
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48853
Bossek, J., Neumann, A., & Neumann, F. (2021). Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, 556–564. https://doi.org/10.1145/3449639.3459364
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
2021 | Conference Paper | LibreCat-ID: 48876
Bossek, J., & Wagner, M. (2021). Generating Instances with Performance Differences for More than Just Two Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1423–1432. https://doi.org/10.1145/3449726.3463165
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48893
Nikfarjam, A., Bossek, J., Neumann, A., & Neumann, F. (2021). Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 600–608. https://doi.org/10.1145/3449639.3459384
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48891
Neumann, A., Bossek, J., & Neumann, F. (2021). Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions. Proceedings of the Genetic and Evolutionary Computation Conference, 261–269. https://doi.org/10.1145/3449639.3459385
LibreCat
| DOI
2021 | Book Chapter | LibreCat-ID: 48892
Nikfarjam, A., Bossek, J., Neumann, A., & Neumann, F. (2021). Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation. In Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms (pp. 1–11). Association for Computing Machinery.
LibreCat
2021 | Journal Article | LibreCat-ID: 48854
Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2021). Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica, 83(10), 3148–3179. https://doi.org/10.1007/s00453-021-00838-3
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48847
Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2020). More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. Proceedings of the Genetic and Evolutionary Computation Conference, 1277–1285. https://doi.org/10.1145/3377930.3390174
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48851
Bossek, J., Casel, K., Kerschke, P., & Neumann, F. (2020). The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. Proceedings of the Genetic and Evolutionary Computation Conference, 1286–1294. https://doi.org/10.1145/3377930.3390243
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48845
Bossek, J., Grimme, C., & Trautmann, H. (2020). Dynamic Bi-Objective Routing of Multiple Vehicles. Proceedings of the Genetic and Evolutionary Computation Conference, 166–174. https://doi.org/10.1145/3377930.3390146
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48852
Bossek, J., Neumann, A., & Neumann, F. (2020). Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. Parallel Problem Solving from Nature (PPSN XVI), 346–359. https://doi.org/10.1007/978-3-030-58112-1_24
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48879
Do, A. V., Bossek, J., Neumann, A., & Neumann, F. (2020). Evolving Diverse Sets of Tours for the Travelling Salesperson Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 681–689. https://doi.org/10.1145/3377930.3389844
LibreCat
| DOI
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: 48843
Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2019). Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. Proceedings of the Genetic and Evolutionary Computation Conference, 1443–1451. https://doi.org/10.1145/3321707.3321792
LibreCat
| DOI
2015 | Conference Paper | LibreCat-ID: 48838
Bossek, J., Bischl, B., Wagner, T., & Rudolph, G. (2015). Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement. Proceedings of the Genetic and Evolutionary Computation Conference, 1319–1326. https://doi.org/10.1145/2739480.2754673
LibreCat
| DOI