Hideo Bannai, Tomohiro I, Dominik Köppl. Longest bordered and periodic subsequences. Information Processing Letters. 2023. 182. 106398-106398
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi. Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica. 2023
Tomohiro I, Dominik Köppl. Space-Efficient B Trees via Load-Balancing. Combinatorial Algorithms - 33rd International Workshop(IWOCA). 2022. 327-340
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi. Computing Longest (Common) Lyndon Subsequences. Lecture Notes in Computer Science. 2022. 128-142
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto. A Separation of $$\gamma $$ and b via Thue-Morse Words. String Processing and Information Retrieval. 2021. 167-178