{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:16:15Z","timestamp":1759335375591},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_93","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:58:48Z","timestamp":1330185528000},"page":"471-480","source":"Crossref","is-referenced-by-count":12,"title":["A coloring algorithm for interval graphs"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Slusarek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"issue":"4","key":"41_CR1","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1051\/ita\/1988220404871","volume":"22","author":"M. Chrobak","year":"1988","unstructured":"M. Chrobak, M. Slusarek, On some packing problem related to dynamic storage allocation, RAIRO Informatique Th\u00e9orique et Applications, 22 (1988), 4, 487\u2013499.","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"key":"41_CR2","unstructured":"M.R.Garey, D.S.Johnson, Computers and Intractability, Freeman, 1979."},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"H.A.Kierstead, The Linearity of First-Fit Coloring of Interval Graphs, manuscript, 1988.","DOI":"10.1137\/0401048"},{"key":"41_CR4","first-page":"143","volume":"33","author":"H. A. Kierstead","year":"1981","unstructured":"H.A. Kierstead, W.T. Trotter, An extremal problem in recursive combinatorics, Congressus Numerantium 33 (1981), 143\u2013153.","journal-title":"Congressus Numerantium"},{"key":"41_CR5","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/321832.321846","volume":"21","author":"J. M. Robson","year":"1974","unstructured":"J.M. Robson, Bounds for some functions concerning dynamic storage allocation, JACM 21 (1974), 491\u2013499.","journal-title":"JACM"},{"key":"41_CR6","first-page":"7","volume":"3","author":"M. Slusarek","year":"1987","unstructured":"M. Slusarek, NP-completeness of storage allocation, Jagiellonian U. Scientific Papers, s. Informatics, 3 (1987), 7\u201318.","journal-title":"Jagiellonian U. Scientific Papers, s. Informatics"},{"key":"41_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(87)90096-2","volume":"24","author":"M. Slusarek","year":"1987","unstructured":"M. Slusarek, An off-line storage allocation algorithm, IPL 24 (1987), 71\u201375.","journal-title":"IPL"},{"key":"41_CR8","unstructured":"M.Slusarek, A lower bound for the wall problem, manuscript, 1988."},{"key":"41_CR9","unstructured":"D.R.Woodall, Problem No. 4, in Combinatorics (Proc. British Combinatorial Conference 1973), London Math. Soc. Lecture Notes Series 13, T.P. McDonough and V.C. Mavron, Eds, Cambridge University Press, 1974, p. 202."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:21:30Z","timestamp":1605630090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}