@inproceedings{BOPIL17,
address = {Dagstuhl, Germany},
annote = {Keywords: tree decomposition, treewidth, transduction, monadic second-order logic},
author = {Bojanczyk, Mikolaj and Pilipczuk, Michal},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
doi = {10.4230/LIPIcs.STACS.2017.15},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
isbn = {978-3-95977-028-6},
issn = {1868-8969},
pages = {15:1--15:13},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
sha256 = {528560FC3FAA0B25430743CD5E568CCB782EE658E20FF1AC2DDAAEAAEF6B1276},
title = {{Optimizing Tree Decompositions in MSO}},
url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.15},
urn = {urn:nbn:de:0030-drops-70173},
volume = {66},
year = {2017}
}