Bossek J, Neumann F, Peng P, Sudholt D. Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica. 2021;83(10):3148–3179. doi:10.1007/s00453-021-00838-3
LibreCat: /record/48854
DOI: 10.1007/s00453-021-00838-3

Bossek J, Neumann F, Peng P, Sudholt D. More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’20. Association for Computing Machinery; 2020:1277–1285. doi:10.1145/3377930.3390174
LibreCat: /record/48847
DOI: 10.1145/3377930.3390174

Bossek J, Casel K, Kerschke P, Neumann F. The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’20. Association for Computing Machinery; 2020:1286–1294. doi:10.1145/3377930.3390243
LibreCat: /record/48851
DOI: 10.1145/3377930.3390243

Bossek J, Neumann F, Peng P, Sudholt D. Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’19. Association for Computing Machinery; 2019:1443–1451. doi:10.1145/3321707.3321792
LibreCat: /record/48843
DOI: 10.1145/3321707.3321792