| Shortest unique substring queries on run-length encoded strings T Mieno, S Inenaga, H Bannai, M Takeda 41st International Symposium on Mathematical Foundations of Computer Science …, 2016 | 19 | 2016 |
| Minimal unique substrings and minimal absent words in a sliding window T Mieno, Y Kuhara, T Akagi, Y Fujishige, Y Nakashima, S Inenaga, ... International Conference on Current Trends in Theory and Practice of …, 2020 | 16 | 2020 |
| Algorithms and combinatorial properties on shortest unique palindromic substrings H Inoue, Y Nakashima, T Mieno, S Inenaga, H Bannai, M Takeda Journal of Discrete Algorithms 52, 122-132, 2018 | 14 | 2018 |
| A Separation of and b via Thue–Morse Words H Bannai, M Funakoshi, T I, D Köppl, T Mieno, T Nishimoto International Symposium on String Processing and Information Retrieval, 167-178, 2021 | 8 | 2021 |
| Minimal unique palindromic substrings after single-character substitution M Funakoshi, T Mieno String Processing and Information Retrieval: 28th International Symposium …, 2021 | 7 | 2021 |
| Palindromic trees for a sliding window and its applications T Mieno, K Watanabe, Y Nakashima, S Inenaga, H Bannai, M Takeda Information Processing Letters 173, 106174, 2022 | 6 | 2022 |
| On the approximation ratio of LZ-End to LZ77 T Ideue, T Mieno, M Funakoshi, Y Nakashima, S Inenaga, M Takeda International Symposium on String Processing and Information Retrieval, 114-126, 2021 | 6 | 2021 |
| Compact data structures for shortest unique substring queries T Mieno, D Köppl, Y Nakashima, S Inenaga, H Bannai, M Takeda International Symposium on String Processing and Information Retrieval, 107-123, 2019 | 5 | 2019 |
| Combinatorics of minimal absent words for a sliding window T Akagi, Y Kuhara, T Mieno, Y Nakashima, S Inenaga, H Bannai, ... Theoretical Computer Science 927, 109-119, 2022 | 3 | 2022 |
| Computing minimal unique substrings for a sliding window T Mieno, Y Fujishige, Y Nakashima, S Inenaga, H Bannai, M Takeda Algorithmica 84 (3), 670-693, 2022 | 3 | 2022 |
| Cartesian tree subsequence matching T Oizumi, T Kai, T Mieno, S Inenaga, H Arimura arXiv preprint arXiv:2202.04349, 2022 | 3 | 2022 |
| Tight bounds on the maximum number of shortest unique substrings T Mieno, S Inenaga, H Bannai, M Takeda Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2016 | 3 | 2016 |
| Computing palindromes on a trie in linear time T Mieno, M Funakoshi, S Inenaga arXiv preprint arXiv:2211.03995, 2022 | 2 | 2022 |
| Shortest unique palindromic substring queries in semi-dynamic settings T Mieno, M Funakoshi International Workshop on Combinatorial Algorithms, 425-438, 2022 | 2 | 2022 |
| Repair grammars are the smallest grammars for Fibonacci words T Mieno, S Inenaga, T Horiyama arXiv preprint arXiv:2202.08447, 2022 | 2 | 2022 |
| String sanitization under edit distance: improved and generalized T Mieno, SP Pissis, L Stougie, M Sweering arXiv preprint arXiv:2007.08179, 2020 | 2 | 2020 |
| Data structures for computing unique palindromes in static and non-static strings T Mieno, M Funakoshi Algorithmica 86 (3), 852-873, 2024 | 1 | 2024 |
| Linear-time computation of generalized minimal absent words for multiple strings K Okabe, T Mieno, Y Nakashima, S Inenaga, H Bannai International Symposium on String Processing and Information Retrieval, 331-344, 2023 | 1 | 2023 |
| Internal longest palindrome queries in optimal time K Mitani, T Mieno, K Seto, T Horiyama International Conference and Workshops on Algorithms and Computation, 127-138, 2023 | 1 | 2023 |
| Minimal absent words on run-length encoded strings T Akagi, K Okabe, T Mieno, Y Nakashima, S Inenaga arXiv preprint arXiv:2202.13591, 2022 | 1 | 2022 |
Shunsuke InenagaProfessor, Department of Informatics, Kyushu University在 inf.kyushu-u.ac.jp 的电子邮件经过验证
