{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:23:13Z","timestamp":1760440993047},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,6,29]],"date-time":"2011-06-29T00:00:00Z","timestamp":1309305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s00454-011-9353-9","type":"journal-article","created":{"date-parts":[[2011,6,29]],"date-time":"2011-06-29T13:05:54Z","timestamp":1309352754000},"page":"313-333","source":"Crossref","is-referenced-by-count":12,"title":["Optimally Decomposing Coverings with Translates of a Convex Polygon"],"prefix":"10.1007","volume":"46","author":[{"given":"Matt","family":"Gibson","sequence":"first","affiliation":[]},{"given":"Kasturi","family":"Varadarajan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,29]]},"reference":[{"key":"9353_CR1","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1137\/1.9781611973068.34","volume-title":"SODA\u201909: Proceedings of the Nineteenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms","author":"G. Aloupis","year":"2009","unstructured":"Aloupis,\u00a0G., Cardinal,\u00a0J., Collette,\u00a0S., Langerman,\u00a0S., Orden,\u00a0D., Ramos,\u00a0P.: Decomposition of multiple coverings into more parts. In: SODA\u201909: Proceedings of the Nineteenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 302\u2013310. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"key":"9353_CR2","first-page":"1056","volume-title":"SODA\u201907: Proceedings of the Eighteenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms","author":"A.L. Buchsbaum","year":"2007","unstructured":"Buchsbaum, A.L., Efrat,\u00a0A., Jain,\u00a0S., Venkatasubramanian,\u00a0S., Yi,\u00a0K.: Restricted strip covering and the sensor cover problem. In: SODA\u201907: Proceedings of the Eighteenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 1056\u20131063. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"9353_CR3","unstructured":"Mani,\u00a0P., Pach,\u00a0J.: Decomposition problems for multiple coverings with unit balls. Manuscript (1986)"},{"key":"9353_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02187684","volume":"1","author":"J. Pach","year":"1986","unstructured":"Pach,\u00a0J.: Covering the plane with convex polygons. Discrete Comput. Geom. 1, 73\u201381 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9353_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.comgeo.2008.08.002","volume":"42","author":"J. Pach","year":"2009","unstructured":"Pach,\u00a0J., T\u00f3th,\u00a0G.: Decomposition of multiple coverings into many parts. Comput. Geom. 42(2), 127\u2013133 (2009)","journal-title":"Comput. Geom."},{"key":"9353_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/b105810","volume-title":"CJCDGCGT","author":"J. Pach","year":"2005","unstructured":"Pach,\u00a0J., Tardos,\u00a0G., T\u00f3th,\u00a0G.: Indecomposable coverings. In: Akiyama,\u00a0J., Chen, W.Y.C., Kano,\u00a0M., Li,\u00a0X., Yu,\u00a0Q. (eds.) CJCDGCGT. Lecture Notes in Computer Science, vol.\u00a04381, pp.\u00a0135\u2013148. Springer, Berlin (2005)"},{"issue":"3","key":"9353_CR7","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/s00454-009-9194-y","volume":"44","author":"D. P\u00e1lv\u00f6lgyi","year":"2010","unstructured":"P\u00e1lv\u00f6lgyi,\u00a0D.: Indecomposable coverings with concave polygons. Discrete Comput. Geom. 44(3), 577\u2013588 (2010). doi: 10.1007\/s00454-009-9194-y","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"9353_CR8","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s00454-009-9133-y","volume":"43","author":"D. P\u00e1lv\u00f6lgyi","year":"2010","unstructured":"P\u00e1lv\u00f6lgyi,\u00a0D., T\u00f3th,\u00a0G.: Convex polygons are cover-decomposable. Discrete Comput. Geom. 43(3), 483\u2013496 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"9353_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/978-3-642-03685-9_24","volume-title":"APPROX-RANDOM","author":"S. Pandit","year":"2009","unstructured":"Pandit,\u00a0S., Pemmaraju, S.V., Varadarajan, K.R.: Approximation algorithms for domatic partitions of unit disk graphs. In: Dinur,\u00a0I., Jansen,\u00a0K., Naor,\u00a0J., Rolim, J.D.P. (eds.) APPROX-RANDOM. Lecture Notes in Computer Science, vol.\u00a05687, pp.\u00a0312\u2013325. Springer, Berlin (2009)"},{"key":"9353_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/1132905.1132922","volume-title":"MobiHoc\u201906: Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing","author":"S.V. Pemmaraju","year":"2006","unstructured":"Pemmaraju, S.V., Pirwani, I.A.: Energy conservation via domatic partitions. In: MobiHoc\u201906: Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 143\u2013154. ACM, New York (2006)"},{"issue":"2","key":"9353_CR11","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s00454-007-1345-4","volume":"38","author":"G. Tardos","year":"2007","unstructured":"Tardos,\u00a0G., T\u00f3th,\u00a0G.: Multiple coverings of the plane with triangles. Discrete Comput. Geom. 38(2), 443\u2013450 (2007)","journal-title":"Discrete Comput. Geom."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9353-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-011-9353-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9353-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T21:44:07Z","timestamp":1686174247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-011-9353-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,29]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["9353"],"URL":"https:\/\/doi.org\/10.1007\/s00454-011-9353-9","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,29]]}}}