{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:39Z","timestamp":1759335999357},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T00:00:00Z","timestamp":1201824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s11083-008-9076-6","type":"journal-article","created":{"date-parts":[[2008,4,8]],"date-time":"2008-04-08T08:10:10Z","timestamp":1207642210000},"page":"49-53","source":"Crossref","is-referenced-by-count":33,"title":["A Note on First-Fit Coloring of Interval Graphs"],"prefix":"10.1007","volume":"25","author":[{"given":"N. S.","family":"Narayanaswamy","sequence":"first","affiliation":[]},{"given":"R. Subhash","family":"Babu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,9]]},"reference":[{"key":"9076_CR1","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1051\/ita\/1988220404871","volume":"22","author":"M. Chrobak","year":"1988","unstructured":"Chrobak, M., \u015alusarek, M.: On some packing problems related to dynamic storage allocation. RAIRO Inform. Theor. Appl. 22, 487\u2013499 (1988)","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"9076_CR2","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic, London (1980)"},{"key":"9076_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(94)00285-Q","volume":"144","author":"H.A. Kierstead","year":"1995","unstructured":"Kierstead, H.A., Qin, J.: Coloring interval graphs with first-fit. Discrete Math. 144, 47\u201357 (1995)","journal-title":"Discrete Math."},{"issue":"4","key":"9076_CR4","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/0401048","volume":"1","author":"H.A. Kierstead","year":"1988","unstructured":"Kierstead, H.A.: The linearity of first-fit coloring of interval graphs. SIAM J. Discrete Math. 1(4), 526\u2013530 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"9076_CR5","unstructured":"Varadarajan, K., Pemmaraju, S.V., Raman, R.: Buffer minimization using max-coloring. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium On Discrete Algorithms, pp. 562\u2013571, New Orleans, 11\u201314 January 2004"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-008-9076-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-008-9076-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-008-9076-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:12:12Z","timestamp":1559365932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-008-9076-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["9076"],"URL":"https:\/\/doi.org\/10.1007\/s11083-008-9076-6","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}