External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences

Chun Lin, Chao-Yuan Huang, Ming-Jer Tsai. An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences. In Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee, editors, Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings. Volume 13025 of Lecture Notes in Computer Science, pages 25-36, Springer, 2021. [doi]

Authors

Chun Lin

This author has not been identified. Look up 'Chun Lin' in Google

Chao-Yuan Huang

This author has not been identified. Look up 'Chao-Yuan Huang' in Google

Ming-Jer Tsai

This author has not been identified. Look up 'Ming-Jer Tsai' in Google
runs on