Seeing Arboretum for the (partial k-) Trees

Stefan Arnborg, Andrzej Proskurowski. Seeing Arboretum for the (partial k-) Trees. In Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen, editors, Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday. Volume 12160 of Lecture Notes in Computer Science, pages 3-6, Springer, 2020. [doi]

@inproceedings{ArnborgP20,
  title = {Seeing Arboretum for the (partial k-) Trees},
  author = {Stefan Arnborg and Andrzej Proskurowski},
  year = {2020},
  doi = {10.1007/978-3-030-42071-0_1},
  url = {https://doi.org/10.1007/978-3-030-42071-0_1},
  researchr = {https://researchr.org/publication/ArnborgP20},
  cites = {0},
  citedby = {0},
  pages = {3-6},
  booktitle = {Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday},
  editor = {Fedor V. Fomin and Stefan Kratsch and Erik Jan van Leeuwen},
  volume = {12160},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-42071-0},
}