Computing Reversed Lempel-Ziv Factorization Online. - Shiho Sugimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2013)

Computing Palindromic Factorizations and Palindromic Covers On-line. - Tomohiro I; Shiho Sugimoto; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2014)

Diverse Palindromic Factorization Is NP-complete. - Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto (DLT, 2015)

Efficient Algorithms for Longest Closed Factor Array. - Hideo Bannai; Shunsuke Inenaga; Tomasz Kociumaka; Arnaud Lefebvre; Jakub Radoszewski; Wojciech Rytter; Shiho Sugimoto; Tomasz Walen (SPIRE, 2015)

Diverse Palindromic Factorization is NP-Complete. - Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto (CoRR, 2015)

Longest Common Abelian Factors and Large Alphabets. - Golnaz Badkobeh; Travis Gagie; Szymon Grabowski; Yuto Nakashima 001; Simon J. Puglisi; Shiho Sugimoto (SPIRE, 2016)

Closed factorization. - Golnaz Badkobeh; Hideo Bannai; Keisuke Goto 001; Tomohiro I; Costas S. Iliopoulos; Shunsuke Inenaga; Simon J. Puglisi; Shiho Sugimoto (Discret. Appl. Math., 2016)

Computing Abelian String Regularities Based on RLE. - Shiho Sugimoto; Naoki Noda; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2017)

Computing Abelian regularities on RLE strings. - Shiho Sugimoto; Naoki Noda; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2017)

Diverse Palindromic Factorization is NP-Complete. - Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Shiho Sugimoto (Int. J. Found. Comput. Sci., 2018)

k-Abelian Pattern Matching: Revisited, Corrected, and Extended. - Golnaz Badkobeh; Hideo Bannai; Maxime Crochemore; Tomohiro I; Shunsuke Inenaga; Shiho Sugimoto (Stringology, 2019)