{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:21:49Z","timestamp":1760440909415},"publisher-location":"Berlin, Heidelberg","reference-count":26,"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_11","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"105-117","source":"Crossref","is-referenced-by-count":11,"title":["Conflict-Free Coloring Made Stronger"],"prefix":"10.1007","author":[{"given":"Elad","family":"Horev","sequence":"first","affiliation":[]},{"given":"Roi","family":"Krakovski","sequence":"additional","affiliation":[]},{"given":"Shakhar","family":"Smorodinsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Abam, M.A., de Berg, M., Poon, S.-H.: Fault-tolerant conflict-free coloring. In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montreal, Canada, August 13-15 (2008)"},{"key":"11_CR2","unstructured":"Abellanas, M., Bose, P., Garcia, J., Hurtado, F., Nicolas, M., Ramos, P.A.: On properties of higher order delaunay graphs with applications. In: EWCG (2005)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Ajwani, D., Elbassioni, K., Govindarajan, S., Ray, S.: Conflict-free coloring for rectangle ranges using $\\tilde{O}(n^{.382 + \\epsilon})$ colors. In: SPAA \u201907: Proc. 19th ACM Symp. on Parallelism in Algorithms and Architectures, pp. 181\u2013187 (2007)","DOI":"10.1145\/1248377.1248406"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Smorodinsky, S.: Conflict-free colorings of shallow discs. In: SoCG \u201906: Proc. 22nd Annual ACM Symposium on Computational Geometry, pp. 41\u201343 (2006)","DOI":"10.1145\/1137856.1137864"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-78773-0_13","volume-title":"LATIN 2008: Theoretical Informatics","author":"G. Aloupis","year":"2008","unstructured":"Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Smorodinsky, S.: Coloring geometric range spaces. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 146\u2013157. Springer, Heidelberg (2008)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-73420-8_21","volume-title":"Automata, Languages and Programming","author":"A. Bar-Noy","year":"2007","unstructured":"Bar-Noy, A., Cheilaris, P., Olonetsky, S., Smorodinsky, S.: Online conflict-free colorings for hypergraphs. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 219\u2013230. Springer, Heidelberg (2007)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Cheilaris, P., Olonetsky, S., Smorodinsky, S.: Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. In: SPAA, pp. 194\u2013195 (2007)","DOI":"10.1145\/1248377.1248409"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/1148109.1148133","volume-title":"SPAA \u201906: Proceedings of The Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures","author":"A. Bar-Noy","year":"2006","unstructured":"Bar-Noy, A., Cheilaris, P., Smorodinsky, S.: Conflict-free coloring for intervals: from offline to online. In: SPAA \u201906: Proceedings of The Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 128\u2013137. ACM Press, New York (2006)"},{"key":"11_CR9","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1985","unstructured":"Berge, C.: Graphs and Hypergraphs. Elsevier Science Ltd., Amsterdam (1985)"},{"key":"11_CR10","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":"11_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/050633263","volume":"36","author":"K. Chen","year":"2006","unstructured":"Chen, K., Fiat, A., Levy, M., Matou\u0161ek, J., Mossel, E., Pach, J., Sharir, M., Smorodinsky, S., Wagner, U., Welzl, E.: Online conflict-free coloring for intervals. SIAM J. Comput.\u00a036, 545\u2013554 (2006); See also in Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (2005)","journal-title":"SIAM J. Comput."},{"key":"11_CR12","unstructured":"Chen, K., Kaplan, H., Sharir, M.: Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles (manuscript, 2005)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Chen, X., Pach, J., Szegedy, M., Tardos, G.: Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. In: SODA, pp. 94\u2013101 (2008)","DOI":"10.1002\/rsa.20246"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Efrat, A.: The complexity of the union of (\u03b1,\u03b2)-covered objects. In: Proc. 15th Annu. ACM Sympos. Comput. Geom., pp. 134\u2013142 (1999)","DOI":"10.1145\/304893.304958"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/PL00009494","volume":"23","author":"A. Efrat","year":"2000","unstructured":"Efrat, A., Sharir, M.: On the complexity of the union of fat convex objects in the plane. Discrete and Comput. Geom.\u00a023, 171\u2013189 (2000)","journal-title":"Discrete and Comput. Geom."},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11672142_20","volume-title":"STACS 2006","author":"K. Elbassioni","year":"2006","unstructured":"Elbassioni, K., Mustafa, N.: Conflict-free colorings of rectangles ranges. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 254\u2013263. Springer, Heidelberg (2006)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1137\/S0097539702431840","volume":"33","author":"G. Even","year":"2003","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.\u00a033, 94\u2013136 (2003); See also in Proc. 43rd Annual Symposium on Foundations of Computer Science (2002)","journal-title":"SIAM J. Comput."},{"key":"11_CR18","unstructured":"Gupta, H.: Personal Communication (2006)"},{"key":"#cr-split#-11_CR19.2","unstructured":"See also in 19th Annual Symposium on Computational Geometry (2003)"},{"key":"11_CR20","unstructured":"Katz, M., Lev-Tov, N., Morgenstern, G.: Conflict-free coloring of points on a line with respect to a set of intervals. In: CCCG \u201907: Proc. 19th Canadian Conference on Computational Geometry (2007)"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"Kedem, K., Livne, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom.\u00a01, 59\u201371 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Pach, J., Tardos, G.: Coloring axis-parallel rectangles. J. Combin. Theory Ser. A (2009)","DOI":"10.1007\/978-3-540-89550-3_19"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Pach, J., T\u00f3th, G.: Conflict free colorings. Discrete and Computational Geometry, The Goodman-Pollack Festschrift, 665\u2013671 (2003)","DOI":"10.1007\/978-3-642-55566-4_30"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Pach, J., T\u00f3th, G.: Decomposition of multiple coverings into many parts. In: Symposium on Computational Geometry, pp. 133\u2013137 (2007)","DOI":"10.1145\/1247069.1247096"},{"key":"11_CR25","volume-title":"Davenport\u2013Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport\u2013Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)"},{"key":"11_CR26","doi-asserted-by":"publisher","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 Journal on Discrete Mathematics\u00a021, 676\u2013687 (2007); See also in Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (2006)","journal-title":"SIAM Journal on Discrete Mathematics"}],"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_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T14:26:40Z","timestamp":1711549600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}