BibTeX record journals/algorithmica/BossekNPS21

download as .bib file

@article{DBLP:journals/algorithmica/BossekNPS21,
  author       = {Jakob Bossek and
                  Frank Neumann and
                  Pan Peng and
                  Dirk Sudholt},
  title        = {Time Complexity Analysis of Randomized Search Heuristics for the Dynamic
                  Graph Coloring Problem},
  journal      = {Algorithmica},
  volume       = {83},
  number       = {10},
  pages        = {3148--3179},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00453-021-00838-3},
  doi          = {10.1007/S00453-021-00838-3},
  timestamp    = {Wed, 03 Nov 2021 08:27:56 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BossekNPS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.