{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T18:57:21Z","timestamp":1770490641434,"version":"3.49.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Fundacja na rzecz Nauki Polskiej","award":["UMO- 2013\/11\/D\/ST6\/03073"],"award-info":[{"award-number":["UMO- 2013\/11\/D\/ST6\/03073"]}]},{"name":"European Research Council","award":["677651"],"award-info":[{"award-number":["677651"]}]},{"name":"Conicyt","award":["1170223"],"award-info":[{"award-number":["1170223"]}]},{"name":"Millenium Initiative","award":["ICM\/FIC RC130003"],"award-info":[{"award-number":["ICM\/FIC RC130003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00453-019-00670-w","type":"journal-article","created":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T08:02:43Z","timestamp":1578902563000},"page":"1703-1739","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs"],"prefix":"10.1007","volume":"82","author":[{"given":"Micha\u0142","family":"Pilipczuk","sequence":"first","affiliation":[]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7814-8775","authenticated-orcid":false,"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,13]]},"reference":[{"key":"670_CR1","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Wiese, A.: Approximation schemes for maximum weight independent set of rectangles. In: Proceedings of the FOCS 2013, pp. 400\u2013409. IEEE (2013)","DOI":"10.1109\/FOCS.2013.50"},{"key":"670_CR2","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Wiese, A.: A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices. In: Proceedings of the SODA 2014, pp. 645\u2013656. SIAM (2014)","DOI":"10.1137\/1.9781611973402.49"},{"issue":"3","key":"670_CR3","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s00453-012-9627-5","volume":"64","author":"Q-P Gu","year":"2012","unstructured":"Gu, Q.-P., Tamaki, H.: Improved bounds on the planar branchwidth with respect to the largest grid minor size. Algorithmica 64(3), 416\u2013453 (2012)","journal-title":"Algorithmica"},{"key":"670_CR4","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Quasi-polynomial time approximation scheme for sparse subsets of polygons. In: Proceedings of the SOCG 2014, pp. 120\u2013129. SIAM (2014)","DOI":"10.1145\/2582112.2582157"},{"key":"670_CR5","doi-asserted-by":"crossref","unstructured":"Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. In: Proceedings of the ESA 2015, Volume 9294 of LNCS, pp. 865\u2013877. Springer (2015)","DOI":"10.1007\/978-3-662-48350-3_72"},{"issue":"3","key":"670_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"GL Miller","year":"1986","unstructured":"Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci. 32(3), 265\u2013279 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"670_CR7","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1137\/14099317X","volume":"44","author":"NH Mustafa","year":"2015","unstructured":"Mustafa, N.H., Raman, R., Ray, S.: Quasi-polynomial time approximation scheme for weighted geometric set cover on pseudodisks and halfspaces. SIAM J. Comput. 44(6), 1650\u20131669 (2015)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"670_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"PD Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217\u2013241 (1994)","journal-title":"Combinatorica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00670-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00670-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00670-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,12]],"date-time":"2021-01-12T21:12:33Z","timestamp":1610485953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00670-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,13]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["670"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00670-w","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,13]]},"assertion":[{"value":"7 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}