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. Doerr, and P. Kerschke, “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB,”10.1145/3377930.3390155__in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 778–786, doi:10.1145/3377930.3390155 .

A. V. Do, J. Bossek, A. Neumann, and F. Neumann, “Evolving Diverse Sets of Tours for the Travelling Salesperson Problem,”10.1145/3377930.3389844__in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 681–689, doi:10.1145/3377930.3389844 .

V. Roostapour, J. Bossek, and F. Neumann, “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem,”10.1145/3377930.3390168__in Proceedings of the 2020 Genetic and Evolutionary Computation Conference, 2020, pp. 551–559, doi:10.1145/3377930.3390168 .