{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:35:24Z","timestamp":1726410924438},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_19","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T14:50:06Z","timestamp":1470322206000},"page":"266-280","source":"Crossref","is-referenced-by-count":2,"title":["An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes"],"prefix":"10.1007","author":[{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511586507","volume-title":"Oriented Matroids Encyclopedia of Mathematics and Its Applications 46","author":"A Bj\u00f6rner","year":"1999","unstructured":"Bj\u00f6rner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.: Oriented Matroids Encyclopedia of Mathematics and Its Applications 46. Cambridge University Press, Cambridge (1999)"},{"key":"19_CR2","first-page":"240","volume":"4","author":"J Cardinal","year":"2013","unstructured":"Cardinal, J., Knauer, K., Micek, P., Ueckerdt, T.: Making triangles colorful. J. Comput. Geom. 4, 240\u2013246 (2013)","journal-title":"Comput. Geom."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Cardinal, J., Knauer, K., Micek, P., Ueckerdt, T.: Making octants colorful and related covering decomposition problems. In: Proceedings of SODA 2014, pp. 1424\u20131432 (2014)","DOI":"10.1137\/1.9781611973402.105"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00454-007-1336-5","volume":"38","author":"R Dhandapani","year":"2007","unstructured":"Dhandapani, R., Goodman, J.E., Holmsen, A., Pollack, R., Smorodinsky, S.: Convexity in topological affine planes. Discrete Comput. Geom. (DCG) 38, 243\u2013257 (2007)","journal-title":"Discrete Comput. Geom. (DCG)"},{"key":"19_CR5","unstructured":"Fulek, R.: Coloring geometric hypergraph defined by an arrangement of half-planes. In: Proceedings of CCCG 2010, pp. 71\u201374 (2010)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Gibson, M., Varadarajan, K.: Decomposing coverings and the planar sensor cover problem. In: Proceedings of FOCS 2009, pp. 159\u2013168 (2009)","DOI":"10.1109\/FOCS.2009.54"},{"key":"19_CR7","unstructured":"Keszegh, B.: Weak conflict free colorings of point sets and simple regions. In: Proceedings of CCCG 2007, pp. 97\u2013100 (2007)"},{"issue":"9","key":"19_CR8","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.comgeo.2011.09.004","volume":"45","author":"B Keszegh","year":"2012","unstructured":"Keszegh, B.: Coloring half-planes and bottomless rectangles. Comput. Geom. Theory Appl. 45(9), 495\u2013507 (2012). Elsevier","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"19_CR9","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1007\/s00454-011-9377-1","volume":"47","author":"B Keszegh","year":"2012","unstructured":"Keszegh, B., P\u00e1lv\u00f6lgyi, D.: Octants are cover decomposable. Discrete Comput. Geom. 47(3), 598\u2013609 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"19_CR10","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.comgeo.2013.12.001","volume":"47","author":"B Keszegh","year":"2014","unstructured":"Keszegh, B., P\u00e1lv\u00f6lgyi, D.: Octants are cover decomposable into many coverings. Comput. Geom. Theory Appl. 47(5), 585\u2013588 (2014)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"19_CR11","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1007\/s00454-014-9582-9","volume":"51","author":"B Keszegh","year":"2014","unstructured":"Keszegh, B., P\u00e1lv\u00f6lgyi, D.: Convex polygons are self-coverable. Discrete Comput. Geom. 51(4), 885\u2013895 (2014)","journal-title":"Discrete Comput. Geom."},{"key":"19_CR12","unstructured":"Kov\u00e1cs, I.: Indecomposable coverings with homothetic polygons. arXiv:1312.4597"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Survey on decomposition of multiple coverings. In: B\u00e1r\u00e1ny, I., B\u00f6r\u00f6czky, K.J., Fejes T\u00f3th, G., Pach, J. (eds.) Geometry-Intuitive, Discrete, and Convex. Bolyai Society Mathematical Studies, vol. 24, pp. 219\u2013257. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-41498-5_9"},{"issue":"3","key":"19_CR14","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, D.: Indecomposable coverings with concave polygons. Discrete Comput. Geom. 44(3), 577\u2013588 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"19_CR15","unstructured":"P\u00e1lv\u00f6lgyi, D.: Decomposition of Geometric Set Systems and Graphs. Ph.D. thesis (2010). arXiv:1009.4641"},{"key":"19_CR16","unstructured":"P\u00e1lv\u00f6lgyi, D.: Indecomposable coverings with unit discs (2013). arXiv:1310.6900"},{"issue":"3","key":"19_CR17","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, D., T\u00f3th, G.: Convex polygons are cover-decomposable. Discrete Comput. Geom. 43(3), 483\u2013496 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Smorodinsky, S.: Conflict-free coloring and its applications. In: B\u00e1r\u00e1ny, I., B\u00f6r\u00f6czky, K.J., Fejes T\u00f3th, G., Pach, J. (eds.) Geometry-Intuitive, Discrete, and Convex. Bolyai Society Mathematical Studies, vol. 24. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-41498-5_12"},{"issue":"1","key":"19_CR19","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.jcta.2011.07.001","volume":"119","author":"S Smorodinsky","year":"2012","unstructured":"Smorodinsky, S., Yuditsky, Y.: Polychromatic coloring for half-planes. J. Comb. Theory Ser. A 119(1), 146\u2013154 (2012)","journal-title":"J. Comb. Theory Ser. A"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T14:01:02Z","timestamp":1692453662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}