Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder

Vít Jelínek, Michal Opler, Jakub Pekárek. Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. In Petr A. Golovach, Meirav Zehavi, editors, 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal. Volume 214 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

@inproceedings{JelinekOP21-0,
  title = {Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder},
  author = {Vít Jelínek and Michal Opler and Jakub Pekárek},
  year = {2021},
  doi = {10.4230/LIPIcs.IPEC.2021.22},
  url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.22},
  researchr = {https://researchr.org/publication/JelinekOP21-0},
  cites = {0},
  citedby = {0},
  booktitle = {16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal},
  editor = {Petr A. Golovach and Meirav Zehavi},
  volume = {214},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-216-7},
}