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, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.” Algorithmica 83, no. 10 (2021): 3148–3179. https://doi.org/10.1007/s00453-021-00838-3.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48847
Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1277–1285. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390174.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48851
Bossek, Jakob, Katrin Casel, Pascal Kerschke, and Frank Neumann. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1286–1294. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390243.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 48843
Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1443–1451. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321792.
LibreCat
| DOI