{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:49:02Z","timestamp":1770994142664,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030799861","type":"print"},{"value":"9783030799878","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_7","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"92-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Sriram","family":"Bhyravarapu","sequence":"first","affiliation":[]},{"given":"Tim A.","family":"Hartmann","sequence":"additional","affiliation":[]},{"given":"Subrahmanyam","family":"Kalyanasundaram","sequence":"additional","affiliation":[]},{"given":"I.","family":"Vinod Reddy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"issue":"4","key":"7_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. Discret. Math. 32(4), 2675\u20132702 (2018)","journal-title":"SIAM J. Discret. Math."},{"key":"7_CR2","unstructured":"Agrawal, A., Ashok, P., Reddy, M.M., Saurabh, S., Yadav, D.: FPT algorithms for conflict-free coloring of graphs and chromatic terrain guarding. CoRR, abs\/1905.01822 (2019)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory, Ser. B 41(2), 182\u2013208 (1986)","DOI":"10.1016\/0095-8956(86)90043-2"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-60440-0_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Bhyravarapu","year":"2020","unstructured":"Bhyravarapu, S., Kalyanasundaram, S.: Combinatorial bounds for conflict-free coloring on open neighborhoods. In: Adler, I., M\u00fcller, H. (eds.) WG 2020. LNCS, vol. 12301, pp. 1\u201313. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60440-0_1"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-030-24766-9_13","volume-title":"Algorithms and Data Structures","author":"HL Bodlaender","year":"2019","unstructured":"Bodlaender, H.L., Kolay, S., Pieterse, A.: Parameterized complexity of conflict-free graph coloring. In: Friggstad, Z., Sack, J.-R., Salavatipour, M.R. (eds.) WADS 2019. LNCS, vol. 11646, pp. 168\u2013180. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24766-9_13"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Appl. Math. 3(3), 163\u2013174 (1981)","DOI":"10.1016\/0166-218X(81)90013-5"},{"issue":"1\u20133","key":"7_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1\u20133), 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"7_CR8","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":"7_CR9","unstructured":"Fekete, S.P., Keldenich, P.: Conflict-free coloring of intersection graphs. In: 28th International Symposium on Algorithms and Computation, ISAAC 2017, 9\u201312 December 2017, vol. 92, pp. 31:1\u201331:12 (2017)"},{"issue":"22","key":"7_CR10","doi-asserted-by":"publisher","first-page":"2906","DOI":"10.1016\/j.disc.2006.04.043","volume":"307","author":"F Gardi","year":"2007","unstructured":"Gardi, F.: The roberts characterization of proper and unit interval graphs. Discrete Math. 307(22), 2906\u20132908 (2007)","journal-title":"Discrete Math."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Gargano, L., Rescigno, A.A.: Complexity of conflict-free colorings of graphs. Theor. Comput. Sci. 566(C), 39\u201349 (2015)","DOI":"10.1016\/j.tcs.2014.11.029"},{"issue":"3","key":"7_CR12","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. Discret. Math. 34(3), 2009\u20132015 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Keller, C., Rok, A., Smorodinsky, S.: Conflict-free coloring of string graphs. Discrete Comput. Geom., 1\u201336 (2020)","DOI":"10.1007\/s00454-020-00179-y"},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L.: Kneser\u2019s conjecture, chromatic number, and homotopy. J. Comb. Theor. Ser. A 25(3), 319\u2013324 (1978)","journal-title":"J. Comb. Theor. Ser. A"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Oum, S.-I., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theor. Ser. B 96(4), 514\u2013528 (2006)","DOI":"10.1016\/j.jctb.2005.10.006"},{"issue":"5","key":"7_CR16","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":"7_CR17","doi-asserted-by":"crossref","unstructured":"Vinod Reddy, I.: Parameterized algorithms for conflict-free colorings of graphs. Theor. Comput. Sci. 745, 53\u201362 (2018)","DOI":"10.1016\/j.tcs.2018.05.025"},{"key":"7_CR18","series-title":"Bolyai Society Mathematical Studies","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-41498-5_12","volume-title":"Geometry \u2014 Intuitive, Discrete, and Convex","author":"S Smorodinsky","year":"2013","unstructured":"Smorodinsky, S.: Conflict-free coloring and its applications. In: B\u00e1r\u00e1ny, I., B\u00f6r\u00f6czky, K.J., T\u00f3th, G.F., Pach, J. (eds.) Geometry \u2014 Intuitive, Discrete, and Convex. BSMS, vol. 24, pp. 331\u2013389. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41498-5_12"},{"key":"7_CR19","unstructured":"Sorge, M., Weller, M.: The graph parameter hierarchy. https:\/\/manyu.pro\/assets\/parameter-hierarchy.pdf. Accessed 9 Mar 2021"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:10:13Z","timestamp":1625008213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}