@InProceedings{giannopoulou_et_al:LIPIcs.STACS.2019.32,
author = {Giannopoulou, Archontia C. and Kwon, O-joung and Raymond, Jean-Florent and Thilikos, Dimitrios M.},
title = {{Lean Tree-Cut Decompositions: Obstructions and Algorithms}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-100-9},
ISSN = {1868-8969},
year = {2019},
volume = {126},
editor = {Niedermeier, Rolf and Paul, Christophe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.32},
URN = {urn:nbn:de:0030-drops-102716},
doi = {10.4230/LIPIcs.STACS.2019.32},
annote = {Keywords: tree-cut width, lean decompositions, immersions, obstructions, parameterized algorithms}
}