@InProceedings{althaus_et_al:LIPIcs.SEA.2021.9,
author = {Althaus, Ernst and Schnurbusch, Daniela and W\"{u}schner, Julian and Ziegler, Sarah},
title = {{On Tamaki’s Algorithm to Compute Treewidths}},
booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)},
pages = {9:1--9:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-185-6},
ISSN = {1868-8969},
year = {2021},
volume = {190},
editor = {Coudert, David and Natale, Emanuele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.9},
URN = {urn:nbn:de:0030-drops-137818},
doi = {10.4230/LIPIcs.SEA.2021.9},
annote = {Keywords: Tree Decomposition, Exact Algorithm, Algorithms Engineering}
}