| No. |
Title |
Author |
Year |
| 1 |
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications |
Gabory, Esteban et al. |
2023 |
| 2 |
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String |
Iliopoulos, Costas S. et al. |
2023 |
| 3 |
Suffix-Prefix Queries on a Dictionary |
Loukides, Grigorios et al. |
2023 |
| 4 |
Approximate Circular Pattern Matching |
Charalampopoulos, Panagiotis et al. |
2022 |
| 5 |
Linear-Time Computation of Shortest Covers of All Rotations of a String |
Crochemore, Maxime et al. |
2022 |
| 6 |
Rectangular Tile Covers of 2D-Strings |
Radoszewski, Jakub et al. |
2022 |
| 7 |
Computing Covers of 2D-Strings |
Charalampopoulos, Panagiotis et al. |
2021 |
| 8 |
Hardness of Detecting Abelian and Additive Square Factors in Strings |
Radoszewski, Jakub et al. |
2021 |
| 9 |
Counting Distinct Patterns in Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2020 |
| 10 |
The Number of Repetitions in 2D-Strings |
Charalampopoulos, Panagiotis et al. |
2020 |
| 11 |
Unary Words Have the Smallest Levenshtein k-Neighbourhoods |
Charalampopoulos, Panagiotis et al. |
2020 |
| 12 |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor |
Alzamel, Mai et al. |
2019 |
