Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. - Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2019)

Computing Palindromic Trees for a Sliding Window and Its Applications. - Takuya Mieno; Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2020)

Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings. - Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theory Comput. Syst., 2020)

Palindromic trees for a sliding window and its applications. - Takuya Mieno; Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Process. Lett., 2022)