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

LZ78 Substring Compression with CDAWGs. - Hiroki Shibata 001; Dominik Köppl (SPIRE, 2024)

Packed Acyclic Deterministic Finite Automata. - Hiroki Shibata 001; Masakazu Ishihata; Shunsuke Inenaga (SOFSEM (2), 2025)

Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access. - Alan M. Cleary; Joseph Winjum; Jordan Dood; Hiroki Shibata 001; Shunsuke Inenaga (SEA, 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)