@InProceedings{bergougnoux_et_al:LIPIcs.STACS.2023.11,
author = {Bergougnoux, Benjamin and Korhonen, Tuukka and Nederlof, Jesper},
title = {{Tight Lower Bounds for Problems Parameterized by Rank-Width}},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-266-2},
ISSN = {1868-8969},
year = {2023},
volume = {254},
editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.11},
URN = {urn:nbn:de:0030-drops-176636},
doi = {10.4230/LIPIcs.STACS.2023.11},
annote = {Keywords: rank-width, exponential time hypothesis, Boolean-width, parameterized algorithms, independent set, dominating set, maximum induced matching, feedback vertex set}
}