Search Results

Abstract

Cite as

Jonne Visser and Hans L. Bodlaender. Deterministically Counting k-Paths and Trees Parameterized by Treewidth in Single-Exponential Time. In 20th International Symposium on Parameterized and Exact Computation (IPEC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 358, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

@InProceedings{visser_et_al:LIPIcs.IPEC.2025.20,
  author =	{Visser, Jonne and Bodlaender, Hans L.},
  title =	{{Deterministically Counting k-Paths and Trees Parameterized by Treewidth in Single-Exponential Time}},
  booktitle =	{20th International Symposium on Parameterized and Exact Computation (IPEC 2025)},
  pages =	{20:1--20:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-407-9},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{358},
  editor =	{Agrawal, Akanksha and van Leeuwen, Erik Jan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2025.20},
  URN =		{urn:nbn:de:0030-drops-251529},
  doi =		{10.4230/LIPIcs.IPEC.2025.20},
  annote =	{Keywords: Parameterized Complexity, Counting Subgraphs, #k-path, Dynamic Programming, Tree Decomposition, Determinant Method}
}