More effective randomized search heuristics for graph coloring through dynamic optimization

Jakob Bossek, Frank Neumann 0001, Pan Peng 0001, Dirk Sudholt. More effective randomized search heuristics for graph coloring through dynamic optimization. In Carlos Artemio Coello Coello, editor, GECCO '20: Genetic and Evolutionary Computation Conference, CancĂșn, Mexico, July 8-12, 2020. pages 1277-1285, ACM, 2020. [doi]

@inproceedings{Bossek00S20,
  title = {More effective randomized search heuristics for graph coloring through dynamic optimization},
  author = {Jakob Bossek and Frank Neumann 0001 and Pan Peng 0001 and Dirk Sudholt},
  year = {2020},
  doi = {10.1145/3377930.3390174},
  url = {https://doi.org/10.1145/3377930.3390174},
  researchr = {https://researchr.org/publication/Bossek00S20},
  cites = {0},
  citedby = {0},
  pages = {1277-1285},
  booktitle = {GECCO '20: Genetic and Evolutionary Computation Conference, CancĂșn, Mexico, July 8-12, 2020},
  editor = {Carlos Artemio Coello Coello},
  publisher = {ACM},
  isbn = {978-1-4503-7127-8},
}