StringologyTimes
CSR for Stringologist
CSR 2020
Optimal Skeleton Huffman Trees Revisited.
CSR 2017
Palindromic Decompositions with Gaps and Errors.
CSR 2013
Alphabetic Minimax Trees in Linear Time.
CSR 2010
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.
CSR 2008
Computing Longest Common Substrings Via Suffix Arrays.