| No. |
Title |
Author |
Year |
| 1 |
Order-Preserving Squares in Strings |
Gawrychowski, Paweł et al. |
2023 |
| 2 |
Double String Tandem Repeats |
Amir, Amihood et al. |
2020 |
| 3 |
On Indeterminate Strings Matching |
Gawrychowski, Paweł et al. |
2020 |
| 4 |
Cartesian Tree Matching and Indexing |
Park, Sung Gwan et al. |
2019 |
| 5 |
Top Tree Compression of Tries |
Bille, Philip et al. |
2019 |
| 6 |
A Faster Construction of Greedy Consensus Trees |
Gawrychowski, Pawel et al. |
2018 |
| 7 |
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches |
Gawrychowski, Pawel et al. |
2018 |
| 8 |
Two-Dimensional Maximal Repetitions |
Amir, Amihood et al. |
2018 |
| 9 |
The Nearest Colored Node in a Tree |
Gawrychowski, Pawel et al. |
2016 |
| 10 |
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression |
Hermelin, Danny et al. |
2009 |
