@InProceedings{bodlaender_et_al:LIPIcs.IPEC.2022.7,
author = {Bodlaender, Hans L. and Groenland, Carla and Jacob, Hugo},
title = {{On the Parameterized Complexity of Computing Tree-Partitions}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {7:1--7:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-260-0},
ISSN = {1868-8969},
year = {2022},
volume = {249},
editor = {Dell, Holger and Nederlof, Jesper},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.7},
URN = {urn:nbn:de:0030-drops-173633},
doi = {10.4230/LIPIcs.IPEC.2022.7},
annote = {Keywords: Parameterized algorithms, Tree partitions, tree-partition-width, Treewidth, Domino Treewidth, Approximation Algorithms, Parameterized Complexity}
}