| 2005 | ||
|---|---|---|
| j1 | I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao: A fast algorithm for computing a longest common increasing subsequence. Inf. Process. Lett. 93(5): 249-253 (2005) | |
| 1 | Kun-Mao Chao | |
| 2 | I-Hsuan Yang |
Data released under the ODC-BY 1.0 license — See also our legal information page