{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:43Z","timestamp":1725544063478},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_25","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T11:02:51Z","timestamp":1151665371000},"page":"270-281","source":"Crossref","is-referenced-by-count":3,"title":["Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Tiskin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.tcs.2004.03.057","volume":"321","author":"M.H. Albert","year":"2004","unstructured":"Albert, M.H., Golynski, A., Hamel, A.M., L\u00f3pez-Ortiz, A., Rao, S.S., Safari, M.A.: Longest increasing subsequences in sliding windows. Theoretical Computer Science\u00a0321, 405\u2013414 (2004)","journal-title":"Theoretical Computer Science"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.endm.2005.05.019","volume":"19","author":"C.E.R. Alves","year":"2005","unstructured":"Alves, C.E.R., C\u00e1ceres, E.N., Song, S.W.: An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics\u00a019, 133\u2013139 (2005)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(92)90200-T","volume":"36","author":"A. Apostolico","year":"1992","unstructured":"Apostolico, A., Atallah, M.J., Hambrusch, S.E.: New clique and independent set algorithms for circle graphs. Discrete Applied Mathematics\u00a036, 1\u201324 (1992)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional divide-and-conquer. Communications of the ACM\u00a023(4), 214\u2013229 (1980)","journal-title":"Communications of the ACM"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(00)00124-1","volume":"76","author":"S. Bespamyatnikh","year":"2000","unstructured":"Bespamyatnikh, S., Segal, M.: Enumerating longest increasing subsequences and patience sorting. Information Processing Letters\u00a076, 7\u201311 (2000)","journal-title":"Information Processing Letters"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1007\/11602613_114","volume-title":"Algorithms and Computation","author":"E. Chen","year":"2005","unstructured":"Chen, E., Yuan, H., Yang, L.: Longest increasing subsequences in windows based on canonical antichain partition. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 1153\u20131162. Springer, Heidelberg (2005)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288531","volume":"13","author":"E.W. Dijkstra","year":"1980","unstructured":"Dijkstra, E.W.: Some beautiful arguments using mathematical induction. Acta Informatica\u00a013, 1\u20138 (1980)","journal-title":"Acta Informatica"},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/B978-0-12-417750-5.50011-7","volume-title":"Theory of Machines and Computations","author":"S. Even","year":"1971","unstructured":"Even, S., Itai, A.: Queues, stacks and graphs. In: Theory of Machines and Computations, pp. 71\u201386. Academic Press, London (1971)"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F. Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks\u00a03, 261\u2013273 (1973)","journal-title":"Networks"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/0214018","volume":"14","author":"W.-L. Hsu","year":"1985","unstructured":"Hsu, W.-L.: Maximum weight clique algorithms for circular-arc graphs and circle graphs. SIAM Journal on Computing\u00a014(1), 224\u2013231 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-30551-4_49","volume-title":"Algorithms and Computation","author":"J. JaJa","year":"2004","unstructured":"JaJa, J., Mortensen, C., Shi, Q.: Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 558\u2013568. Springer, Heidelberg (2004)"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/net.3230200203","volume":"20","author":"S. Masuda","year":"1990","unstructured":"Masuda, S., Nakajima, K., Kashiwabara, T., Fujisawa, T.: Efficient algorithms for finding maximum cliques of an overlap graph. Networks\u00a020, 157\u2013171 (1990)","journal-title":"Networks"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/net.3230110305","volume":"11","author":"D. Rotem","year":"1981","unstructured":"Rotem, D., Urrutia, J.: Finding maximum cliques in circle graphs. Networks\u00a011, 269\u2013278 (1981)","journal-title":"Networks"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/11753728_36","volume-title":"Computer Science \u2013 Theory and Applications","author":"A. Tiskin","year":"2006","unstructured":"Tiskin, A.: All semi-local longest common subsequences in subquadratic time. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 352\u2013363. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:16Z","timestamp":1619493376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11780441_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}