| |
| 2000 | ||
|---|---|---|
| 5 | EE | Claus Rick: Efficient Computation of All Longest Common Subsequences. SWAT 2000: 407-418 |
| 4 | EE | Claus Rick: Simple and fast linear space computation of longest common subsequences. Inf. Process. Lett. 75(6): 275-281 (2000) |
| 1997 | ||
| 3 | EE | Claus Rick, Hein Röhrig: Deriving Non-approximability Results by Reductions. Lectures on Proof Verification and Approximation Algorithms 1997: 213-234 |
| 1995 | ||
| 2 | Claus Rick: A New Flexible Algorithm for the Longest Common Subsequence Problem. CPM 1995: 340-351 | |
| 1 | Claus Rick: A New Flexible Algorithm for the Longest Common Subsequence Problem. Nord. J. Comput. 2(4): 444-461 (1995) | |
| 1 | Hein Röhrig | [3] |