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

Bossek, J., Neumann, F., Peng, P., &; Sudholt, D. (2020). More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. Proceedings of the Genetic and Evolutionary Computation Conference, 1277–1285.https://doi.org/10.1145/3377930.3390174 
LibreCat: /record/48847
DOI: 10.1145/3377930.3390174

Bossek, J., Casel, K., Kerschke, P., &; Neumann, F. (2020). The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. Proceedings of the Genetic and Evolutionary Computation Conference, 1286–1294.https://doi.org/10.1145/3377930.3390243 
LibreCat: /record/48851
DOI: 10.1145/3377930.3390243

Bossek, J., Neumann, F., Peng, P., &; Sudholt, D. (2019). Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. Proceedings of the Genetic and Evolutionary Computation Conference, 1443–1451.https://doi.org/10.1145/3321707.3321792 
LibreCat: /record/48843
DOI: 10.1145/3321707.3321792