| No. |
Title |
Author |
Year |
| 1 |
Approximate Circular Pattern Matching |
Charalampopoulos, Panagiotis et al. |
2022 |
| 2 |
Longest Palindromic Substring in Sublinear Time |
Charalampopoulos, Panagiotis et al. |
2022 |
| 3 |
An Almost Optimal Edit Distance Oracle |
Charalampopoulos, Panagiotis et al. |
2021 |
| 4 |
Computing Covers of 2D-Strings |
Charalampopoulos, Panagiotis et al. |
2021 |
| 5 |
Faster Algorithms for Longest Common Substring |
Charalampopoulos, Panagiotis et al. |
2021 |
| 6 |
Internal Shortest Absent Word Queries |
Badkobeh, Golnaz et al. |
2021 |
| 7 |
Pattern Masking for Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2021 |
| 8 |
Counting Distinct Patterns in Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2020 |
| 9 |
Dynamic Longest Common Substring in Polylogarithmic Time |
Charalampopoulos, Panagiotis et al. |
2020 |
| 10 |
Dynamic String Alignment |
Charalampopoulos, Panagiotis et al. |
2020 |
| 11 |
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs |
Charalampopoulos, Panagiotis et al. |
2020 |
| 12 |
The Number of Repetitions in 2D-Strings |
Charalampopoulos, Panagiotis et al. |
2020 |
| 13 |
Unary Words Have the Smallest Levenshtein k-Neighbourhoods |
Charalampopoulos, Panagiotis et al. |
2020 |
| 14 |
Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2019 |
| 15 |
Longest Common Substring Made Fully Dynamic |
Amir, Amihood et al. |
2019 |
| 16 |
Repetition Detection in a Dynamic String |
Amir, Amihood et al. |
2019 |
| 17 |
Linear-Time Algorithm for Long LCF with k Mismatches |
Charalampopoulos, Panagiotis et al. |
2018 |
| 18 |
Optimal Computation of Overabundant Words |
Almirantis, Yannis et al. |
2017 |
