{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:04:11Z","timestamp":1767773051835},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"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":[[1990,8]]},"DOI":"10.1016\/0020-0190(90)90025-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"205-211","source":"Crossref","is-referenced-by-count":32,"title":["An optimum \u0398(n log n) algorithm for finding a canonical hamiltonian path and a canonical hamiltonian circuit in a set of intervals"],"prefix":"10.1016","volume":"35","author":[{"given":"Glenn K.","family":"Manacher","sequence":"first","affiliation":[]},{"given":"Terrance A.","family":"Mankus","sequence":"additional","affiliation":[]},{"given":"Carol Joan","family":"Smith","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90025-S_BIB1_1","first-page":"87","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(90)90025-S_BIB1_2","first-page":"148","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(90)90025-S_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0020-0190(83)90078-9","article-title":"Finding Hamiltonian circuits in proper interval graphs","volume":"17","author":"Bertossi","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90025-S_BIB3","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(90)90025-S_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\/0020-0190(90)90025-S_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\/0020-0190(90)90025-S_BIB6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","article-title":"Finding hamiltonian circuits in interval graphs","volume":"20","author":"Keil","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90025-S_BIB7","first-page":"24","article-title":"An optimum \u0398(n log n) algorithm for finding a canonical hamiltonian path and a canonical hamiltonian circuit in a set of intervals","author":"Manacher","year":"1987","journal-title":"Proc. Twenty-Fifth Annual Allerton Conference on Communication, Control, and Computing"},{"key":"10.1016\/0020-0190(90)90025-S_BIB8","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"Emde Boas","year":"1977","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090025S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090025S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:54:12Z","timestamp":1555073652000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090025S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["002001909090025S"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90025-s","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}