@InProceedings{chalermsook_et_al:LIPIcs.STACS.2019.19,
author = {Chalermsook, Parinya and Schmid, Andreas and Uniyal, Sumedha},
title = {{A Tight Extremal Bound on the Lov\'{a}sz Cactus Number in Planar Graphs}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {19:1--19: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.19},
URN = {urn:nbn:de:0030-drops-102583},
doi = {10.4230/LIPIcs.STACS.2019.19},
annote = {Keywords: Graph Drawing, Matroid Matching, Maximum Planar Subgraph, Local Search Algorithms}
}