{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T08:03:23Z","timestamp":1747469003623,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711461"},{"type":"electronic","value":"9783319711478"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_19","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"276-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On k-Strong Conflict\u2013Free Multicoloring"],"prefix":"10.1007","author":[{"given":"Luisa","family":"Gargano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"key":"19_CR1","unstructured":"Abam, M.A., de Berg, M., Poon, S.H.: Fault-tolerant conflict-free coloring. In: Proceedings of 20th Canadian Conference on Computational Geometry (CCCG) (2008)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1142\/S0218195909003143","volume":"19","author":"M Abellanas","year":"2009","unstructured":"Abellanas, M., Bose, P., Garc\u00eda, J., Hurtado, F., Nicol\u00e1s, C.M., Ramos, P.: On structural and graph theoretic properties of higher order delaunay graphs. Int. J. Comput. Geom. Appl. 19, 595 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0963548300004521","volume":"9","author":"N Alon","year":"2000","unstructured":"Alon, N., Fachini, E., Korner, J.: Locally thin set families. Comb. Probab. Comput. 9, 481\u2013488 (2000)","journal-title":"Comb. Probab. Comput."},{"key":"19_CR4","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N Alon","year":"2008","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization, 3rd edn. John Wiley & Sons Inc., Hoboken (2008)","edition":"3"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-21840-3_9","volume-title":"Algorithms and Data Structures","author":"A B\u00e4rtschi","year":"2015","unstructured":"B\u00e4rtschi, A., Grandoni, F.: On conflict-free multi-coloring. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 103\u2013114. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21840-3_9"},{"key":"19_CR6","unstructured":"de Berg, M., Leijsen, T., van Renssen, A., Roeloffzen, M., Markovic, A., Woeginger, G.: Dynamic and kinetic conflict-free coloring of intervals with respect to points, arXiv preprint arXiv:1701.03388 (2017)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-48169-9_10","volume-title":"Distributed Computing","author":"C Blundo","year":"1999","unstructured":"Blundo, C., Galdi, C., Persiano, P.: Randomness recycling in constant-round private computations. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 140\u2013149. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48169-9_10"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Radhakrishnan, J.: Deterministic restrictions in circuit complexity. In: Proceedings of 28th STOC, pp. 30\u201336 (1996)","DOI":"10.1145\/237814.237824"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/s00453-014-9929-x","volume":"70","author":"P Cheilaris","year":"2014","unstructured":"Cheilaris, P., Gargano, L., Rescigno, A.A., Smorodinsky, S.: Strong conflict-free coloring for intervals. Algorithmica 70(4), 732\u2013749 (2014)","journal-title":"Algorithmica"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/11537311_24","volume-title":"Fundamentals of Computation Theory","author":"BS Chlebus","year":"2005","unstructured":"Chlebus, B.S., Kowalski, D.R.: Almost optimal explicit selectors. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 270\u2013280. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11537311_24"},{"issue":"1\u20133","key":"19_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00851-4","volume":"302","author":"AEF Clementi","year":"2003","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302(1\u20133), 337\u2013364 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11780823_22","volume-title":"Structural Information and Communication Complexity","author":"G Cormode","year":"2006","unstructured":"Cormode, G., Muthukrishnan, S.: Combinatorial algorithms for compressed sensing. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 280\u2013294. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780823_22"},{"issue":"5","key":"19_CR13","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539703428002","volume":"34","author":"A De Bonis","year":"2005","unstructured":"De Bonis, A., Gasieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34(5), 1253\u20131270 (2005)","journal-title":"SIAM J. Comput."},{"key":"19_CR14","volume-title":"Combinatorial Group Testing and its Applications","author":"DZ Du","year":"2000","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications. World Scientific, River Edge (2000)"},{"key":"19_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/6122","volume-title":"Pooling Designs and Nonadaptive Group Testing","author":"DZ Du","year":"2006","unstructured":"Du, D.Z., Hwang, F.K.: Pooling Designs and Nonadaptive Group Testing. World Scientific, Singapore (2006)"},{"issue":"6","key":"19_CR16","doi-asserted-by":"publisher","first-page":"2280","DOI":"10.1109\/TWC.2008.070010","volume":"7","author":"A Dua","year":"2008","unstructured":"Dua, A.: Random access with multi-packet reception. IEEE Trans. Wirel. Commun. 7(6), 2280\u20132288 (2008)","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"19_CR17","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: Bounds on the length of disjunct codes. Problemy Peredachi Informatsii 18(3), 7\u201313 (1982)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"D\u2019yachkov, A.G., Vorob\u00e9v, I.V., Polyansky, N.A., Shchukin, V.Y.: Bounds on the rate of disjunctive codes. Prob. Inform. Transm. 50(1), 27\u201356 (2014)","DOI":"10.1134\/S0032946014010037"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"D\u2019yachkov, A.G., Vorob\u00e9v, I.V., Polyansky, N.A., Shchukin, V.Y.: Erratum to: bounds on the rate of disjunctive codes. Prob. Inform. Transm. 52(2), 200 (2016). Problems of Information Transmission 50, 27 (2014)","DOI":"10.1134\/S0032946016020083"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, P., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of $$r$$ others. Israel J. Math. 51, 75\u201389 (1985)","journal-title":"Israel J. Math."},{"key":"19_CR21","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. 33, 94\u2013136 (2003)","journal-title":"SIAM J. Comput."},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2014.11.029","volume":"566","author":"L Gargano","year":"2015","unstructured":"Gargano, L., Rescigno, A.A.: Complexity of conflict-free colorings of graphs. Theor. Comput. Sci. 566, 39\u201349 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F., Maus, Y.: On the complexity of local distributed graph problems. In: Proceedings of ACM Symposium on Theory of Computing (STOC) (2017, to appear)","DOI":"10.1145\/3055399.3055471"},{"issue":"3","key":"19_CR24","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1017\/S0963548313000540","volume":"23","author":"R Glebov","year":"2014","unstructured":"Glebov, R., Szab\u00f3, T., Tardos, G.: Conflict-free coloring of graphs. Comb. Prob. Comput. 23(3), 434\u2013448 (2014)","journal-title":"Comb. Prob. Comput."},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-13731-0_11","volume-title":"Algorithm Theory - SWAT 2010","author":"E Horev","year":"2010","unstructured":"Horev, E., Krakovski, R., Smorodinsky, S.: Conflict-free coloring made stronger. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 105\u2013117. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13731-0_11"},{"issue":"9","key":"19_CR26","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.comgeo.2012.01.013","volume":"45","author":"M Katz","year":"2012","unstructured":"Katz, M., Lev-Tov, N., Morgenstern, G.: Conflict-free coloring of points on a line with respect to a set of intervals. Comp. Geom. 45(9), 508\u2013514 (2012)","journal-title":"Comp. Geom."},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"WH Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theor. 10, 363\u2013377 (1964)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Kumar, R., Rajagopalan, S., Sahai, A.: Coding constructions for blacklisting problems without computational assumptions. In: Proceedings of CRYPTO 1999, pp. 609\u2013623 (1999)","DOI":"10.1007\/3-540-48405-1_38"},{"key":"19_CR29","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21, 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1667053.1667060","volume":"57","author":"RA Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM 57(2), 1\u201315 (2010)","journal-title":"J. ACM"},{"issue":"5","key":"19_CR31","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1017\/S0963548309990290","volume":"18","author":"J Pach","year":"2009","unstructured":"Pach, J., Tardos, G.: Conflict-free colorings of graphs and hypergraphs. Comb. Prob. Comput. 18(5), 819\u2013834 (2009)","journal-title":"Comb. Prob. Comput."},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Porat, B., Porat, E.: Exact and approximate pattern matching in the streaming model. In: Proceedings of 50th FOCS, pp. 315\u2013323 (2009)","DOI":"10.1109\/FOCS.2009.11"},{"key":"19_CR33","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","volume":"66","author":"M Ruszink\u00f3","year":"1994","unstructured":"Ruszink\u00f3, M.: On the upper bound of the size of the $$r$$-cover-free families. J. Comb. Theor. Ser. A 66, 302\u2013310 (1994)","journal-title":"J. Comb. Theor. Ser. A"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Smorodinsky, S.: Conflict-Free Coloring and its Applications, Geometry \u2013 Intuitive, Discrete, and Convex: A Tribute to L\u00e1szl\u00f3 Fejes T\u00f3th, pp. 331\u2013389. Springer, Heidelberg (2013). B\u00e1r\u00e1ny, I., B\u00f6r\u00f6czky, K.J., T\u00f3th, G.F., Pach, J. (eds.)","DOI":"10.1007\/978-3-642-41498-5_12"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71147-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:12:19Z","timestamp":1709809939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}