@InProceedings{jeong_et_al:LIPIcs.ICALP.2018.80,
author = {Jeong, Jisu and Kim, Eun Jung and Oum, Sang-il},
title = {{Finding Branch-Decompositions of Matroids, Hypergraphs, and More}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {80:1--80:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-076-7},
ISSN = {1868-8969},
year = {2018},
volume = {107},
editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.80},
URN = {urn:nbn:de:0030-drops-90849},
doi = {10.4230/LIPIcs.ICALP.2018.80},
annote = {Keywords: branch-width, rank-width, carving-width, fixed-parameter tractability}
}