Graph Burning and Non-uniform k-centers for Small Treewidth

Matej Lieskovský, Jirí Sgall. Graph Burning and Non-uniform k-centers for Small Treewidth. In Parinya Chalermsook, Bundit Laekhanukit, editors, Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings. Volume 13538 of Lecture Notes in Computer Science, pages 20-35, Springer, 2022. [doi]

@inproceedings{LieskovskyS22,
  title = {Graph Burning and Non-uniform k-centers for Small Treewidth},
  author = {Matej Lieskovský and Jirí Sgall},
  year = {2022},
  doi = {10.1007/978-3-031-18367-6_2},
  url = {https://doi.org/10.1007/978-3-031-18367-6_2},
  researchr = {https://researchr.org/publication/LieskovskyS22},
  cites = {0},
  citedby = {0},
  pages = {20-35},
  booktitle = {Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings},
  editor = {Parinya Chalermsook and Bundit Laekhanukit},
  volume = {13538},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-18367-6},
}