{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:27:11Z","timestamp":1760441231343},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,8,27]],"date-time":"2014-08-27T00:00:00Z","timestamp":1409097600000},"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":["Algorithmica"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s00453-014-9929-x","type":"journal-article","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T19:17:51Z","timestamp":1409080671000},"page":"732-749","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Strong Conflict-Free Coloring for Intervals"],"prefix":"10.1007","volume":"70","author":[{"given":"Panagiotis","family":"Cheilaris","sequence":"first","affiliation":[]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[]},{"given":"Shakhar","family":"Smorodinsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,27]]},"reference":[{"key":"9929_CR1","unstructured":"Abam, M.A., de Berg, M., Poon, S.H.: Fault-tolerant conflict-free coloring. In: Proc. 20th Canadian Conference on Computational Geometry (CCCG) (2008)"},{"key":"9929_CR2","unstructured":"Abellanas, M., Bose, P., Garcia, J., Hurtado, F., Nicolas, M., Ramos, P.A.: On properties of higher order Delaunay graphs with applications. In: Proc. 21st European Workshop on Computational Geometry (EWCG), pp. 119\u2013122 (2005)"},{"key":"9929_CR3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1017\/S0963548309990587","volume":"19","author":"A Bar-Noy","year":"2010","unstructured":"Bar-Noy, A., Cheilaris, P., Olonetsky, S., Smorodinsky, S.: Online conflict-free colouring for hypergraphs. Comb. Probab. Comput. 19, 493\u2013516 (2010)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"9929_CR4","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/1383369.1383375","volume":"4","author":"A Bar-Noy","year":"2008","unstructured":"Bar-Noy, A., Cheilaris, P., Smorodinsky, S.: Deterministic conflict-free coloring for intervals: from offline to online. ACM Trans. Algorithms 4(4), 44 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"9929_CR5","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/050633263","volume":"36","author":"K Chen","year":"2006","unstructured":"Chen, K., Fiat, A., 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, 545\u2013554 (2006)","journal-title":"SIAM J. Comput."},{"key":"9929_CR6","doi-asserted-by":"crossref","unstructured":"Chen, K., Kaplan, H., Sharir, M.: Online conflict free coloring for congruent disks, and axis-parallel rectangles. ACM Trans. Algorithms 5(2) (2009). doi: 10.1145\/1497290.1497292","DOI":"10.1145\/1497290.1497292"},{"key":"9929_CR7","unstructured":"Cui, Z., Hu, Z.C.: $$k$$ k -conflict-free coloring and $$k$$ k -strong-conflict-free coloring for one class of hypergraphs and online $$k$$ k -conflict-free coloring (2011). arXiv:1107.0138"},{"key":"9929_CR8","doi-asserted-by":"crossref","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, 94\u2013136 (2003)","journal-title":"SIAM J. Comput."},{"key":"9929_CR9","doi-asserted-by":"crossref","unstructured":"Horev, E., Krakovski, R., Smorodinsky, S.: Conflict-free coloring made stronger. In: Proc. 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp. 105\u2013117 (2010)","DOI":"10.1007\/978-3-642-13731-0_11"},{"key":"9929_CR10","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1016\/j.comgeo.2012.01.013","volume":"45","author":"M Katz","year":"2012","unstructured":"Katz, M., Lev-Tov, N., Morgenstern, G.: Conflict-free coloring of points on a line with respect to a set of intervals. Comput. Geom. 45, 508\u2013514 (2012)","journal-title":"Comput. Geom."},{"issue":"7","key":"9929_CR11","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1016\/j.dam.2008.09.005","volume":"157","author":"N Lev-Tov","year":"2009","unstructured":"Lev-Tov, N., Peleg, D.: Conflict-free coloring of unit disks. Discrete Appl. Math. 157(7), 1521\u20131532 (2009)","journal-title":"Discrete Appl. Math."},{"key":"9929_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen, H.L., Nguyen, U.T.: Algorithms for bandwidth efficient multicast routing in multi-channel multi-radio wireless mesh networks. In: Proc. IEEE Wireless Communications and Networking Conference (WCNC), pp. 1107\u20131112 (2011)","DOI":"10.1109\/WCNC.2011.5779286"},{"key":"9929_CR13","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.: Computational Complexity. Addison Wesley, Boston (1993)"},{"key":"9929_CR14","unstructured":"Smorodinsky, S.: Conflict-free coloring and its applications (2010). arXiv:1005.3616"},{"key":"9929_CR15","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TPDS.2009.46","volume":"21","author":"G Zeng","year":"2010","unstructured":"Zeng, G., Wang, B., Ding, Y., Xiao, L., Mutka, M.: Efficient multicast algorithms for multichannel wireless mesh networks. IEEE Trans. Parallel Distrib. Syst. 21, 86\u201399 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9929-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9929-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9929-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T09:42:05Z","timestamp":1565775725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9929-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,27]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["9929"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9929-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,27]]}}}