The Position Heap of a Trie. - Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2012)

Efficient Lyndon Factorization of Grammar Compressed Text. - Tomohiro I; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2013)

A new characterization of maximal repetitions by Lyndon trees. - Hideo Bannai; Tomohiro I; Shunsuke Inenaga; Yuto Nakashima 001; Masayuki Takeda; Kazuya Tsuruta (SODA, 2015)

Computing Left-Right Maximal Generic Words. - Takaaki Nishimoto; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2015)

Constructing LZ78 tries and position heaps in linear time for large alphabets. - Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Process. Lett., 2015)

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

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)

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. - Tomohiro I; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2016)

Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. - Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (ISAAC, 2017)

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

On the Size of Lempel-Ziv and Lyndon Factorizations. - Juha Kärkkäinen; Dominik Kempa; Yuto Nakashima 001; Simon J. Puglisi; Arseny M. Shur (STACS, 2017)

On Reverse Engineering the Lyndon Tree. - Yuto Nakashima 001; Takuya Takagi; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2017)

The "Runs" Theorem. - Hideo Bannai; Tomohiro I; Shunsuke Inenaga; Yuto Nakashima 001; Masayuki Takeda; Kazuya Tsuruta (SIAM J. Comput., 2017)

Inferring strings from Lyndon factorization. - Yuto Nakashima 001; Takashi Okabe; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2017)

Faster Online Elastic Degenerate String Matching. - Kotaro Aoyama; Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

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

Lyndon Factorization of Grammar Compressed Texts Revisited. - Isamu Furuya; Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Longest Lyndon Substring After Edit. - Yuki Urabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. - Yuki Kuhara; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2018)

Right-to-left Online Construction of Parameterized Position Heaps. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2018)

O(n log n)-time Text Compression by LZ-style Longest First Substitution. - Akihiro Nishi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2018)

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)

The Parameterized Position Heap of a Trie. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CIAC, 2019)

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

Computing Runs on a Trie. - Ryo Sugahara; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2019)

On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. - Yuki Urabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2019)

MR-RePair: Grammar Compression Based on Maximal Repeats. - Isamu Furuya; Takuya Takagi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Takuya Kida (DCC, 2019)

An Improved Data Structure for Left-Right Maximal Generic Words Problem. - Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (ISAAC, 2019)

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

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2019)

On Longest Common Property Preserved Substring Queries. - Kazuki Kai; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Tomasz Kociumaka (SPIRE, 2019)

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

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

Dynamic Packed Compact Tries Revisited. - Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2019)

On the size of the smallest alphabet for Lyndon trees. - Yuto Nakashima 001; Takuya Takagi; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2019)

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

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. - Katsuhito Nakashima; Noriki Fujisato; Diptarama Hendrian; Yuto Nakashima 001; Ryo Yoshinaka; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda (CPM, 2020)

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)

Faster STR-EC-LCS Computation. - Kohei Yamada; 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)

On Repetitiveness Measures of Thue-Morse Words. - Kanaru Kutsukake; Takuya Matsumoto; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2020)

Towards Efficient Interactive Computation of Dynamic Time Warping Distance. - Akihiro Nishi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2020)

Practical Grammar Compression Based on Maximal Repeats. - Isamu Furuya; Takuya Takagi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Takuya Kida (Algorithms, 2020)

Grammar-compressed Self-index with Lyndon Words. - Kazuya Tsuruta; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 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)

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)

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)

The Parameterized Suffix Tray. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CIAC, 2021)

Grammar Index by Induced Suffix Sorting. - Tooru Akagi; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2021)

Longest Common Rollercoasters. - Kosuke Fujita; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (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)

Position Heaps for Cartesian-Tree Matching on Strings and Tries. - Akio Nishimoto; Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga (SPIRE, 2021)

Counting Lyndon Subsequences. - Ryo Hirakawa; Yuto Nakashima 001; Shunsuke Inenaga; Masayuki Takeda (Stringology, 2021)

Compressed Communication Complexity of Hamming Distance. - Shiori Mitsuya; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Algorithms, 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)

Efficiently computing runs on a trie. - Ryo Sugahara; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2021)

Minimal Absent Words on Run-Length Encoded Strings. - Tooru Akagi; Kouta Okabe; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga (CPM, 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)

c-trie++: A dynamic trie tailored for fast prefix searches. - Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Comput., 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)

Factorizing Strings into Repetitions. - Hiroe Inoue; Yoshiaki Matsuoka; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theory Comput. Syst., 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)

Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. - Katsuhito Nakashima; Noriki Fujisato; Diptarama Hendrian; Yuto Nakashima 001; Ryo Yoshinaka; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda (Theor. Comput. Sci., 2022)

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

On Sensitivity of Compact Directed Acyclic Word Graphs. - Hiroto Fujimaru; Yuto Nakashima 001; Shunsuke Inenaga (WORDS, 2023)

Space-Efficient STR-IC-LCS Computation. - Yuuki Yonemoto; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (SOFSEM, 2023)

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. - Hiroki Arimura; Shunsuke Inenaga; Yasuaki Kobayashi; Yuto Nakashima 001; Mizuki Sue (SPIRE, 2023)

Largest Repetition Factorization of Fibonacci Words. - Kaisei Kishi; Yuto Nakashima 001; Shunsuke Inenaga (SPIRE, 2023)

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

Computing SEQ-IC-LCS of Labeled Graphs. - Yuuki Yonemoto; Yuto Nakashima 001; Shunsuke Inenaga (PSC, 2023)

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

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

On the Number of Non-equivalent Parameterized Squares in a String. - Rikuya Hamai; Kazushi Taketsugu; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (SPIRE, 2024)

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

Faster space-efficient STR-IC-LCS computation. - Yuki Yonemoto; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (Theor. Comput. Sci., 2024)

On the Compressiveness of the Burrows-Wheeler Transform. - Hideo Bannai; Tomohiro I; Yuto Nakashima 001 (CPM, 2025)

Maximal α-Gapped Repeats in a Fibonacci String. - Kazuma Yamane; Yuto Nakashima 001; 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)

Tight bounds for the sensitivity of CDAWGs with left-end edits. - Hiroto Fujimaru; Yuto Nakashima 001; Shunsuke Inenaga (Acta Informatica, 2025)

LZSE: an LZ-style compressor supporting O(log n)-time random access. - Hiroki Shibata 001; Yuto Nakashima 001; Yutaro Yamaguchi 001; Shunsuke Inenaga (CoRR, 2025)

Counting distinct (non-)crossing substrings. - Haruki Umezaki; Hiroki Shibata 001; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (CoRR, 2025)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors. - Yuto Fujie; Hiroki Shibata 001; Yuto Nakashima 001; Shunsuke Inenaga (CoRR, 2025)

Nyldon Factorization of Thue-Morse Words and Fibonacci Words. - Kaisei Kishi; Kazuki Kai; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (CoRR, 2025)