{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:42Z","timestamp":1725663402987},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549451"},{"type":"electronic","value":"9783540466000"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_63","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:19:32Z","timestamp":1330211972000},"page":"199-207","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic programming on intervals"],"prefix":"10.1007","author":[{"given":"Takao","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"22_CR1","unstructured":"T. Asano, An faster algorithm for finding a maximum weight clique of a circular-arc graph, Technical Report of Institut f\u00fcr Operations Research, Universit\u00e4t Bonn, 90624-OR, 1990."},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J.L. Bentley","year":"1979","unstructured":"J.L. Bentley, Decomposable searching problems, Information Processing Letters, 8 (1979), pp. 244\u2013251.","journal-title":"Information Processing Letters"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(90)90209-G","volume":"33","author":"A.A. Bertossi","year":"1989\/1990","unstructured":"A.A. Bertossi and S. Moretti, Parallel algorithms on circular-arc graphs Information Processing Letters, 33 (1989\/1990), pp. 275\u2013281.","journal-title":"Information Processing Letters"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0214018","volume":"14","author":"W.-L. Hsn","year":"1985","unstructured":"W.-L. Hsn, Maximum weight clique algorithms for circular-arc graphs and circle graphs, SIAM Journal on Computing, 14 (1985), pp. 224\u2013231.","journal-title":"SIAM Journal on Computing"},{"key":"22_CR5","unstructured":"T. Kaji and A. Ohuchi, Optimal sequential partitions of graphs by branch and bound, Technical Report 90-AL-10, Information Processing Society of Japan, 1990."},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/321623.321627","volume":"18","author":"B.W. Kernighan","year":"1971","unstructured":"B.W. Kernighan, Optimal sequential partitions of graphs, Journal of ACM, 18 (1971), pp. 34\u201340.","journal-title":"Journal of ACM"},{"key":"22_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Intorduction","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry: An Intorduction, Springer-Verlag, New York, 1985."},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(89)90220-2","volume":"31","author":"W.-K. Shih","year":"1989","unstructured":"W.-K. Shih and W.-L. Hsu, An O(n log n+m loglog n) maximum weight clique algorithm for circular-arc graphs, Information Processing Letters, 31 (1989), pp. 129\u2013134.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:26:38Z","timestamp":1619573198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}