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 .
LibreCat: /record/48854
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 .
LibreCat: /record/48847
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 .
LibreCat: /record/48851
DOI: 10.1145/3377930.3390243

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 .
LibreCat: /record/48843
DOI: 10.1145/3321707.3321792