Computing Treedepth in Polynomial Space and Linear FPT Time

Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz. Computing Treedepth in Polynomial Space and Linear FPT Time. In Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, editors, 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany. Volume 244 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

@inproceedings{NadaraPS22,
  title = {Computing Treedepth in Polynomial Space and Linear FPT Time},
  author = {Wojciech Nadara and Michal Pilipczuk and Marcin Smulewicz},
  year = {2022},
  doi = {10.4230/LIPIcs.ESA.2022.79},
  url = {https://doi.org/10.4230/LIPIcs.ESA.2022.79},
  researchr = {https://researchr.org/publication/NadaraPS22},
  cites = {0},
  citedby = {0},
  booktitle = {30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany},
  editor = {Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman},
  volume = {244},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-247-1},
}