@inproceedings{Cslovjecsek_SODA24b,
TITLE = {A Polynomial-time $\mathrm{OPT}^\epsilon$-Approximation Algorithm for Maximum Independent Set of Connected Subgraphs in a Planar Graph},
AUTHOR = {Cslovjecsek, Jana and Pilipczuk, Micha{\l} and W{\k e}grzycki, Karol},
LANGUAGE = {eng},
ISBN = {978-1-61197-791-2},
DOI = {10.1137/1.9781611977912.23},
PUBLISHER = {SIAM},
YEAR = {2024},
MARGINALMARK = {$\bullet$},
DATE = {2024},
BOOKTITLE = {Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2024)},
EDITOR = {Woodruff, David P.},
PAGES = {625--638},
ADDRESS = {Alexandria, VA, USA},
}