Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
4 Publications
2021 | Journal Article | LibreCat-ID: 48854
J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem,” Algorithmica, vol. 83, no. 10, pp. 3148–3179, 2021, doi: 10.1007/s00453-021-00838-3.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48847
J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 1277–1285, doi: 10.1145/3377930.3390174.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48851
J. Bossek, K. Casel, P. Kerschke, and F. Neumann, “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 1286–1294, doi: 10.1145/3377930.3390243.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 48843
J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2019, pp. 1443–1451, doi: 10.1145/3321707.3321792.
LibreCat
| DOI