{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:13:59Z","timestamp":1743052439348,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_47","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"567-578","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces"],"prefix":"10.1007","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandar","family":"Markovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Abel, Z., Alvarez, V., Demaine, E.D., Fekete, S.P., Gour, A., Hesterberg, A., Keldenich, P., Scheffer, C.: Three colors suffice: conflict-free coloring of planar graphs. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1951\u20131963 (2017)","DOI":"10.1137\/1.9781611974782.127"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Aronov, B., de Berg, M., Markovic, A., Woeginger, G.: Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces. CoRR (2018)","DOI":"10.1007\/978-3-319-94776-1_47"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-59071-4_56","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Deogun, J.S., Jansen, K., Kloks, T., Kratsch, D., M\u00fcller, H., Tuza, Z.: Rankings of graphs. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 292\u2013304. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59071-4_56"},{"issue":"4","key":"47_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0196-6774(81)90031-6","volume":"2","author":"N Chiba","year":"1981","unstructured":"Chiba, N., Nishizeki, T., Saito, N.: A linear 5-coloring algorithm of planar graphs. J. Algorithms 2(4), 317\u2013327 (1981)","journal-title":"J. Algorithms"},{"issue":"1","key":"47_CR5","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1137\/S0097539702431840","volume":"33","author":"G Even","year":"2003","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 (2003)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"47_CR6","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. Discret. Comput. Geom. 34(1), 47\u201370 (2005)","journal-title":"Discret. Comput. Geom."},{"issue":"1\u20133","key":"47_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0012-365X(93)E0216-Q","volume":"142","author":"M Katchalski","year":"1995","unstructured":"Katchalski, M., McCuaig, W., Seager, S.M.: Ordered colourings. Discret. Math. 142(1\u20133), 141\u2013154 (1995)","journal-title":"Discret. Math."},{"issue":"5","key":"47_CR8","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":"47_CR9","unstructured":"Smorodinsky, S.: Combinatorial problems in computational geometry. Ph.D. thesis, Tel-Aviv University (2003)"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Smorodinsky, S.: On the chromatic number of some geometric hypergraphs. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, 22\u201326 January 2006, pp. 316\u2013323 (2006)","DOI":"10.1145\/1109557.1109593"},{"key":"47_CR11","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","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:36:51Z","timestamp":1710347811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}