{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T22:22:49Z","timestamp":1709418169801},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0377-2217(01)00058-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:56:01Z","timestamp":1034596561000},"page":"483-500","source":"Crossref","is-referenced-by-count":6,"title":["Circular-arc graph coloring: On chords and circuits in the meeting graph"],"prefix":"10.1016","volume":"136","author":[{"given":"Dominique","family":"de Werra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Eisenbeis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Lelait","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"St\u00f6hr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/S0377-2217(01)00058-3_BIB1","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","article-title":"Maintaining knowledge about temporal intervals","volume":"26","author":"Allen","year":"1983","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(92)90200-T","article-title":"New clique and independent set algorithms for circle graphs","volume":"36","author":"Apostolico","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB3","unstructured":"D.H. Bailey, J. Barton, T. Lasinski, H.D. Simon (Eds.), The NAS parallel benchmarks, Technical Report 103863, NASA Ames Research Center, Moffett Field, CA, July 1993"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB4","unstructured":"H. Bodlaender, J. Gustedt, J. Arne Telle. Linear-time register allocation for a fixed number of registers, in: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25\u201327 January 1998, pp. 574\u2013583"},{"issue":"1","key":"10.1016\/S0377-2217(01)00058-3_BIB5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/130616.130617","article-title":"Coloring registers pairs","volume":"1","author":"Briggs","year":"1992","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"6","key":"10.1016\/S0377-2217(01)00058-3_BIB6","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/177492.177575","article-title":"Improvements to graph coloring register allocation","volume":"13","author":"Briggs","year":"1994","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB7","doi-asserted-by":"crossref","unstructured":"Gregory J. Chaitin, Register allocation and spilling via graph coloring, SIGPLAN Notices 17 (6) (1982) 98\u2013105; in: Proceedings of ACM SIGPLAN '82 Symposium on Compiler Construction","DOI":"10.1145\/872726.806984"},{"issue":"2\u20133","key":"10.1016\/S0377-2217(01)00058-3_BIB8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0166-218X(99)00105-5","article-title":"On a graph-theoretical model for cyclic register allocation","volume":"93","author":"de Werra","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB9","unstructured":"C. Eisenbeis, S. Lelait, B. Marmol, The meeting graph: a new model for loop cyclic register allocation, in: Lubomir Bic, Wim B\u00f6hm, Paraskevas Evripidou, Jean-Luc Gaudiot (Eds.) Proceedings of the IFIP WG 10.3 Working Conference on Parallel Architectures and Compilation Techniques, PACT '95, ACM Press, Limassol, Cyprus, June 27\u201329 1995, pp. 264\u2013267"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB10","unstructured":"E.M. Eschen, J.P. Spinrad, An O(n2) algorithm for circular-arc graph recognition, in: Proceedings of the fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, Texas, 1993, pp. 128\u2013137"},{"issue":"2","key":"10.1016\/S0377-2217(01)00058-3_BIB11","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 Journal of Algorithmic Discrete Methods"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB12","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB13","unstructured":"M.C. Golumbic, R. Shamir, Complexity and algorithms for reasoning about time: a graph-theoretic approach, Rapport de recherche DIMACS-TR-91-54, Rutgers University, 1991"},{"issue":"3","key":"10.1016\/S0377-2217(01)00058-3_BIB14","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1145\/177492.177499","article-title":"Efficient register allocation via coloring using clique separators","volume":"16","author":"Gupta","year":"1994","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB15","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular-arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB16","doi-asserted-by":"crossref","unstructured":"Laurie J. Hendren, Guang R. Gao, Erik R. Altman, Chandrika Mukerji. A register allocation framework based on hierarchical cyclic interval graphs, in: U. Kastens, P. Pfahler (Eds.), Compiler Construction: Proceedings of the Fourth International Conference, Compiler Construction '92, Paderborn, Germany, October 1992, LNCS vol. 641, Springer, pp. 176\u2013191","DOI":"10.1007\/3-540-55984-1_17"},{"issue":"3","key":"10.1016\/S0377-2217(01)00058-3_BIB17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","article-title":"Linear time algorithms on circular-arc graphs","volume":"40","author":"Hsu","year":"1991","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB18","unstructured":"Sylvain Lelait. Contribution \u00e0 l'allocation de registres dans les boucles. Th\u00e8se de Doctorat, Universit\u00e9 d'Orl\u00e9ans, January 1996"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB19","unstructured":"F.H. McMahon. The Livermore Fortran Kernels: A computer test of the numerical performance range, Technical report UCRL-53745, Lawrence Livermore National Laboratory, CA, 1986"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB20","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 Journal of Algorithmic Discrete Methods"},{"issue":"3","key":"10.1016\/S0377-2217(01)00058-3_BIB21","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 Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB22","unstructured":"Spec92 benchmarks. http:\/\/www.spec.org\/osg\/cpu92"},{"key":"10.1016\/S0377-2217(01)00058-3_BIB23","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":"25","author":"Teng","year":"1985","journal-title":"Discrete Mathematics"},{"issue":"3","key":"10.1016\/S0377-2217(01)00058-3_BIB24","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 Journal of Applied Mathematics"},{"issue":"5","key":"10.1016\/S0377-2217(01)00058-3_BIB25","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0020-0190(96)00174-3","article-title":"Approximate triclique coloring for register allocation","volume":"60","author":"Venkatesan","year":"1996","journal-title":"Information Processing Letters"},{"issue":"10\u201311","key":"10.1016\/S0377-2217(01)00058-3_BIB26","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/S0167-8191(05)80031-6","article-title":"A detailed look at some popular benchmarks","volume":"17","author":"Weicker","year":"1991","journal-title":"Parallel Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701000583?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701000583?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T19:52:37Z","timestamp":1578426757000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701000583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0377221701000583"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00058-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}