{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T22:02:18Z","timestamp":1767996138068,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,4,15]],"date-time":"2022-04-15T00:00:00Z","timestamp":1649980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,15]],"date-time":"2022-04-15T00:00:00Z","timestamp":1649980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["MTR\/2020\/000497"],"award-info":[{"award-number":["MTR\/2020\/000497"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["MTR\/2019\/000550"],"award-info":[{"award-number":["MTR\/2019\/000550"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00453-022-00956-6","type":"journal-article","created":{"date-parts":[[2022,4,15]],"date-time":"2022-04-15T18:04:06Z","timestamp":1650045846000},"page":"2154-2185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Conflict-Free Coloring Bounds on Open Neighborhoods"],"prefix":"10.1007","volume":"84","author":[{"given":"Sriram","family":"Bhyravarapu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9094-3368","authenticated-orcid":false,"given":"Subrahmanyam","family":"Kalyanasundaram","sequence":"additional","affiliation":[]},{"given":"Rogers","family":"Mathew","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,15]]},"reference":[{"key":"956_CR1","doi-asserted-by":"publisher","unstructured":"Bhyravarapu, S., Kalyanasundaram, S.: Combinatorial bounds for conflict-free coloring on open neighborhoods. In: Graph-Theoretic Concepts in Computer Science\u201446th International Workshop, WG 2020, Leeds, UK, June 24\u201326, 2020, Revised Selected Papers, 2020, pp. 1\u201313. https:\/\/doi.org\/10.1007\/978-3-030-60440-0_1","DOI":"10.1007\/978-3-030-60440-0_1"},{"key":"956_CR2","unstructured":"Bhyravarapu, S., Kalyanasundaram, S., Mathew, R.: Conflict-free coloring of star-free graphs on open neighborhoods (2020). arXiv:2009.06720"},{"issue":"1","key":"956_CR3","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). https:\/\/doi.org\/10.1137\/S0097539702431840","journal-title":"SIAM J. Comput."},{"key":"956_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-41498-5_12","volume-title":"Conflict-Free Coloring and its Applications","author":"S Smorodinsky","year":"2013","unstructured":"Smorodinsky, S.: Conflict-Free Coloring and its Applications, pp. 331\u2013389. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-41498-5_12"},{"issue":"4","key":"956_CR5","doi-asserted-by":"publisher","first-page":"2675","DOI":"10.1137\/17M1146579","volume":"32","author":"Z Abel","year":"2018","unstructured":"Abel, Z., Alvarez, V., Demaine, E.D., Fekete, S.P., Gour, A., Hesterberg, A., Keldenich, P., Scheffer, C.: Conflict-free coloring of graphs. SIAM J. Discrete Math. 32(4), 2675\u20132702 (2018). https:\/\/doi.org\/10.1137\/17M1146579","journal-title":"SIAM J. Discrete Math."},{"issue":"C","key":"956_CR6","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(C), 39\u201349 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.11.029","journal-title":"Theor. Comput. Sci."},{"key":"956_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2018.05.025","volume":"745","author":"IV Reddy","year":"2018","unstructured":"Reddy, I.V.: Parameterized algorithms for conflict-free colorings of graphs. Theor. Comput. Sci. 745, 53\u201362 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.05.025","journal-title":"Theor. Comput. Sci."},{"key":"956_CR8","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Kolay, S., Pieterse, A.: Parameterized complexity of conflict-free graph coloring. In: Proceedings of the 16th Intl. Symposium on Algorithms and Data Structures, WADS, 2019, pp. 168\u2013180. https:\/\/doi.org\/10.1007\/978-3-030-24766-9_13","DOI":"10.1007\/978-3-030-24766-9_13"},{"key":"956_CR9","unstructured":"Agrawal, A.,\u00a0Ashok, P., Reddy, M.M., Saurabh, S., Yadav, D.: FPT algorithms for conflict-free coloring of graphs and chromatic terrain guarding. CoRR abs\/1905.01822. arXiv:1905.01822"},{"key":"956_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-019-00097-8","author":"C Keller","year":"2019","unstructured":"Keller, C., Smorodinsky, S.: Conflict-free coloring of intersection graphs of geometric objects. Discrete Comput. Geometry (2019). https:\/\/doi.org\/10.1007\/s00454-019-00097-8","journal-title":"Discrete Comput. Geometry"},{"issue":"03","key":"956_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1142\/S0218195918500085","volume":"28","author":"SP Fekete","year":"2018","unstructured":"Fekete, S.P., Keldenich, P.: Conflict-free coloring of intersection graphs. Int. J. Comput. Geometry Appl. 28(03), 289\u2013307 (2018). https:\/\/doi.org\/10.1142\/S0218195918500085","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"5","key":"956_CR12","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1137\/S0097539704446682","volume":"36","author":"K Chen","year":"2006","unstructured":"Chen, K., Fiat, A., Kaplan, H., 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. 36(5), 1342\u20131359 (2006). https:\/\/doi.org\/10.1137\/S0097539704446682","journal-title":"SIAM J. Comput."},{"issue":"5","key":"956_CR13","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. Combinat. Probab. Comput. 18(5), 819\u2013834 (2009). https:\/\/doi.org\/10.1017\/S0963548309990290","journal-title":"Combinat. Probab. Comput."},{"key":"956_CR14","unstructured":"Cheilaris, P.: Conflict-free coloring. Ph.D. thesis, New York, NY, USA (2009)"},{"key":"956_CR15","unstructured":"Bhyravarapu, S., Kalyanasundaram, S.: A tight bound for conflict-free coloring in terms of distance to cluster (2020). arXiv:2010.00063"},{"issue":"3","key":"956_CR16","doi-asserted-by":"publisher","first-page":"2009","DOI":"10.1137\/19M1272111","volume":"34","author":"F Huang","year":"2020","unstructured":"Huang, F., Guo, S., Yuan, J.: A short note on open-neighborhood conflict-free colorings of graphs. SIAM J. Discrete Math. 34(3), 2009\u20132015 (2020). https:\/\/doi.org\/10.1137\/19M1272111","journal-title":"SIAM J. Discrete Math."},{"key":"956_CR17","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2016","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, 1st edn. Springer, Berlin (2016)","edition":"1"},{"issue":"6","key":"956_CR18","doi-asserted-by":"publisher","first-page":"2132","DOI":"10.1137\/100799642","volume":"42","author":"K Chandrasekaran","year":"2013","unstructured":"Chandrasekaran, K., Goyal, N., Haeupler, B.: Deterministic algorithms for the Lov\u00e1sz local lemma. SIAM J. Comput. 42(6), 2132\u20132155 (2013). https:\/\/doi.org\/10.1137\/100799642","journal-title":"SIAM J. Comput."},{"key":"956_CR19","unstructured":"Harris, D.G.: Deterministic algorithms for the Lov\u00e1sz local lemma: simpler, more general, and more parallel. arXiv preprint. arXiv:1909.08065"},{"key":"956_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22743","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. (2022). https:\/\/doi.org\/10.1002\/jgt.22743","journal-title":"J. Graph Theory."},{"issue":"1","key":"956_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. J. Comb. Theory Ser. B 70(1), 2\u201344 (1997). https:\/\/doi.org\/10.1006\/jctb.1997.1750","journal-title":"J. Comb. Theory Ser. B"},{"key":"956_CR22","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Berlin (2005)"},{"issue":"3","key":"956_CR23","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/s00373-015-1625-3","volume":"32","author":"Y Aubry","year":"2016","unstructured":"Aubry, Y., Godin, J.-C., Togni, O.: Free choosability of outerplanar graphs. Graphs Combinat. 32(3), 851\u2013859 (2016). https:\/\/doi.org\/10.1007\/s00373-015-1625-3","journal-title":"Graphs Combinat."},{"issue":"5","key":"956_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"SL Mitchell","year":"1979","unstructured":"Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inf. Process. Lett. 9(5), 229\u2013232 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90075-9","journal-title":"Inf. Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00956-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-00956-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00956-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T13:10:43Z","timestamp":1658409043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-00956-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,15]]},"references-count":24,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["956"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-00956-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,15]]},"assertion":[{"value":"7 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}