{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:17Z","timestamp":1759638377562,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_24","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"271-282","source":"Crossref","is-referenced-by-count":1,"title":["Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs"],"prefix":"10.1007","author":[{"given":"Pradeesha","family":"Ashok","sequence":"first","affiliation":[]},{"given":"Aditi","family":"Dudeja","sequence":"additional","affiliation":[]},{"given":"Sudeshna","family":"Kolay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"issue":"1","key":"24_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 coloring for rectangle ranges using $$O(n^.382)$$ colors. Discrete Comput. Geom. 48(1), 39\u201352 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.jda.2011.03.005","volume":"9","author":"P Cheilaris","year":"2011","unstructured":"Cheilaris, P., T\u00f3th, G.: Graph unique-maximum and conflict-free colorings. J. Discrete Algorithms 9(3), 241\u2013251 (2011)","journal-title":"J. Discrete Algorithms"},{"key":"24_CR4","doi-asserted-by":"crossref","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: 2002 Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 691\u2013700 (2002)","DOI":"10.1109\/SFCS.2002.1181994"},{"key":"24_CR5","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin (2006)"},{"key":"24_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, New York (2010)"},{"key":"24_CR7","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 colourings of graphs. Theoret. Comput. Sci. 566, 39\u201349 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"24_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 simple regions in the plane. Discrete Comput. Geom. 34(1), 47\u201370 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"24_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17364-6","volume-title":"Extremal Combinatorics: With Applications in Computer Science","author":"S Jukna","year":"2011","unstructured":"Jukna, S.: Extremal Combinatorics: With Applications in Computer Science. Springer Science & Business Media, New York (2011)"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s00453-011-9608-0","volume":"65","author":"N Misra","year":"2013","unstructured":"Misra, N., Moser, H., Raman, V., Saurabh, S., Sikdar, S.: The parameterized complexity of unique coverage and its variants. Algorithmica 65(3), 517\u2013544 (2013)","journal-title":"Algorithmica"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science, 23\u201325 October 1995, Milwaukee, Wisconsin, pp. 182\u2013191 (1995)","DOI":"10.1109\/SFCS.1995.492475"},{"issue":"05","key":"24_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. Comb. Probab. Comput. 18(05), 819\u2013834 (2009)","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/050642368","volume":"21","author":"S Smorodinsky","year":"2007","unstructured":"Smorodinsky, S.: On the chromatic number of geometric hypergraphs. SIAM J. Discrete Math. 21(3), 676\u2013687 (2007)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:11:59Z","timestamp":1748704319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}