Longest substring palindrome after edit. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Faster Queries for Longest Substring Palindrome After Block Edit. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2019)

Computing Maximal Palindromes and Distinct Palindromes in a Trie. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2019)

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Ayumi Shinohara (CPM, 2020)

Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements. - Mitsuru Funakoshi; Julian Pape-Lange (STACS, 2020)

A Separation of γ and b via Thue-Morse Words. - Hideo Bannai; Mitsuru Funakoshi; Tomohiro I; Dominik Köppl; Takuya Mieno; Takaaki Nishimoto (SPIRE, 2021)

Minimal Unique Palindromic Substrings After Single-Character Substitution. - Mitsuru Funakoshi; Takuya Mieno (SPIRE, 2021)

On the Approximation Ratio of LZ-End to LZ77. - Takumi Ideue; Takuya Mieno; Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Masayuki Takeda (SPIRE, 2021)

Computing longest palindromic substring after single-character or block-wise edits. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2021)

Computing Palindromes on a Trie in Linear Time. - Takuya Mieno; Mitsuru Funakoshi; Shunsuke Inenaga (ISAAC, 2022)

Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. - Takuya Mieno; Mitsuru Funakoshi (IWOCA, 2022)

Computing maximal generalized palindromes. - Mitsuru Funakoshi; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2022)

Optimal LZ-End Parsing Is Hard. - Hideo Bannai; Mitsuru Funakoshi; Kazuhiro Kurita; Yuto Nakashima 001; Kazuhisa Seto; Takeaki Uno (CPM, 2023)

Sensitivity of string compressors and repetitiveness measures. - Tooru Akagi; Mitsuru Funakoshi; Shunsuke Inenaga (Inf. Comput., 2023)

Height-Bounded Lempel-Ziv Encodings. - Hideo Bannai; Mitsuru Funakoshi; Diptarama Hendrian; Myuji Matsuda; Simon J. Puglisi (ESA, 2024)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. - Shunsuke Inenaga; Takuya Mieno; Hiroki Arimura; Mitsuru Funakoshi; Yuta Fujishige (IWOCA, 2024)

Edit and Alphabet-Ordering Sensitivity of Lex-Parse. - Yuto Nakashima 001; Dominik Köppl; Mitsuru Funakoshi; Shunsuke Inenaga; Hideo Bannai (MFCS, 2024)

Linear time online algorithms for constructing linear-size suffix trie. - Diptarama Hendrian; Takuya Takagi; Shunsuke Inenaga; Keisuke Goto 001; Mitsuru Funakoshi (Theor. Comput. Sci., 2024)

Data Structures for Computing Unique Palindromes in Static and Non-Static Strings. - Takuya Mieno; Mitsuru Funakoshi (Algorithmica, 2024)

Computing maximal palindromes in non-standard matching models. - Takuya Mieno; Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Comput., 2025)