b'@inproceedings{Cslovjecsek_SODA24b,'b'\nTITLE = {A Polynomial-time $\\mathrm{OPT}^\\epsilon$-Approximation Algorithm for Maximum Independent Set of Connected Subgraphs in a Planar Graph},\nAUTHOR = {Cslovjecsek, Jana and Pilipczuk, Micha{\\l} and W{\\k e}grzycki, Karol},\nLANGUAGE = {eng},\nISBN = {978-1-61197-791-2},\nDOI = {10.1137/1.9781611977912.23},\nPUBLISHER = {SIAM},\nYEAR = {2024},\nMARGINALMARK = {$\\bullet$},\nDATE = {2024},\nBOOKTITLE = {Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2024)},\nEDITOR = {Woodruff, David P.},\nPAGES = {625--638},\nADDRESS = {Alexandria, VA, USA},\n}\n'