A New Flexible Algorithm for the Longest Common Subsequence Problem. - Claus Rick (Nord. J. Comput., 1995)

Deriving Non-approximability Results by Reductions. - Claus Rick; Hein Röhrig (Lectures on Proof Verification and Approximation Algorithms, 1997)

Efficient Computation of All Longest Common Subsequences. - Claus Rick (SWAT, 2000)

Simple and fast linear space computation of longest common subsequences. - Claus Rick (Inf. Process. Lett., 2000)