{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:44:41Z","timestamp":1787388281202,"version":"build-2736575974"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,2]]},"abstract":"<jats:p>Circle graphs and circular-arc graphs are the intersection graphs of chords and arcs in a circle. In this paper we present algorithms for finding maximum weight cliques in these graphs. The running times of the algorithms are $O(n^2 + m\\log \\log n)$ for circle graphs and $O(mn)$ for circular-arc graphs. Our algorithms are based on the scanning of appropriate endpoint sequences and efficient bookkeeping of results for subproblems.<\/jats:p>","DOI":"10.1137\/0214018","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"224-231","source":"Crossref","is-referenced-by-count":49,"title":["Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs"],"prefix":"10.1137","volume":"14","author":[{"given":"Wen-Lian","family":"Hsu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","unstructured":"M. A. Buckingham,  Efficient stable set and clique fidning algorithms for overlap graphs, Dept. Computer Science, New York Univ., New York,  1981"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90031-X"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683268"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1137\/0601025"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040407"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030305"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120410"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110305"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1002\/jcp.1040700403"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/0041-1647(68)90016-6"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0129040"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/0209001"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:25Z","timestamp":1787337745000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["10.1137\/0214018"],"URL":"https:\/\/doi.org\/10.1137\/0214018","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}