{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T02:11:18Z","timestamp":1768788678169,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0012-365x(98)00169-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"103-109","source":"Crossref","is-referenced-by-count":8,"title":["On the complexity of a restricted list-coloring problem"],"prefix":"10.1016","volume":"195","author":[{"given":"Moshe","family":"Dror","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerd","family":"Finke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Gravier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wieslaw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00169-1_BIB1","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0377-2217(86)90138-4","article-title":"Scheduling tasks on two processors with deadlines and additional resources","volume":"26","author":"Blazewicz","year":"1986","journal-title":"Europ. J. Oper. Res."},{"key":"10.1016\/S0012-365X(98)00169-1_BIB2","series-title":"Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing","first-page":"125","article-title":"Choosability in graphs","volume":"XXVI","author":"Erdős","year":"1979"},{"key":"10.1016\/S0012-365X(98)00169-1_BIB3","article-title":"Coloration et produits de graphes","author":"Gravier","year":"1996"},{"key":"10.1016\/S0012-365X(98)00169-1_BIB4","series-title":"Complexity of list coloring problems with a fixed total number of colors","author":"Gravier","year":"1997"},{"key":"10.1016\/S0012-365X(98)00169-1_BIB5","doi-asserted-by":"crossref","unstructured":"K. Jensen, private communication, June 1997.","DOI":"10.1163\/157006897X00124"},{"key":"10.1016\/S0012-365X(98)00169-1_BIB6","first-page":"3","article-title":"Vertex colorings with given colors","volume":"29","author":"Vizing","year":"1976","journal-title":"Methods Discret. Analiz"},{"key":"10.1016\/S0012-365X(98)00169-1_BIB7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0012-365X(96)00208-7","article-title":"Restricted coloring models for timetabling","volume":"165\/166","author":"de Werra","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00169-1_BIB8","unstructured":"K. Xu, A special case of edge-chromatic scheduling problem, EPFL, Report ORWP 96\/03, Lausanne."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001691?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001691?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:55:08Z","timestamp":1556117708000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0012365X98001691"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00169-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}