{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T18:53:47Z","timestamp":1784660027823,"version":"3.55.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,17]],"date-time":"2011-03-17T00:00:00Z","timestamp":1300320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s00373-011-1014-5","type":"journal-article","created":{"date-parts":[[2011,3,16]],"date-time":"2011-03-16T05:23:39Z","timestamp":1300253019000},"page":"327-339","source":"Crossref","is-referenced-by-count":6,"title":["Colorful Strips"],"prefix":"10.1007","volume":"27","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":"Shinji","family":"Imahori","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oded","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shakhar","family":"Smorodinsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Perouz","family":"Taslakian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,3,17]]},"reference":[{"issue":"6","key":"1014_CR1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0020-0190(02)00446-5","volume":"85","author":"N. Alon","year":"2003","unstructured":"Alon N.: A simple algorithm for edge-coloring bipartite multigraphs. Inf. Proc. Lett. 85(6), 301\u2013302 (2003). doi: 10.1016\/S0020-0190(02)00446-5","journal-title":"Inf. Proc. Lett."},{"key":"1014_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon N., Spencer J.: The Probabilistic Method, 2nd edn. John Wiley, New York (2000)","edition":"2"},{"key":"1014_CR3","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: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA\u201909) (2009)","DOI":"10.1137\/1.9781611973068.34"},{"issue":"2","key":"1014_CR4","doi-asserted-by":"crossref","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. Discret. Comput. Geom. 41(2), 348\u2013362 (2009)","journal-title":"Discret. Comput. Geom."},{"key":"1014_CR5","first-page":"7","volume":"52","author":"B. Alspach","year":"2008","unstructured":"Alspach B.: The wonderful walecki construction. Bull. Inst. Combin. Appl. 52, 7\u201320 (2008)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1014_CR6","unstructured":"Buchsbaum, A., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907) (2007)"},{"issue":"1","key":"1014_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R. Cole","year":"2001","unstructured":"Cole R., Ost K., Schirra S.: Edge-coloring bipartite multigraphs in O(Elog D) time. Combinatorica 21(1), 5\u201312 (2001)","journal-title":"Combinatorica"},{"issue":"1","key":"1014_CR8","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":"1014_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability : A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"key":"1014_CR10","doi-asserted-by":"crossref","unstructured":"Gibson, M., Varadarajan, K.R.: Decomposing coverings and the planar sensor cover problem. In: FOCS, pp. 159\u2013168. IEEE Computer Society, Washington (2009)","DOI":"10.1109\/FOCS.2009.54"},{"issue":"2","key":"1014_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0095-8956(03)00031-5","volume":"88","author":"P. Haxell","year":"2003","unstructured":"Haxell P., Szab\u00f3 T., Tardos G.: Bounded size components: partitions and transversals. J. Comb. Theory Ser. B 88(2), 281\u2013297 (2003). doi: 10.1016\/S0095-8956(03)00031-5","journal-title":"J. Comb. Theory Ser. B"},{"key":"1014_CR12","unstructured":"Mani, P., Pach, J.: Decomposition problems for multiple coverings with unit balls, (manuscript) (1986)"},{"key":"1014_CR13","doi-asserted-by":"crossref","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general lov\u00e1sz local lemma. J. ACM 57(2) (2010)","DOI":"10.1145\/1667053.1667060"},{"key":"1014_CR14","unstructured":"Pach, J.: Decomposition of multiple packing and covering. In: 2. Kolloq. \u00fcber Diskrete Geom., pp. 169\u2013178. Inst. Math. Univ. Salzburg (1980)"},{"key":"1014_CR15","unstructured":"Pach, J.: Decomposition of multiple packing and covering. In: 2. Kolloquium Uber Diskrete Geometrie, pp. 169\u2013178. Inst. Math. Univ. Salzburg, Salzburg, 1980"},{"key":"1014_CR16","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. Discret. Comput. Geom. 1, 73\u201381 (1986)","journal-title":"Discret. Comput. Geom."},{"key":"1014_CR17","doi-asserted-by":"crossref","unstructured":"Pach, J., Tardos, G., T\u00f3th, G.: Indecomposable coverings. In: The China\u2013Japan Joint Conference on Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT 2005). Lecture Notes in Computer Science, pp. 135\u2013148 (2007)","DOI":"10.1007\/978-3-540-70666-3_15"},{"key":"1014_CR18","doi-asserted-by":"crossref","unstructured":"Pach, J., T\u00f3th, G.: Decomposition of multiple coverings into many parts. In: Proceedings of the ACM Symposium on Computational Geometry, pp. 133\u2013137 (2007)","DOI":"10.1145\/1247069.1247096"},{"key":"1014_CR19","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: STOC, pp. 216\u2013226. ACM (1978)","DOI":"10.1145\/800133.804350"},{"issue":"3","key":"1014_CR20","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/050642368","volume":"21","author":"S. Smorodinsky","year":"2007","unstructured":"Smorodinsky S.: On the chromatic number of some geometric hypergraphs. SIAM J. Discret. Math. 21(3), 676\u2013687 (2007)","journal-title":"SIAM J. Discret. Math."},{"key":"1014_CR21","unstructured":"Stanton, R.G., Cowan, D.D., James, L.O.: Some results on path numbers. In: Louisiana Conference on Combinatorics, Graph Theory and Computing (1970)"},{"issue":"2","key":"1014_CR22","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. Discret. Comput. Geom. 38(2), 443\u2013450 (2007)","journal-title":"Discret. Comput. Geom."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1014-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1014-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1014-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T08:15:02Z","timestamp":1560068102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1014-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,17]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["1014"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1014-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,17]]}}}