| No. |
Title |
Author |
Year |
| 1 |
Optimal LZ-End Parsing Is Hard |
Bannai, Hideo et al. |
2023 |
| 2 |
Minimal Absent Words on Run-Length Encoded Strings |
Akagi, Tooru et al. |
2022 |
| 3 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures |
Nakashima, Katsuhito et al. |
2020 |
| 4 |
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences |
Funakoshi, Mitsuru et al. |
2020 |
| 5 |
An Improved Data Structure for Left-Right Maximal Generic Words Problem |
Fujishige, Yuta et al. |
2019 |
| 6 |
Computing Runs on a Trie |
Sugahara, Ryo et al. |
2019 |
| 7 |
Faster Queries for Longest Substring Palindrome After Block Edit |
Funakoshi, Mitsuru et al. |
2019 |
| 8 |
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations |
Urabe, Yuki et al. |
2019 |
| 9 |
Faster Online Elastic Degenerate String Matching |
Aoyama, Kotaro et al. |
2018 |
| 10 |
Longest Lyndon Substring After Edit |
Urabe, Yuki et al. |
2018 |
| 11 |
Longest substring palindrome after edit |
Funakoshi, Mitsuru et al. |
2018 |
| 12 |
Lyndon Factorization of Grammar Compressed Texts Revisited |
Furuya, Isamu et al. |
2018 |
| 13 |
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings |
Fujishige, Yuta et al. |
2017 |
| 14 |
On the Size of Lempel-Ziv and Lyndon Factorizations |
Kärkkäinen, Juha et al. |
2017 |
