J. Bossek, A. Neumann, and F. Neumann, “On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem,”10.1145/3583131.3590384__in Proceedings of the Genetic and Evolutionary Computation Conference, 2023, pp. 248–256, doi:10.1145/3583131.3590384 .

J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem,”10.1007/s00453-021-00838-3__Algorithmica, vol. 83, no. 10, pp. 3148–3179, 2021, doi:10.1007/s00453-021-00838-3 .

J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization,”10.1145/3377930.3390174__in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 1277–1285, doi:10.1145/3377930.3390174 .

J. Bossek, K. Casel, P. Kerschke, and F. Neumann, “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics,”10.1145/3377930.3390243__in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 1286–1294, doi:10.1145/3377930.3390243 .

J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of Multiple Vehicles,”10.1145/3377930.3390146__in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 166–174, doi:10.1145/3377930.3390146 .

J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm,”10.1007/978-3-030-12598-1_41__in Evolutionary Multi-Criterion Optimization (EMO), 2019, pp. 516–528, doi:10.1007/978-3-030-12598-1_41 .

J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring,”10.1145/3321707.3321792__in Proceedings of the Genetic and Evolutionary Computation Conference, 2019, pp. 1443–1451, doi:10.1145/3321707.3321792 .