{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:15Z","timestamp":1725543975816},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114755"},{"type":"electronic","value":"9783642114762"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11476-2_4","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T01:15:31Z","timestamp":1264382131000},"page":"30-43","source":"Crossref","is-referenced-by-count":4,"title":["Ordered Coloring Grids and Related Graphs"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[]},{"given":"Panagiotis","family":"Cheilaris","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[]},{"given":"Valia","family":"Mitsou","sequence":"additional","affiliation":[]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Cheilaris, P., Smorodinsky, S.: Deterministic conflict-free coloring for intervals: from offline to online. ACM Transactions on Algorithms\u00a04(4), 44:1\u201344:18 (2008)","DOI":"10.1145\/1383369.1383375"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1995.1009","volume":"18","author":"H.L. Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Journal of Algorithms\u00a018(2), 238\u2013255 (1995)","journal-title":"Journal of Algorithms"},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1137\/S0097539704446682","volume":"36","author":"K. Chen","year":"2007","unstructured":"Chen, K., Fiat, A., Kaplan, H., Levy, M., Matou\u0161ek, J., Mossel, E., Pach, J., Sharir, M., Smorodinsky, S., Wagner, U., Welzl, E.: Online conflict-free coloring for intervals. SIAM Journal on Computing\u00a036(5), 1342\u20131359 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(99)00179-1","volume":"98","author":"J.S. Deogun","year":"1999","unstructured":"Deogun, J.S., Kloks, T., Kratsch, D., M\u00fcller, H.: On the vertex ranking problem for trapezoid, circular-arc and other graphs. Discrete Applied Mathematics\u00a098, 39\u201363 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11672142_20","volume-title":"STACS 2006","author":"K. Elbassioni","year":"2006","unstructured":"Elbassioni, K., Mustafa, N.H.: Conflict-free colorings of rectangles ranges. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 254\u2013263. Springer, Heidelberg (2006)"},{"key":"4_CR6","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 Journal on Computing\u00a033, 94\u2013136 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR7","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 and Computational Geometry\u00a034, 47\u201370 (2005)","journal-title":"Discrete and Computational Geometry"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","volume":"28","author":"A.V. Iyer","year":"1988","unstructured":"Iyer, A.V., Ratliff, H.R., Vijayan, G.: Optimal node ranking of trees. Information Processing Letters\u00a028, 225\u2013229 (1988)","journal-title":"Information Processing Letters"},{"key":"4_CR9","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.: Ordered colourings. Discrete Mathematics\u00a0142, 141\u2013154 (1995)","journal-title":"Discrete Mathematics"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 270\u2013281 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"Liu, J.W.H.: The role of elimination trees in sparse factorization. SIAM Journal on Matrix Analysis and Applications\u00a011(1), 134\u2013172 (1990)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(89)90025-5","volume":"23","author":"D.C. Llewellyn","year":"1989","unstructured":"Llewellyn, D.C., Tovey, C.A., Trick, M.A.: Local optimization on graphs. Discrete Applied Mathematics\u00a023(2), 157\u2013178 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/978-3-642-55566-4_30","volume-title":"Discrete and Computational Geometry, The Goodman-Pollack Festschrift","author":"J. Pach","year":"2003","unstructured":"Pach, J., T\u00f3th, G.: Conflict free colorings. In: Discrete and Computational Geometry, The Goodman-Pollack Festschrift, pp. 665\u2013671. Springer, Heidelberg (2003)"},{"key":"4_CR14","unstructured":"Smorodinsky, S.: Combinatorial Problems in Computational Geometry. PhD thesis, School of Computer Science, Tel-Aviv University (2003)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11476-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:22:28Z","timestamp":1558272148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11476-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114755","9783642114762"],"references-count":14,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-11476-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}
