@InProceedings{tamaki:LIPIcs.IPEC.2023.34,
author = {Tamaki, Hisao},
title = {{A Contraction-Recursive Algorithm for Treewidth}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.34},
URN = {urn:nbn:de:0030-drops-194536},
doi = {10.4230/LIPIcs.IPEC.2023.34},
annote = {Keywords: graph algorithm, treewidth, exact computation, BT dynamic programming, contraction, certifying algorithms}
}