Computing Smallest and Largest Repetition Factorizations in O(n log n) Time. - Hiroe Inoue; Yoshiaki Matsuoka; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2016)

Shortest Unique Palindromic Substring Queries in Optimal Time. - Yuto Nakashima 001; Hiroe Inoue; Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2017)

Algorithms and combinatorial properties on shortest unique palindromic substrings. - Hiroe Inoue; Yuto Nakashima 001; Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (J. Discrete Algorithms, 2018)

Factorizing Strings into Repetitions. - Hiroe Inoue; Yoshiaki Matsuoka; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theory Comput. Syst., 2022)