{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:46:14Z","timestamp":1761806774750},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"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":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90157-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"163-174","source":"Crossref","is-referenced-by-count":38,"title":["Lower bounds for on-line graph coloring"],"prefix":"10.1016","volume":"130","author":[{"given":"Magnus M.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[]},{"given":"Mario","family":"Szegedy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90157-0_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"},{"issue":"2","key":"10.1016\/0304-3975(94)90157-0_BIB2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02124674","article-title":"A dynamic location problem for graphs","volume":"9","author":"Chung","year":"1989","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(94)90157-0_BIB3","first-page":"44","article-title":"New algorithms for on-line bin packing","author":"Gambosi","year":"1990","journal-title":"Proc. 1st Italian Conf. on Algorithms"},{"issue":"2","key":"10.1016\/0304-3975(94)90157-0_BIB4","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\/0304-3975(94)90157-0_BIB5","series-title":"Proc. 3rd Internet. Symp. on Algorithms and Computation","first-page":"61","article-title":"Parallel and on-line graph coloring","author":"Halld\u00f3rsson","year":"1992"},{"key":"10.1016\/0304-3975(94)90157-0_BIB6","series-title":"Proc. DIMACS Workshop on On-Line Algorithms","article-title":"Lower bounds for on-line graph coloring","author":"Halld\u00f3rsson","year":"1991"},{"key":"10.1016\/0304-3975(94)90157-0_BIB7","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1109\/FSCS.1990.89568","article-title":"On-line coloring inductive graphs","author":"Irani","year":"1990","journal-title":"Proc. 31st Ann. IEEE Symp. on Foundations of Computer Science"},{"issue":"4","key":"10.1016\/0304-3975(94)90157-0_BIB8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","article-title":"Worst-case performance bounds for simple one-dimensional packing algorithms","volume":"3","author":"Johnson","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90157-0_BIB9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(91)90231-6","article-title":"Online matching with blocked input","volume":"38","author":"Kao","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90157-0_BIB10","first-page":"143","article-title":"An extremal problem in recursive combinatorics","author":"Kierstead","year":"1981","journal-title":"Proc. 12th Southeastern Conf. on Combinatorics, Graph Theory, and Computing. Congressus Numerantium XXXIII"},{"key":"10.1016\/0304-3975(94)90157-0_BIB11","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\/0304-3975(94)90157-0_BIB12","first-page":"208","article-title":"Competitive algorithms for on-line problems","volume":"11","author":"Manasse","year":"1990","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(94)90157-0_BIB13","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/2402.322385","article-title":"Smallest-last ordering and clustering and graph coloring algorithms","volume":"30","author":"Matula","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90157-0_BIB14","volume":"Vol. 52","author":"Spencer","year":"1987"},{"key":"10.1016\/0304-3975(94)90157-0_BIB15","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/0196-6774(92)90061-G","article-title":"Randomized online graph coloring","volume":"13","author":"Vishwanathan","year":"1992","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)90157-0_BIB16","first-page":"535","article-title":"Probabilistic computations: Towards a unified measure of complexity","author":"Yao","year":"1977","journal-title":"Proc. 18th Ann. IEEE Symp. on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901570?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901570?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:16:50Z","timestamp":1580901410000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594901570"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90157-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}