We give an Õ(n^2) time algorithm for computing the exact Dynamic
Time Wa...
In vertex-cut sparsification, given a graph G=(V,E) with a terminal set
...
The Suffix Array SA_S[1… n] of an n-length string S is a
lexicographical...
The k-mappability problem has two integers parameters m and k. For
every...
The Suffix Array SA(S) of a string S[1 ... n] is an array containing all...
Lately, there is a growing interest in dynamic string matching problems....