{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:56:44Z","timestamp":1773385004792,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"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":[[1987,12]]},"DOI":"10.1016\/0020-0190(87)90007-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"209-215","source":"Crossref","is-referenced-by-count":17,"title":["Finding maximum cliques on circular-arc graphs"],"prefix":"10.1016","volume":"26","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"Susanne E.","family":"Hambrusch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90007-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(87)90007-X_BIB2","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"1","key":"10.1016\/0020-0190(87)90007-X_BIB3","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0214018","article-title":"Maximum weight clique algorithms for circular-arc graphs and circle graphs","volume":"14","author":"Hsu","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(87)90007-X_BIB4","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: An ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/0020-0190(87)90007-X_BIB5","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":"Van 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:002001908790007X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908790007X?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:59:14Z","timestamp":1555073954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908790007X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["002001908790007X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90007-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}