| No. |
Title |
Author |
Year |
| 1 |
An Algorithmic Bridge Between Hamming and Levenshtein Distances |
Goldenberg, Elazar et al. |
2023 |
| 2 |
Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths |
Kociumaka, Tomasz et al. |
2023 |
| 3 |
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String |
Iliopoulos, Costas S. et al. |
2023 |
| 4 |
Approximate Circular Pattern Matching |
Charalampopoulos, Panagiotis et al. |
2022 |
| 5 |
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding |
Das, Debarati et al. |
2022 |
| 6 |
The Dynamic k-Mismatch Problem |
Clifford, Raphaël et al. |
2022 |
| 7 |
Faster Algorithms for Longest Common Substring |
Charalampopoulos, Panagiotis et al. |
2021 |
| 8 |
Approximating Longest Common Substring with k mismatches: Theory and Practice |
Gourdel, Garance et al. |
2020 |
| 9 |
Counting Distinct Patterns in Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2020 |
| 10 |
Dynamic String Alignment |
Charalampopoulos, Panagiotis et al. |
2020 |
| 11 |
Improved Circular k-Mismatch Sketches |
Golan, Shay et al. |
2020 |
| 12 |
Practical Performance of Space Efficient Data Structures for Longest Common Extensions |
Dinklage, Patrick et al. |
2020 |
| 13 |
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time |
Golan, Shay et al. |
2020 |
| 14 |
Time-Space Tradeoffs for Finding a Long Common Substring |
Ben-Nun, Stav et al. |
2020 |
| 15 |
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number |
Casel, Katrin et al. |
2019 |
| 16 |
Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2019 |
| 17 |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor |
Alzamel, Mai et al. |
2019 |
| 18 |
RLE Edit Distance in Near Optimal Time |
Clifford, Raphaël et al. |
2019 |
| 19 |
Edit Distance with Block Operations |
Ganczorz, Michal et al. |
2018 |
| 20 |
Linear-Time Algorithm for Long LCF with k Mismatches |
Charalampopoulos, Panagiotis et al. |
2018 |
| 21 |
Longest Unbordered Factor in Quasilinear Time |
Kociumaka, Tomasz et al. |
2018 |
| 22 |
String Periods in the Order-Preserving Model |
Gourdel, Garance et al. |
2018 |
| 23 |
Efficient Index for Weighted Sequences |
Barton, Carl et al. |
2016 |
| 24 |
Faster Longest Common Extension Queries in Strings over General Alphabets |
Gawrychowski, Pawel et al. |
2016 |
| 25 |
Minimal Suffix and Rotation of a Substring in Optimal Time |
Kociumaka, Tomasz |
2016 |
| 26 |
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles |
Kociumaka, Tomasz et al. |
2016 |
| 27 |
Approximating Upper Degree-Constrained Partial Orientations |
Cygan, Marek et al. |
2015 |
| 28 |
Constant Factor Approximation for Capacitated k-Center with Outliers |
Cygan, Marek et al. |
2014 |
| 29 |
Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries |
Kociumaka, Tomasz et al. |
2013 |
