{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:10Z","timestamp":1725564970205},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_36","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"329-338","source":"Crossref","is-referenced-by-count":12,"title":["Dynamic Storage Allocation and On-Line Colouring Interval Graphs"],"prefix":"10.1007","author":[{"given":"N. S.","family":"Narayanaswamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Adamy, U., Erlebach, T.: Online coloring of intervals with bandwidth. In: Proceedings of the First Workshop on Approximation and Online Algorithms (2003)","DOI":"10.1007\/978-3-540-24592-6_1"},{"key":"36_CR2","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"36_CR3","unstructured":"Feldmann, A., Maggs, B., Sgall, J., Sleator, D.D., Tomkins, A.: Competitive analysis of call admission algorithms that allow delay. Technical Report CMU-CS- 95-102, Carnegie Mellon University (1995)"},{"key":"36_CR4","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-61680-2_46","volume-title":"Algorithms - ESA \u201996","author":"J. Gergov","year":"1996","unstructured":"Gergov, J.: Approximation algorithms for dynamic storage allocation. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 52\u201361. Springer, Heidelberg (1996)"},{"key":"36_CR6","unstructured":"Gergov, J.: Algorithms for compile-time memory optimization. In: Proc. of 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 907\u2013908 (1999)"},{"key":"36_CR7","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 Press, London (1980)"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0012-365X(91)90011-P","volume":"88","author":"H.A. Kierstead","year":"1991","unstructured":"Kierstead, H.A.: A polynomial approximation algorithm for dynamic storage allocation. Discrete Mathematics\u00a088, 231\u2013237 (1991)","journal-title":"Discrete Mathematics"},{"key":"36_CR9","first-page":"143","volume":"33","author":"H.A. Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congressus Numeratium\u00a033, 143\u2013153 (1981)","journal-title":"Congressus Numeratium"},{"key":"36_CR10","series-title":"Fundamental Algorithms","volume-title":"Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: Art of Computer Programming. Fundamental Algorithms, vol.\u00a01. Addison-Wesley, Reading (1973)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-44450-5_33","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"S. Leonardi","year":"2000","unstructured":"Leonardi, S., Marchetti-Spaccamela, A., Vitaletti, A.: Approximation algorithms for bandwidth and storage allocation problems under real time constraints. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 409\u2013420. Springer, Heidelberg (2000)"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/3-540-51486-4_93","volume-title":"Mathematical Foundations of Computer Science 1989","author":"M. Slusarek","year":"1989","unstructured":"Slusarek, M.: A colouring algorithm for interval graphs. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol.\u00a0379, pp. 471\u2013480. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:13Z","timestamp":1605759673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}