{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:58Z","timestamp":1725558418518},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_12","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T07:00:50Z","timestamp":1276153250000},"page":"118-126","source":"Crossref","is-referenced-by-count":0,"title":["Polychromatic Coloring for Half-Planes"],"prefix":"10.1007","author":[{"given":"Shakhar","family":"Smorodinsky","sequence":"first","affiliation":[]},{"given":"Yelena","family":"Yuditsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Aloupis, G., Cardinal, J., Collette, S., Imahori, S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S., Taslakian, P.: Colorful strips. In: LATIN (to appear, 2010)","DOI":"10.1007\/978-3-642-12200-2_2"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D., Ramos, P.: Decomposition of multiple coverings into more parts. In: SODA, pp. 302\u2013310 (2009)","DOI":"10.1137\/1.9781611973068.34"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/s00454-008-9116-4","volume":"41","author":"G. Aloupis","year":"2009","unstructured":"Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Smorodinsky, S.: Coloring geometric range spaces. Discrete & Computational Geometry\u00a041(2), 348\u2013362 (2009)","journal-title":"Discrete & Computational Geometry"},{"key":"12_CR4","unstructured":"Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: SODA, pp. 1056\u20131063 (2007)"},{"key":"12_CR5","unstructured":"Fulek, R.: Coloring geometric hypergraph defined by an arrangement of half-planes (manuscript), http:\/\/dcg.epfl.ch\/page74599.html"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Gibson, M., Varadarajan, K.R.: Decomposing coverings and the planar sensor cover problem. CoRR, abs\/0905.1093 (2009)","DOI":"10.1109\/FOCS.2009.54"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. Discrete & Computational Geometry\u00a02, 127\u2013151 (1987)","journal-title":"Discrete & Computational Geometry"},{"key":"12_CR8","unstructured":"Keszegh, B.: Weak conflict-free colorings of point sets and simple regions. In: CCCG, pp. 97\u2013100 (2007)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02187833","volume":"7","author":"J. Koml\u00f3s","year":"1992","unstructured":"Koml\u00f3s, J., Pach, J., Woeginger, G.J.: Almost tight bounds for epsilon-nets. Discrete & Computational Geometry\u00a07, 163\u2013173 (1992)","journal-title":"Discrete & Computational Geometry"},{"key":"12_CR10","unstructured":"Pach, J.: Decomposition of multiple packing and covering. In: 2 Kolloq. \u00fcber Diskrete Geom., pp. 169\u2013178. Inst. Math. Univ. Salzburg (1980)"},{"key":"12_CR11","unstructured":"Pach, J., Mani, P.: Decomposition problems for multiple coverings with unit balls. Unpublished manuscript (1987)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-70666-3_15","volume-title":"Discrete Geometry, Combinatorics and Graph Theory","author":"J. Pach","year":"2007","unstructured":"Pach, J., Tardos, G., T\u00f3th, G.: Indecomposable coverings. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds.) CJCDGCGT 2005. LNCS, vol.\u00a04381, pp. 135\u2013148. Springer, Heidelberg (2007)"},{"issue":"2","key":"12_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. Computational Geometry. Theory and Applications\u00a042(2), 127\u2013133 (2009)","journal-title":"Computational Geometry. Theory and Applications"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Pach, J., Woeginger, G.: Some new bounds for epsilon-nets. In: SCG, pp. 10\u201315 (1990)","DOI":"10.1145\/98524.98529"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"P\u00e1lv\u00f6lgyi, D.: Indecomposable coverings with concave polygons. Discrete & Computational Geometry (2009)","DOI":"10.1007\/s00454-009-9194-y"},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00454-009-9133-y","volume":"43","author":"D. P\u00e1lv\u00f6lgyi","year":"2010","unstructured":"P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Convex polygons are cover-decomposable. Discrete & Computational Geometry\u00a043(3), 483\u2013496 (2010)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","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 & Computational Geometry\u00a038(2), 443\u2013450 (2007)","journal-title":"Discrete & Computational Geometry"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-50728-0_47","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G.J. Woeginger","year":"1989","unstructured":"Woeginger, G.J.: Epsilon-nets for halfplanes. In: van Leeuwen, J. (ed.) WG 1988. LNCS, vol.\u00a0344, pp. 243\u2013252. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:42:19Z","timestamp":1606167739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}