{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:33:44Z","timestamp":1742970824740,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_13","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"168-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parameterized Complexity of Conflict-Free Graph Coloring"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudeshna","family":"Kolay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Astrid","family":"Pieterse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00454-012-9425-5","volume":"48","author":"D Ajwani","year":"2012","unstructured":"Ajwani, D., Elbassioni, K., Govindarajan, S., Ray, S.: Conflict-free coloringfor rectangle ranges using $$O(n^{.382})$$ colors. Discrete Comput. Geom. 48(1), 39\u201352 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9425-5","journal-title":"Discrete Comput. Geom."},{"key":"13_CR2","unstructured":"Bodlaender, H.L., Kolay, S., Pieterse, A.: Parameterized complexity of conflict-free graph coloring. CoRR abs\/1905.00305 (2019). https:\/\/arxiv.org\/abs\/1905.00305"},{"key":"13_CR3","unstructured":"Cheilaris, P.: Conflict-free coloring. Ph.D. thesis, City University of New York (2009)"},{"key":"13_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. In: Proceedings of the 43rd FOCS, pp. 691\u2013700 (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181994","DOI":"10.1109\/SFCS.2002.1181994"},{"key":"13_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, 39\u201349 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.11.029","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"13_CR7","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. Combin. Probab. Comput. 23(3), 434\u2013448 (2014)","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00454-005-1162-6","volume":"34","author":"S Har-Peled","year":"2005","unstructured":"Har-Peled, S., Smorodinsky, S.: Conflict-free coloring of points and simpleregions in the plane. Discrete Comput. Geom. 34(1), 47\u201370 (2005). https:\/\/doi.org\/10.1007\/s00454-005-1162-6","journal-title":"Discrete Comput. Geom."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ic.2013.08.005","volume":"231","author":"BMP Jansen","year":"2013","unstructured":"Jansen, B.M.P., Kratsch, S.: Data reduction for graph coloring problems. Inf. Comput. 231, 70\u201388 (2013). https:\/\/doi.org\/10.1016\/j.ic.2013.08.005","journal-title":"Inf. Comput."},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Jansen, B.M.P., Pieterse, A.: Optimal data reduction for graph coloring using low-degree polynomials. In: Proceedings of the 12th IPEC, pp. 22:1\u201322:12 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2017.22","DOI":"10.4230\/LIPIcs.IPEC.2017.22"},{"key":"13_CR11","unstructured":"Jansen, B.M.P., Pieterse, A.: Optimal sparsification for some binary CSPs using low-degree polynomials. CoRR abs\/1606.03233v2 (2018)"},{"issue":"05","key":"13_CR12","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. Combin. Probab. Comput. 18(05), 819\u2013834 (2009). https:\/\/doi.org\/10.1017\/S0963548309990290","journal-title":"Combin. Probab. Comput."},{"key":"13_CR13","unstructured":"Smorodinsky, S.: Combinatorial problems in computational geometry. Ph.D. thesis, School of Computer Science, Tel-Aviv University (2003)"},{"key":"13_CR14","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\u2014Intuitive, 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\u2014Intuitive, Discrete, and Convex. BSMS, vol. 24, pp. 331\u2013389. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41498-5_12"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:53:25Z","timestamp":1710266005000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}