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
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
| DOI
2020 | Conference Paper | LibreCat-ID: 48847
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
| DOI
2020 | Conference Paper | LibreCat-ID: 48851
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
| DOI
2019 | Conference Paper | LibreCat-ID: 48843
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
| DOI