{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:19:40Z","timestamp":1759335580329},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"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":6956,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1016\/0166-218x(92)00036-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"291-305","source":"Crossref","is-referenced-by-count":12,"title":["Periodic assignment and graph colouring"],"prefix":"10.1016","volume":"51","author":[{"given":"Jan","family":"Korst","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emile","family":"Aarts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Karel","family":"Lenstra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaap","family":"Wessels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)00036-L_BIB1","series-title":"Mathematical Foundations of Computer Science 1990","first-page":"173","article-title":"On preemptive scheduling of periodic, real-time tasks on one processor","author":"Baruah","year":"1990"},{"key":"10.1016\/0166-218X(92)00036-L_BIB2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01840398","article-title":"A better performance guarantee for approximate graph colouring","volume":"5","author":"Berger","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(92)00036-L_BIB3","series-title":"Graph Theory with Application","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(92)00036-L_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(92)00036-L_BIB5","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/359545.359553","article-title":"On the complexity of computing the measure of U[ai, bi]","volume":"21","author":"Fredman","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(92)00036-L_BIB6","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/0166-218X(92)00036-L_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(92)00036-L_BIB8","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","article-title":"The complexity of coloring circular arcs and chords","volume":"1","author":"Garey","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)00036-L_BIB9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","article-title":"Algorithms on circular-arc graphs","volume":"4","author":"Gavril","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)00036-L_BIB10","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(92)00036-L_BIB11","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TC.1979.1675260","article-title":"An optimal solution for the channel-assignment problem","volume":"28","author":"Gupta","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)00036-L_BIB12","first-page":"155","article-title":"Wire routing by optimizing channel assignment with large apertures","author":"Hashimoto","year":"1971","journal-title":"Proceedings of the 8th Design Automation Conference"},{"key":"10.1016\/0166-218X(92)00036-L_BIB13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)00036-L_BIB14","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(92)00036-L_BIB15","first-page":"166","article-title":"Periodic multiprocessor scheduling","volume":"Vol. 505","author":"Korst","year":"1991"},{"key":"10.1016\/0166-218X(92)00036-L_BIB16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0218005","article-title":"An incremental linear-time algorithm for recognizing interval graphs","volume":"18","author":"Korte","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)00036-L_BIB17","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(92)00036-L_BIB18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/0166-218X(92)00036-L_BIB19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","article-title":"On the complexity of fixed-priority scheduling of periodic, real-time tasks","volume":"2","author":"Leung","year":"1982","journal-title":"Performance Evaluation"},{"key":"10.1016\/0166-218X(92)00036-L_BIB20","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/SFCS.1989.63466","article-title":"Graph products and chromatic numbers","author":"Linial","year":"1989","journal-title":"Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(92)00036-L_BIB21","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard real-time environment","volume":"20","author":"Liu","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)00036-L_BIB22","series-title":"An Introduction to the Theory of Numbers","author":"Niven","year":"1960"},{"key":"10.1016\/0166-218X(92)00036-L_BIB23","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/opre.30.4.760","article-title":"Minimizing the number of vehicles to meet a fixed periodic schedule: an application of periodic posets","volume":"30","author":"Orlin","year":"1982","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(92)00036-L_BIB24","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0602012","article-title":"An O(n2) algorithm for coloring proper circular arc graphs","volume":"2","author":"Orlin","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)00036-L_BIB25","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1287\/opre.33.3.690","article-title":"Optimal scheduling of periodic activities","volume":"33","author":"Park","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(92)00036-L_BIB26","first-page":"208","article-title":"Geometric intersections problems","author":"Shamos","year":"1976","journal-title":"Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(92)00036-L_BIB27","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0166-218X(89)90011-5","article-title":"An O(n1.5) algorithm to color proper circular arcs","volume":"25","author":"Shih","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)00036-L_BIB28","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0012-365X(85)90052-4","article-title":"An O(qn) algorithm to q-color a proper family of circular arcs","volume":"55","author":"Teng","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)00036-L_BIB29","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0129040","article-title":"Coloring a family of circular arcs","volume":"29","author":"Tucker","year":"1975","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(92)00036-L_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0209001","article-title":"An efficient test for circular-arc graphs","volume":"9","author":"Tucker","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)00036-L_BIB31","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","article-title":"An upper bound on the chromatic number of a graph and its application to timetabling problems","volume":"10","author":"Welsh","year":"1967","journal-title":"Comput. J."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9200036L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9200036L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:27:44Z","timestamp":1555136864000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9200036L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0166218X9200036L"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)00036-l","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}