{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:47Z","timestamp":1770921407277,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_34","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:19Z","timestamp":1770918799000},"page":"461-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounds and\u00a0Hardness Results for\u00a0Conflict-Free Choosability"],"prefix":"10.1007","author":[{"given":"Shiwali","family":"Gupta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4536-1136","authenticated-orcid":false,"given":"Rogers","family":"Mathew","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"4","key":"34_CR1","doi-asserted-by":"publisher","first-page":"2675","DOI":"10.1137\/17M1146579","volume":"32","author":"Z Abel","year":"2018","unstructured":"Abel, Z., et al.: Conflict-free coloring of graphs. SIAM J. Discrete Math. 32(4), 2675\u20132702 (2018)","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Smorodinsky, S.: Conflict-free colorings of shallow discs. In: Proceedings of the Twenty-Second Annual Symposium on Computational geometry, pp. 41\u201343 (2006)","DOI":"10.1145\/1137856.1137864"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-79987-8_7","volume-title":"Combinatorial Algorithms","author":"S Bhyravarapu","year":"2021","unstructured":"Bhyravarapu, S., Hartmann, T.A., Kalyanasundaram, S., Vinod Reddy, I.: Conflict-free coloring: graphs of bounded clique width and intersection graphs. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 92\u2013106. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_7"},{"issue":"4","key":"34_CR4","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1002\/jgt.22670","volume":"97","author":"S Bhyravarapu","year":"2021","unstructured":"Bhyravarapu, S., Kalyanasundaram, S., Mathew, R.: A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs. J. Graph Theory 97(4), 553\u2013556 (2021)","journal-title":"J. Graph Theory"},{"key":"34_CR5","unstructured":"Bhyravarapu, S., Kalyanasundaram, S., Mathew, R.: Conflict-free coloring on claw-free graphs and interval graphs. In: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Bhyravarapu, S., Kalyanasundaram, S., Mathew, R.: Conflict-free coloring on subclasses of perfect graphs and bipartite graphs. Theor. Comput. Sci. 115080 (2025)","DOI":"10.1016\/j.tcs.2025.115080"},{"key":"34_CR7","unstructured":"Cheilaris, P.: Conflict-free coloring. City University of New York (2009)"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Cheilaris, P., Smorodinsky, S., Sulovsk\u1ef3, M.: The potential to improve the choice: list conflict-free coloring for geometric hypergraphs. In: Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, pp. 424\u2013432 (2011)","DOI":"10.1145\/1998196.1998266"},{"issue":"3","key":"34_CR9","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1002\/jgt.22743","volume":"99","author":"M D\u0119bski","year":"2022","unstructured":"D\u0119bski, M., Przyby\u0142o, J.: Conflict-free chromatic number versus conflict-free chromatic index. J. Graph Theory 99(3), 349\u2013358 (2022)","journal-title":"J. Graph Theory"},{"key":"34_CR10","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.H.: Conflict-free colorings of rectangles ranges. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 254\u2013263. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11672142_20"},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","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":"34_CR12","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. Theoret. Comput. Sci. 566, 39\u201349 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"34_CR13","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 colouring of graphs. Comb. Probab. Comput. 23(3), 434\u2013448 (2014)","journal-title":"Comb. Probab. Comput."},{"key":"34_CR14","unstructured":"Gupta, S., Mathew, R.: Bounds and hardness results for conflict-free choosability. https:\/\/arxiv.org\/abs\/2409.12672 (2025)"},{"issue":"1\u20133","key":"34_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(95)00104-5","volume":"159","author":"S Gutner","year":"1996","unstructured":"Gutner, S.: The complexity of planar graph choosability. Discret. Math. 159(1\u20133), 119\u2013130 (1996)","journal-title":"Discret. Math."},{"issue":"8","key":"34_CR16","doi-asserted-by":"publisher","first-page":"2260","DOI":"10.1016\/j.disc.2008.04.061","volume":"309","author":"S Gutner","year":"2009","unstructured":"Gutner, S., Tarsi, M.: Some results on (a: b)-choosability. Discret. Math. 309(8), 2260\u20132270 (2009)","journal-title":"Discret. Math."},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Smorodinsky, S.: On conflict-free coloring of points and simple regions in the plane. In: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, pp. 114\u2013123 (2003)","DOI":"10.1145\/777792.777810"},{"issue":"6","key":"34_CR18","doi-asserted-by":"publisher","first-page":"3903","DOI":"10.1109\/TIT.2024.3355416","volume":"70","author":"P Krishnan","year":"2024","unstructured":"Krishnan, P., Mathew, R., Kalyanasundaram, S.: Pliable index coding via conflict-free colorings of hypergraphs. IEEE Trans. Inf. Theory 70(6), 3903\u20133921 (2024)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"34_CR19","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1016\/j.dam.2008.09.005","volume":"157","author":"N Lev-Tov","year":"2009","unstructured":"Lev-Tov, N., Peleg, D.: Conflict-free coloring of unit disks. Discret. Appl. Math. 157(7), 1521\u20131532 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"34_CR20","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 colourings of graphs and hypergraphs. Comb. Probab. Comput. 18(5), 819\u2013834 (2009)","journal-title":"Comb. Probab. Comput."},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Pach, J., T\u00f3th, G.: Conflict-free colorings. In: Discrete and Computational Geometry: The Goodman-Pollack Festschrift, pp. 665\u2013671. Springer, Cham (2003)","DOI":"10.1007\/978-3-642-55566-4_30"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Smorodinsky, S.: Conflict-Free Coloring and its Applications, p. 331\u2013389. Springer Heidelberg (2013)","DOI":"10.1007\/978-3-642-41498-5_12"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:21Z","timestamp":1770918801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}