@InProceedings{jelinek_et_al:LIPIcs.IPEC.2021.22,
  author =	{Jel{\'\i}nek, V{\'\i}t and Opler, Michal and Pek\'{a}rek, Jakub},
  title =	{{Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder}},
  booktitle =	{16th International Symposium on Parameterized and Exact Computation (IPEC 2021)},
  pages =	{22:1--22:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-216-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{214},
  editor =	{Golovach, Petr A. and Zehavi, Meirav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.22},
  URN =		{urn:nbn:de:0030-drops-154050},
  doi =		{10.4230/LIPIcs.IPEC.2021.22},
  annote =	{Keywords: Permutation pattern matching, subexponential algorithm, conditional lower bounds, tree-width}
}