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

More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization
J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1277–1285.
LibreCat: /record/48847
DOI: 10.1145/3377930.3390174

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics
J. Bossek, K. Casel, P. Kerschke, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1286–1294.
LibreCat: /record/48851
DOI: 10.1145/3377930.3390243

Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring
J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 1443–1451.
LibreCat: /record/48843
DOI: 10.1145/3321707.3321792