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, Jakob, Aneta Neumann, and Frank Neumann. “On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem.” In Proceedings of the Genetic and Evolutionary Computation Conference, 248–256. GECCO’23. New York, NY, USA: Association for Computing Machinery, 2023. https://doi.org/10.1145/3583131.3590384.
LibreCat
| DOI
2023 | Journal Article | LibreCat-ID: 48871
Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up Evolutionary Algorithms?” Theoretical Computer Science, 2023, 113757. https://doi.org/10.1016/j.tcs.2023.113757.
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 48894
Nikfarjam, Adel, Aneta Neumann, Jakob Bossek, and Frank Neumann. “Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem.” In Parallel Problem Solving from Nature (PPSN XVII), edited by Günter Rudolph, Anna V. Kononova, Hernán Aguirre, Pascal Kerschke, Gabriela Ochoa, and Tea Tu\v sar, 237–249. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-14714-2_17.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48853
Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.” In Proceedings of the Genetic and Evolutionary Computation Conference, 556–564. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449639.3459364.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48860
Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem.” 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.
LibreCat
| DOI
2021 | Book Chapter | LibreCat-ID: 48862
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.
LibreCat
2021 | Conference Paper | LibreCat-ID: 48876
Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance Differences for More than Just Two Algorithms.” In Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1423–1432. GECCO’21. New York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449726.3463165.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48893
Nikfarjam, Adel, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem.” In Proceedings of the Genetic and Evolutionary Computation Conference, 600–608. GECCO’21. New York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449639.3459384.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48891
Neumann, Aneta, Jakob Bossek, and Frank Neumann. “Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions.” In Proceedings of the Genetic and Evolutionary Computation Conference, 261–269. GECCO’21. New York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449639.3459385.
LibreCat
| DOI
2021 | Book Chapter | LibreCat-ID: 48892
Nikfarjam, Adel, Jakob Bossek, Aneta Neumann, and Frank Neumann. “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, 1–11. New York, NY, USA: Association for Computing Machinery, 2021.
LibreCat
2021 | Journal Article | LibreCat-ID: 48854
Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.” Algorithmica 83, no. 10 (2021): 3148–3179. https://doi.org/10.1007/s00453-021-00838-3.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48847
Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1277–1285. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390174.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48851
Bossek, Jakob, Katrin Casel, Pascal Kerschke, and Frank Neumann. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1286–1294. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390243.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48845
Bossek, Jakob, Christian Grimme, and Heike Trautmann. “Dynamic Bi-Objective Routing of Multiple Vehicles.” In Proceedings of the Genetic and Evolutionary Computation Conference, 166–174. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390146.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48852
Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.” In Parallel Problem Solving from Nature (PPSN XVI), 346–359. Berlin, Heidelberg: Springer-Verlag, 2020. https://doi.org/10.1007/978-3-030-58112-1_24.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48879
Do, Anh Viet, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Evolving Diverse Sets of Tours for the Travelling Salesperson Problem.” In Proceedings of the Genetic and Evolutionary Computation Conference, 681–689. GECCO’20. New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3389844.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48895
Roostapour, Vahid, Jakob Bossek, and Frank Neumann. “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.” 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.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 48843
Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1443–1451. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321792.
LibreCat
| DOI
2015 | Conference Paper | LibreCat-ID: 48838
Bossek, Jakob, Bernd Bischl, Tobias Wagner, and Günter Rudolph. “Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1319–1326. GECCO ’15. New York, NY, USA: Association for Computing Machinery, 2015. https://doi.org/10.1145/2739480.2754673.
LibreCat
| DOI