{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T21:17:55Z","timestamp":1781644675297,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662483497","type":"print"},{"value":"9783662483503","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_72","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T21:40:34Z","timestamp":1441057234000},"page":"865-877","source":"Crossref","is-referenced-by-count":45,"title":["Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams"],"prefix":"10.1007","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"72_CR1","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Wiese, A.: Approximation schemes for maximum weight independent set of rectangles. In: FOCS, pp. 400\u2013409 (2013)","DOI":"10.1109\/FOCS.2013.50"},{"key":"72_CR2","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Wiese, A.: A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices. In: SODA, pp. 645\u2013656 (2014)","DOI":"10.1137\/1.9781611973402.49"},{"issue":"3","key":"72_CR3","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1137\/S0097539704446591","volume":"36","author":"P.K. Agarwal","year":"2006","unstructured":"Agarwal, P.K., Overmars, M.H., Sharir, M.: Computing maximally separated sets in the plane. SIAM J. Comput.\u00a036(3), 815\u2013834 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"72_CR4","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2003.10.001","volume":"52","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms\u00a052(2), 134\u2013151 (2004)","journal-title":"J. Algorithms"},{"key":"72_CR5","doi-asserted-by":"crossref","unstructured":"Chitnis, R.H., Hajiaghayi, M., Marx, D.: Tight bounds for Planar Strongly Connected Steiner Subgraph with fixed number of terminals (and extensions). In: SODA, pp. 1782\u20131801 (2014)","DOI":"10.1137\/1.9781611973402.129"},{"issue":"3","key":"72_CR6","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/bxm033","volume":"51","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. Comput. J.\u00a051(3), 292\u2013302 (2008)","journal-title":"Comput. J."},{"key":"72_CR7","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Quasi-polynomial time approximation scheme for sparse subsets of polygons. In: SoCG, pp. 120 (2014)","DOI":"10.1145\/2582112.2582157"},{"issue":"1","key":"72_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01185335","volume":"9","author":"R.Z. Hwang","year":"1993","unstructured":"Hwang, R.Z., Lee, R.C.T., Chang, R.C.: The slab dividing approach to solve the Euclidean p-center problem. Algorithmica\u00a09(1), 1\u201322 (1993)","journal-title":"Algorithmica"},{"key":"72_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-642-31594-7_48","volume-title":"Automata, Languages, and Programming","author":"P.N. Klein","year":"2012","unstructured":"Klein, P.N., Marx, D.: Solving Planar \n\t\t\t\t\tk\n\t\t\t\t\t-Terminal Cut in \n                    \n                      \n                    \n                    $O(n^{c \\sqrt{k}})$\n                   Time. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol.\u00a07391, pp. 569\u2013580. Springer, Heidelberg (2012)"},{"key":"72_CR10","doi-asserted-by":"crossref","unstructured":"Klein, P.N., Marx, D.: A subexponential parameterized algorithm for Subset TSP on planar graphs. In: SODA, pp. 1812\u20131830 (2014)","DOI":"10.1137\/1.9781611973402.131"},{"key":"72_CR11","doi-asserted-by":"crossref","unstructured":"Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. CoRR, abs\/1504.05476 (2015)","DOI":"10.1007\/978-3-662-48350-3_72"},{"key":"72_CR12","doi-asserted-by":"crossref","unstructured":"Marx, D., Sidiropoulos, A.: The limited blessing of low dimensionality: when 1\u2009\u2212\u20091\/d is the best possible exponent for d-dimensional geometric problems. In: SoCG, p.\u00a067 (2014)","DOI":"10.1145\/2582112.2582124"},{"key":"72_CR13","unstructured":"Mustafa, N.H., Raman, R., Ray, S.: QPTAS for geometric set-cover problems via optimal separators. CoRR, abs\/1403.0835 (2014)"},{"key":"72_CR14","doi-asserted-by":"crossref","unstructured":"Pilipczuk, M., Pilipczuk, M., Sankowski, P., van Leeuwen, E.J.: Network sparsification for Steiner problems on planar and bounded-genus graphs. In: FOCS, pp. 276\u2013285. IEEE Computer Society (2014)","DOI":"10.1109\/FOCS.2014.37"},{"key":"72_CR15","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, M., Williams, R.: On the possibility of faster SAT algorithms. In: SODA, pp. 1065\u20131075 (2010)","DOI":"10.1137\/1.9781611973075.86"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T16:20:54Z","timestamp":1559233254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}