The following pages link to Kun-Mao Chao (Q294614):
Displaying 8 items.
- An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Efficient algorithms for local ranking (Q436589) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Finding all sorting tandem duplication random loss operations (Q533407) (← links)
- A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252) (← links)
- The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)
- Algorithms and Computation (Q5191636) (← links)
