{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:54:29Z","timestamp":1742997269325,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89543-3_3","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"25-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences"],"prefix":"10.1007","author":[{"given":"Chun","family":"Lin","sequence":"first","affiliation":[]},{"given":"Chao-Yuan","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Ming-Jer","family":"Tsai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10878-006-9031-7","volume":"13","author":"WT Chan","year":"2006","unstructured":"Chan, W.T., Zhang, Y., Fung, S.P.Y., Ye, D., Zhu, H.: Efficient algorithms for finding a longest common increasing subsequence. J. Comb. Optim. 13(3), 277\u2013288 (2006). https:\/\/doi.org\/10.1007\/s10878-006-9031-7","journal-title":"J. Comb. Optim."},{"key":"3_CR2","unstructured":"Duraj, L.: A sub-quadratic algorithm for the longest common increasing subsequence problem. arXiv:1902.06864 [cs], January 2020"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.jda.2011.03.013","volume":"9","author":"M Kutz","year":"2011","unstructured":"Kutz, M., Brodal, G.S., Kaligosi, K., Katriel, I.: Faster algorithms for computing longest common increasing subsequences. J. Discret. Algorithms 9(4), 314\u2013325 (2011). https:\/\/doi.org\/10.1016\/j.jda.2011.03.013","journal-title":"J. Discret. Algorithms"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Lo, S.F., Tseng, K.T., Yang, C.B., Huang, K.S.: A diagonal-based algorithm for the longest common increasing subsequence problem. Theor. Comput. Sci. 815, 69\u201378 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.02.024. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397520301158","DOI":"10.1016\/j.tcs.2020.02.024"},{"issue":"5","key":"3_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ipl.2006.05.005","volume":"99","author":"Y Sakai","year":"2006","unstructured":"Sakai, Y.: A linear space algorithm for computing a longest common increasing subsequence. Inf. Process. Lett. 99(5), 203\u2013207 (2006). https:\/\/doi.org\/10.1016\/j.ipl.2006.05.005","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"3_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ipl.2004.10.014","volume":"93","author":"IH Yang","year":"2005","unstructured":"Yang, I.H., Huang, C.P., Chao, K.M.: A fast algorithm for computing a longest common increasing subsequence. Inf. Process. Lett. 93(5), 249\u2013253 (2005). https:\/\/doi.org\/10.1016\/j.ipl.2004.10.014","journal-title":"Inf. Process. Lett."},{"key":"3_CR7","unstructured":"Zhu, D., Wang, L., Wang, T., Wang, X.: A simple linear space algorithm for computing a longest common increasing subsequence. arXiv:1608.07002 [cs], August 2016"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:06:02Z","timestamp":1634781962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}