{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:42:47Z","timestamp":1725622967236},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0020-0190(83)90078-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"97-101","source":"Crossref","is-referenced-by-count":55,"title":["Finding Hamiltonian circuits in proper interval graphs"],"prefix":"10.1016","volume":"17","author":[{"given":"Alan A.","family":"Bertossi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90078-9_BIB1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","article-title":"The edge Hamiltonian path problem is NP-complete","volume":"13","author":"Bertossi","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(83)90078-9_BIB2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(79)90011-5","article-title":"Minimum node disjoint path covering for circular-arc graphs","volume":"8","author":"Bonuccelli","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(83)90078-9_BIB3","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\/0020-0190(83)90078-9_BIB4","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/359545.359553","article-title":"On the complexity of computing the measure of \u222a[ai,bi]","volume":"21","author":"Fredman","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(83)90078-9_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(83)90078-9_BIB6","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","article-title":"The planar Hamiltonian circuit problem is NP-complete","volume":"5","author":"Garey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90078-9_BIB7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230030305","article-title":"Algorithms for a maximum clique and a maximum independent set of a circle graph","volume":"3","author":"Gavril","year":"1973","journal-title":"Networks"},{"key":"10.1016\/0020-0190(83)90078-9_BIB8","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\/0020-0190(83)90078-9_BIB9","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"1","key":"10.1016\/0020-0190(83)90078-9_BIB10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/990518.990521","article-title":"An NP-hard problem in bipartite graphs","volume":"7","author":"Krishnamoorthy","year":"1976","journal-title":"SIGACT News"},{"key":"10.1016\/0020-0190(83)90078-9_BIB11","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 and Discrete Methods"},{"key":"10.1016\/0020-0190(83)90078-9_BIB12","series-title":"Proof Techniques in Graph Theory","first-page":"139","article-title":"Indifference graphs","author":"Roberts","year":"1969"},{"key":"10.1016\/0020-0190(83)90078-9_BIB13","series-title":"Discrete Mathematical Models, with Applications to Social, Biological and Environmental Problems","author":"Roberts","year":"1976"},{"key":"10.1016\/0020-0190(83)90078-9_BIB14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0041-1647(68)90016-6","article-title":"Scheduling of traffic lights\u2014A new approach","volume":"2","author":"Stouffers","year":"1968","journal-title":"Transportation Res."},{"key":"10.1016\/0020-0190(83)90078-9_BIB15","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0129040","article-title":"Coloring a family of circular-arc graphs","volume":"29","author":"Tucker","year":"1975","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0020-0190(83)90078-9_BIB16","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":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90078-9_BIB17","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/356707.356711","article-title":"A survey of analysis techniques for discrete algorithms","volume":"9","author":"Weide","year":"1977","journal-title":"Comput. Surveys"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900789?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900789?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:56:31Z","timestamp":1555088191000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0020019083900789"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90078-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}