国際会議

• Hiroto Fujimaru, Takuya Mieno, Shunsuke Inenaga: On the number of MUSs crossing a position. SPIRE 2025

• Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai: Nyldon Factorization of Thue-Morse Words and Fibonacci Word. SPIRE 2025

• Yuto Fujie, Hiroki Shibata, Yuto Nakashima, Shunsuke Inenaga: Tight Additive Sensitivity on LZ-style Compressors and String Attractors. SPIRE 2025

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

• Yuto Nakashima, Jakub Radoszewski, Tomasz Waleń: Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares. ESA 2025

• Alan Cleary, Joseph Winjum, Jordan Dood, Hiroki Shibata, Shunsuke Inenaga: Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access. SEA 2025

• Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara: Subsequence Matching and LCS with Segment Number Constraints. CIAC 2025

• Peaker Guo, Kaisei Kishi: Net Occurrences in Fibonacci and Thue-Morse Words. CPM 2025

• Takuya Mieno, Shunsuke Inenaga: Space-Efficient Online Computation of String Net Occurrences. CPM 2025

• Hideo Bannai, Tomohiro I, Yuto Nakashima: On the compressiveness of the Burrows-Wheeler transform. CPM 2025

国際学術誌

• Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Computing maximal palindromes in non-standard matching models. Information and Computation (2025)

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

• Shunsuke Inenaga: Linear-size suffix tries and linear-size CDAWGs simplified and improved. Acta Informatica (2024)

• Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi: Linear time online algorithms for constructing linear-size suffix trie. Theoretical Computer Science (2024)

• Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai: Faster space-efficient STR-IC-LCS computation. Theoretical Computer Science (2024)

国際会議

• Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga: Packed Acyclic Deterministic Finite Automata. SOFSEM 2025

• Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, Takashi Horiyama: Maximal $\alpha$-gapped Repeats in a Fibonacci String. SOFSEM 2025

• Hiroki Shibata, Dominik Köppl: LZ78 Substring Compression with CDAWGs. SPIRE 2024

• Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga: Faster and simpler online/sliding rightmost Lempel-Ziv factorizations. SPIRE 2024

• Masaru Kikuchi, Shunsuke Inenaga: All-Pairs Suffix-Prefix on Dynamic Set of Strings. SPIRE 2024

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

• Yuki Yonemoto, Shunsuke Inenaga: Simple linear-time repetition factorization. SPIRE 2024

• Alan Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga: Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings. SPIRE 2024

• Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai: Edit and Alphabet-Ordering Sensitivity of Lex-parse. MFCS 2024

• Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga: Computing Longest Common Subsequence under Cartesian-Tree Matching Model. IWOCA 2024

• Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Computing maximal palindromes in non-standard matching models. IWOCA 2024

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