{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T14:03:00Z","timestamp":1770732180070,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3978,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00411-x","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T15:19:50Z","timestamp":1034954390000},"page":"953-962","source":"Crossref","is-referenced-by-count":29,"title":["Online independent sets"],"prefix":"10.1016","volume":"289","author":[{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[]},{"given":"Shuichi","family":"Miyazaki","sequence":"additional","affiliation":[]},{"given":"Shiro","family":"Taketomi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00411-X_BIB1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.2307\/2272247","article-title":"Effective coloration","volume":"41","author":"Bean","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(01)00411-X_BIB2","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"2","key":"10.1016\/S0304-3975(01)00411-X_BIB3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jgt.3190120212","article-title":"On-line and first fit colorings of graphs","volume":"12","author":"Gy\u00e1rf\u00e1s","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(01)00411-X_BIB4","unstructured":"M.M. Halld\u00f3rsson, Online coloring known graphs, Electron. J. Combin. 7 (R6) (2000). www.combinatorics.org."},{"key":"10.1016\/S0304-3975(01)00411-X_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(94)90157-0","article-title":"Lower bounds for on-line graph coloring","volume":"130","author":"Halld\u00f3rsson","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00411-X_BIB6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02780324","article-title":"On-line coloring k-colorable graphs","volume":"105","author":"Kierstead","year":"1998","journal-title":"Israel J. Math."},{"key":"10.1016\/S0304-3975(01)00411-X_BIB7","first-page":"143","article-title":"An extremal problem in recursive combinatorics","volume":"33","author":"Kierstead","year":"1981","journal-title":"Congr. Numer."},{"key":"10.1016\/S0304-3975(01)00411-X_BIB8","unstructured":"R.J. Lipton, A. Tomkins, Online interval scheduling, Proc. 5th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms, 1994, pp. 302\u2013311."},{"key":"10.1016\/S0304-3975(01)00411-X_BIB9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","article-title":"An online graph coloring algorithm with sublinear performance ratio","volume":"75","author":"Lov\u00e1sz","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(01)00411-X_BIB10","doi-asserted-by":"crossref","unstructured":"A. Yao, Probabilistic computations: towards a unified measure of complexity, Proc. 18th Ann. IEEE Symp. on Foundations of Computer Science, 1977, 535\u2013542.","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100411X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100411X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T07:53:06Z","timestamp":1556437986000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750100411X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S030439750100411X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00411-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}