{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T04:10:28Z","timestamp":1728101428355},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00493-021-4846-5","type":"journal-article","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T18:02:47Z","timestamp":1663783367000},"page":"1027-1048","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Realizing an m-Uniform Four-Chromatic Hypergraph with Disks"],"prefix":"10.1007","volume":"42","author":[{"given":"G\u00e1bor","family":"Dam\u00e1sdi","sequence":"first","affiliation":[]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"key":"4846_CR1","doi-asserted-by":"publisher","first-page":"2250","DOI":"10.1137\/19M1290231","volume":"34","author":"E Ackerman","year":"2020","unstructured":"E. Ackerman, B. Keszegh and D. P\u00e1lv\u00f6lgyi: Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs, SIAM Journal on Discrete Mathematics 34 (2020), 2250\u20132269.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"4846_CR2","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00454-017-9902-y","volume":"58","author":"E Ackerman","year":"2017","unstructured":"E. Ackerman, B. Keszegh and M. Vizer: Coloring points with respect to squares, Discrete & Computational Geometry 58 (2017), 757\u2013784.","journal-title":"Discrete & Computational Geometry"},{"key":"4846_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0095-8956(02)00006-0","volume":"87","author":"N Alon","year":"2003","unstructured":"N. Alon, G. Ding, B. Oporowski and D. Vertigan: Partitioning into graphs with only small components, J. Combin. Theory Ser. B 87 (2003), 231\u2013243.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4846_CR4","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-40104-6_7","volume-title":"Algorithms and data structures","author":"A Asinowski","year":"2013","unstructured":"A. Asinowski, J. Cardinal, N. Cohen, S. Collette, T. Hackl, M. Hoffmann, K. Knauer, S. Langerman, M. Laso\u0144, P. Micek, G. Rote and T. Ueckerdt: Coloring hypergraphs induced by dynamic point sets and bottomless rectangles, in: Algorithms and data structures, volume 8037 of Lecture Notes in Comput. Sci., pages 73\u201384. Springer, Heidelberg, 2013."},{"key":"4846_CR5","first-page":"240","volume":"4","author":"J Cardinal","year":"2013","unstructured":"J. Cardinal, K. Knauer, P. Micek and T. Ueckerdt: Making triangles colorful, J. Comput. Geom. 4 (2013), 240\u2013246.","journal-title":"J. Comput. Geom."},{"key":"4846_CR6","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1017\/S0963548314000170","volume":"23","author":"L Esperet","year":"2014","unstructured":"L. Esperet and G. Joret: Colouring planar graphs with three colours and no large monochromatic components, Combin. Probab. Comput. 23 (2014), 551\u2013570.","journal-title":"Combin. Probab. Comput."},{"key":"4846_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00454-011-9353-9","volume":"46","author":"M Gibson","year":"2011","unstructured":"M. Gibson and K. Varadarajan: Optimally decomposing coverings with translates of a convex polygon, Discrete Comput. Geom. 46 (2011), 313\u2013333.","journal-title":"Discrete Comput. Geom."},{"key":"4846_CR8","first-page":"187","volume-title":"Extremum problems with inequalities as subsidiary conditions, Studies and Essays Presented to R. Courant on his 60th Birthday, January 8, 1948","author":"F John","year":"1948","unstructured":"F. John: Extremum problems with inequalities as subsidiary conditions, Studies and Essays Presented to R. Courant on his 60th Birthday, January 8, 1948, Interscience Publishers, Inc., New York, N. Y., 1948, 187\u2013204."},{"key":"4846_CR9","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.comgeo.2011.09.004","volume":"45","author":"B Keszegh","year":"2012","unstructured":"B. Keszegh: Coloring half-planes and bottomless rectangles, Computational geometry 45 (2012), 495\u2013507.","journal-title":"Computational geometry"},{"key":"4846_CR10","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/s00454-011-9377-1","volume":"47","author":"B Keszegh","year":"2012","unstructured":"B. Keszegh and D. P\u00e1lv\u00f6lgyi: Octants are cover decomposable, Discrete Comput. Geom. 47 (2012), 598\u2013609.","journal-title":"Discrete Comput. Geom."},{"key":"4846_CR11","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00454-014-9582-9","volume":"51","author":"B Keszegh","year":"2014","unstructured":"B. Keszegh and D. P\u00e1lv\u00f6lgyi: Convex polygons are self-coverable, Discrete Comput. Geom. 51 (2014), 885\u2013895.","journal-title":"Discrete Comput. Geom."},{"key":"4846_CR12","first-page":"300","volume":"6","author":"B Keszegh","year":"2019","unstructured":"B. Keszegh and D. P\u00e1lv\u00f6lgyi: More on decomposing coverings by octants, J. Comput. Geom. 6 (2019), 300\u2013315.","journal-title":"J. Comput. Geom."},{"key":"4846_CR13","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/s00454-019-00096-9","volume":"62","author":"B Keszegh","year":"2019","unstructured":"B. Keszegh and D. P\u00e1lv\u00f6lgyi: Proper coloring of geometric hypergraphs, Discrete Comput. Geom. 62 (2019), 674\u2013689.","journal-title":"Discrete Comput. Geom."},{"key":"4846_CR14","first-page":"1","volume":"10","author":"B Keszegh","year":"2019","unstructured":"B. Keszegh and D. P\u00e1lv\u00f6lgyi: An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes, J. Comput. Geom. 10 (2019), 1\u201326.","journal-title":"J. Comput. Geom."},{"key":"4846_CR15","doi-asserted-by":"crossref","unstructured":"J. M. Kleinberg, R. Motwani, P. Raghavan and S. Venkatasubramanian: Storage management for evolving databases, in: Proceedings 38th Annual Symposium on Foundations of Computer Science, pages 353\u2013362, 1997.","DOI":"10.1109\/SFCS.1997.646124"},{"key":"4846_CR16","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/s00454-015-9687-9","volume":"53","author":"I Kov\u00e1cs","year":"2015","unstructured":"I. Kov\u00e1cs: Indecomposable coverings with homothetic polygons, Discrete & Computational Geometry 53 (2015), 817\u2013824.","journal-title":"Discrete & Computational Geometry"},{"key":"4846_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.endm.2007.07.020","volume":"29","author":"N Linial","year":"2007","unstructured":"N. Linial, J. Matou\u0161ek, O. Sheffet and G. Tardos: Graph coloring with no large monochromatic components, Electronic Notes in Discrete Mathematics 29 115\u2013122, 2007. European Conference on Combinatorics, Graph Theory and Applications.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"4846_CR18","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1007\/s00493-019-3848-z","volume":"39","author":"S Norin","year":"2019","unstructured":"S. Norin, A. Scott, P. D. Seymour and D. R. Wood: Clustered colouring in minor-closed classes, Combinatorica 39 (2019), 1387\u20131412.","journal-title":"Combinatorica"},{"key":"4846_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02187684","volume":"1","author":"J Pach","year":"1986","unstructured":"J. Pach: Covering the plane with convex polygons, Discrete Comput. Geom. 1 (1986), 73\u201381.","journal-title":"Discrete Comput. Geom."},{"key":"4846_CR20","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.aim.2016.07.011","volume":"302","author":"J Pach","year":"2016","unstructured":"J. Pach and D. P\u00e1lv\u00f6lgyi: Unsplittable coverings in the plane, Advances in Mathematics 302 (2016), 433\u2013457.","journal-title":"Advances in Mathematics"},{"key":"4846_CR21","doi-asserted-by":"crossref","unstructured":"J. Pach, D. P\u00e1lv\u00f6lgyi and G. T\u00f3th: Survey on decomposition of multiple coverings, in: Geometry-Intuitive, Discrete, and Convex, 219\u2013257. Springer, 2013.","DOI":"10.1007\/978-3-642-41498-5_9"},{"key":"4846_CR22","doi-asserted-by":"crossref","unstructured":"J. Pach, G. Tardos and G. T\u00f3th: Indecomposable coverings, In Discrete geometry, combinatorics and graph theory, volume 4381 of Lecture Notes in Comput. Sci., pages 135\u2013148. Springer, Berlin, 2007.","DOI":"10.1007\/978-3-540-70666-3_15"},{"key":"4846_CR23","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s00454-009-9194-y","volume":"44","author":"D P\u00e1lv\u00f6lgyi","year":"2010","unstructured":"D. P\u00e1lv\u00f6lgyi: Indecomposable coverings with concave polygons, Discrete Comput. Geom. 44 (2010), 577\u2013588.","journal-title":"Discrete Comput. Geom."},{"key":"4846_CR24","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00454-009-9133-y","volume":"43","author":"D P\u00e1lv\u00f6lgyi","year":"2010","unstructured":"D. P\u00e1lv\u00f6lgyi and G. T\u00f3th: Convex polygons are cover-decomposable, Discrete & Computational Geometry 43 (2010), 483\u2013496.","journal-title":"Discrete & Computational Geometry"},{"key":"4846_CR25","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jcta.2011.07.001","volume":"119","author":"S Smorodinsky","year":"2012","unstructured":"S. Smorodinsky and Y. Yuditsky: Polychromatic coloring for half-planes, J. Combin. Theory Ser. A 119 (2012), 146\u2013154.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4846_CR26","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00454-007-1345-4","volume":"38","author":"G Tardos","year":"2007","unstructured":"G. Tardos and G. T\u00f3th: Multiple coverings of the plane with triangles, Discrete & Computational Geometry 38 (2007), 443\u2013450.","journal-title":"Discrete & Computational Geometry"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4846-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-021-4846-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4846-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T08:17:32Z","timestamp":1728029852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-021-4846-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,21]]},"references-count":26,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4846"],"URL":"https:\/\/doi.org\/10.1007\/s00493-021-4846-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2022,9,21]]},"assertion":[{"value":"26 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}