{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T10:08:57Z","timestamp":1771236537312,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"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":[[1996,8]]},"DOI":"10.1016\/0304-3975(96)00031-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:42:52Z","timestamp":1027611772000},"page":"225-243","source":"Crossref","is-referenced-by-count":99,"title":["Mutual exclusion scheduling"],"prefix":"10.1016","volume":"162","author":[{"given":"Brenda S","family":"Baker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Edward G","family":"Coffman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(96)00031-X_BIB1","series-title":"Proc. 26th Ann. ACM Symp. on the Theory of Computing","first-page":"346","article-title":"A spectral technique for coloring random 3-colorable graphs","author":"Alon","year":"1994"},{"key":"10.1016\/0304-3975(96)00031-X_BIB2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","article-title":"Every planar map is four colourable, part i: discharging","volume":"21","author":"Appel","year":"1977","journal-title":"Illinois J. Math."},{"key":"10.1016\/0304-3975(96)00031-X_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","article-title":"Approximation algorithms for np-complete problems on planar graphs","volume":"41","author":"Baker","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(96)00031-X_BIB4","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01840398","article-title":"A better performance guarantee for approximate graph coloring","volume":"5","author":"Berger","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(96)00031-X_BIB5","series-title":"Dpmain Decomposition Methods in Scientific and Engineering Computing","first-page":"369","article-title":"parallel domain decomposition applied to coupled transport equations","author":"Bj\u00f8rstad","year":"1995"},{"key":"10.1016\/0304-3975(96)00031-X_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12629-5_28","article-title":"Restrictions of graph partition problems","author":"Bodlaender","year":"1991"},{"key":"10.1016\/0304-3975(96)00031-X_BIB7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(94)90009-4","article-title":"Scheduling with incopatible jobs","volume":"55","author":"Bolaender","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(96)00031-X_BIB8","series-title":"Computers and Itractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(96)00031-X_BIB9","series-title":"Graph Theory","author":"Harry","year":"1969"},{"key":"10.1016\/0304-3975(96)00031-X_BIB10","series-title":"WG Conf.","first-page":"97","article-title":"On the complexity of some chain and anti-chain partition problems","author":"Lonc","year":"1991"},{"key":"10.1016\/0304-3975(96)00031-X_BIB11","series-title":"Proc. 25th Ann. ACM Symp. on the Theory of Computing","first-page":"286","article-title":"On the hardness of approximating minimization problems","author":"Lund","year":"1993"},{"key":"10.1016\/0304-3975(96)00031-X_BIB12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","article-title":"An upper bound for the chromatic number of a graph and its application to time-tabling problems","volume":"10","author":"Welsh","year":"1967","journal-title":"Computer J."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759600031X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759600031X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T16:59:03Z","timestamp":1578675543000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759600031X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["030439759600031X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(96)00031-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}