{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:49:11Z","timestamp":1787500151963,"version":"build-2736575974"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,1,8]],"date-time":"2010-01-08T00:00:00Z","timestamp":1262908800000},"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":[[2010,10]]},"DOI":"10.1007\/s00454-009-9238-3","type":"journal-article","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T11:40:19Z","timestamp":1262864419000},"page":"706-723","source":"Crossref","is-referenced-by-count":14,"title":["Decomposition of Multiple Coverings into More Parts"],"prefix":"10.1007","volume":"44","author":[{"given":"Greg","family":"Aloupis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean","family":"Cardinal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e9bastien","family":"Collette","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Orden","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pedro","family":"Ramos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,1,8]]},"reference":[{"key":"9238_CR1","unstructured":"Ali Abam, M., de Berg, M., Poon, S.: Fault-tolerant conflict-free coloring. In: Proceedings of the Canadian Conference on Computational Geometry (CCCG\u201908) (2008)"},{"key":"9238_CR2","unstructured":"Abellanas, M., Bose, P., Garcia, J., Hurtado, F., Nicolas, C., Ramos, P.: On properties of higher order Delaunay graphs with applications. Int. J. Comput. Geom. Appl. (to appear)"},{"key":"9238_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-540-78773-0_13","volume-title":"Proceedings of the 8th Latin American Theoretical Informatics (LATIN\u201908)","author":"G. Aloupis","year":"2008","unstructured":"Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Smorodinsky, S.: Coloring geometric range spaces. In: Proceedings of the 8th Latin American Theoretical Informatics (LATIN\u201908). Lecture Notes in Computer Science, vol.\u00a04957, pp. 146\u2013157. Springer, Berlin (2008)"},{"key":"9238_CR4","volume-title":"Research Problems in Discrete Geometry","author":"P. Brass","year":"2005","unstructured":"Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer, Berlin (2005)"},{"key":"9238_CR5","unstructured":"Buchsbaum, A., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907), pp. 1056\u20131063 (2007)"},{"key":"9238_CR6","doi-asserted-by":"crossref","unstructured":"Elekes, M., Matrai, T., Soukup, L.: On splitting infinite-fold covers. Fundam. Math. (to appear)","DOI":"10.4064\/fm212-2-1"},{"issue":"1","key":"9238_CR7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1137\/S0097539702431840","volume":"33","author":"G. Even","year":"2004","unstructured":"Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM J. Comput. 33(1), 94\u2013136 (2004)","journal-title":"SIAM J. Comput."},{"key":"9238_CR8","doi-asserted-by":"crossref","unstructured":"Gibson, M., Varadarajan, K.: Decomposing coverings and the planar sensor cover problem. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS09) (2009)","DOI":"10.1109\/FOCS.2009.54"},{"key":"9238_CR9","unstructured":"Mani, P., Pach, J.: Decomposition problems for multiple coverings with unit balls. Unpublished manuscript (1986)"},{"key":"9238_CR10","first-page":"169","volume-title":"2. Kolloq. \u00fcber Diskrete Geom.","author":"J. Pach","year":"1980","unstructured":"Pach, J.: Decomposition of multiple packing and covering. In: 2. Kolloq. \u00fcber Diskrete Geom., pp.\u00a0169\u2013178. Inst. Math. Univ. Salzburg, Salzburg (1980)"},{"key":"9238_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02187684","volume":"1","author":"J. Pach","year":"1986","unstructured":"Pach, J.: Covering the plane with convex polygons. Discrete Comput. Geom. 1, 73\u201381 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9238_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-540-70666-3_15","volume-title":"The China\u2013Japan Joint Conference on Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT\u201905)","author":"J. Pach","year":"2007","unstructured":"Pach, J., Tardos, G., T\u00f3th, G.: Indecomposable coverings. In: The China\u2013Japan Joint Conference on Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT\u201905). Lecture Notes in Computer Science, vol.\u00a04381, pp. 135\u2013148. Springer, Berlin (2007)"},{"issue":"2","key":"9238_CR13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.comgeo.2008.08.002","volume":"42","author":"J. Pach","year":"2009","unstructured":"Pach, J., T\u00f3th, G.: Decomposition of multiple coverings into many parts. Comput. Geom. Theory Appl. 42(2), 127\u2013133 (2009)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9238_CR14","doi-asserted-by":"crossref","unstructured":"P\u00e1lv\u00f6lgyi, D.: Indecomposable coverings with concave polygons. Discrete Comput. Geom. (to appear)","DOI":"10.1007\/s00454-009-9194-y"},{"key":"9238_CR15","doi-asserted-by":"crossref","unstructured":"P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Convex polygons are cover-decomposable. Discrete Comput. Geom. (to appear)","DOI":"10.1007\/s00454-009-9133-y"},{"issue":"2","key":"9238_CR16","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s00454-007-1345-4","volume":"38","author":"G. Tardos","year":"2007","unstructured":"Tardos, G., T\u00f3th, G.: 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-009-9238-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-009-9238-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9238-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:50:31Z","timestamp":1559073031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-009-9238-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,8]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9238"],"URL":"https:\/\/doi.org\/10.1007\/s00454-009-9238-3","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,8]]}}}