No. |
Title |
Author |
Year |
---|

1 |
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String |
Iliopoulos, Costas S. et al. |
2023 |

2 |
Approximate Circular Pattern Matching |
Charalampopoulos, Panagiotis et al. |
2022 |

3 |
Linear-Time Computation of Shortest Covers of All Rotations of a String |
Crochemore, Maxime et al. |
2022 |

4 |
Rectangular Tile Covers of 2D-Strings |
Radoszewski, Jakub et al. |
2022 |

5 |
Computing Covers of 2D-Strings |
Charalampopoulos, Panagiotis et al. |
2021 |

6 |
Hardness of Detecting Abelian and Additive Square Factors in Strings |
Radoszewski, Jakub et al. |
2021 |

7 |
Counting Distinct Patterns in Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2020 |

8 |
The Number of Repetitions in 2D-Strings |
Charalampopoulos, Panagiotis et al. |
2020 |

9 |
Unary Words Have the Smallest Levenshtein k-Neighbourhoods |
Charalampopoulos, Panagiotis et al. |
2020 |

10 |
Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2019 |

11 |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor |
Alzamel, Mai et al. |
2019 |

12 |
Linear-Time Algorithm for Long LCF with k Mismatches |
Charalampopoulos, Panagiotis et al. |
2018 |

13 |
String Periods in the Order-Preserving Model |
Gourdel, Garance et al. |
2018 |

14 |
Faster Longest Common Extension Queries in Strings over General Alphabets |
Gawrychowski, Pawel et al. |
2016 |

15 |
Improved Algorithms for the Range Next Value Problem and Applications |
Iliopoulos, Costas S. et al. |
2008 |