Shortest Unique Substring Queries on Run-Length Encoded Strings. - Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (MFCS, 2016)

Tight bound on the maximum number of shortest unique substrings. - Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2016)

Tight Bounds on the Maximum Number of Shortest Unique Substrings. - Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2017)

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)

Compact Data Structures for Shortest Unique Substring Queries. - Takuya Mieno; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2019)

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. - Takuya Mieno; Yuki Kuhara; Tooru Akagi; Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SOFSEM, 2020)

Lyndon Words, the Three Squares Lemma, and Primitive Squares. - Hideo Bannai; Takuya Mieno; Yuto Nakashima 001 (SPIRE, 2020)

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)

Space-efficient algorithms for computing minimal/shortest unique substrings. - Takuya Mieno; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2020)

String Sanitization Under Edit Distance: Improved and Generalized. - Takuya Mieno; Solon P. Pissis; Leen Stougie; Michelle Sweering (CPM, 2021)

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)

Minimal Absent Words on Run-Length Encoded Strings. - Tooru Akagi; Kouta Okabe; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga (CPM, 2022)

{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. - Takuya Mieno; Shunsuke Inenaga; Takashi Horiyama (CPM, 2022)

Cartesian Tree Subsequence Matching. - Tsubasa Oizumi; Takeshi Kai; Takuya Mieno; Shunsuke Inenaga; Hiroki Arimura (CPM, 2022)

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)

Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. - Laurentius Leonard; Shunsuke Inenaga; Hideo Bannai; Takuya Mieno (SPIRE, 2022)

Computing Minimal Unique Substrings for a Sliding Window. - Takuya Mieno; Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Algorithmica, 2022)

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

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)

Combinatorics of minimal absent words for a sliding window. - Tooru Akagi; Yuki Kuhara; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2022)

Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. - Kouta Okabe; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (SPIRE, 2023)

Internal Longest Palindrome Queries in Optimal Time. - Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama (WALCOM, 2023)

Sliding suffix trees simplified. - Laurentius Leonard; Shunsuke Inenaga; Hideo Bannai; Takuya Mieno (CoRR, 2023)

Finding top-k longest palindromes in substrings. - Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama (Theor. Comput. Sci., 2023)

Shortest Cover After Edit. - Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama (CPM, 2024)

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

Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. - Taketo Tsujimoto; Hiroki Shibata 001; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga (IWOCA, 2024)

Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations. - Wataru Sumiyoshi; Takuya Mieno; Shunsuke Inenaga (SPIRE, 2024)

Computing Longest Common Subsequence under Cartesian-Tree Matching Model. - Taketo Tsujimoto; Koki Shibata; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga (CoRR, 2024)

Subsequence Pattern Matching with Segment Number Constraint. - Yuki Yonemoto; Takuya Mieno; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2024)

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

Subsequence Matching and LCS with Segment Number Constraints. - Yuki Yonemoto; Takuya Mieno; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (CIAC (2), 2025)

Sorted Consecutive Occurrence Queries in Substrings. - Waseem Akram 002; Takuya Mieno (CPM, 2025)

Space-Efficient Online Computation of String Net Occurrences. - Takuya Mieno; Shunsuke Inenaga (CPM, 2025)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. - Takuya Mieno; Shun Takahashi; Kazuhisa Seto; Takashi Horiyama (SOFSEM (2), 2025)

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

Longest Unbordered Factors on Run-Length Encoded Strings. - Shoma Sekizaki; Takuya Mieno (CoRR, 2025)