Skip to content

Publications

Journal Articles

  1. Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
    Finding top-k longest palindromes in substrings
     Theoretical Computer Science 979 (2023): 114183
  2. Takuya Mieno, Mitsuru Funakoshi
    Data Structures for Computing Unique Palindromes in Static and Non-Static Strings
     Algorithmica (2023): https://doi.org/10.1007/s00453-023-01170-8
  3. Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Combinatorics of minimal absent words for a sliding window
     Theoretical Computer Science 927 (2022): 109-119
  4. Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Computing Minimal Unique Substrings for a Sliding Window
     Algorithmica 84 (2022): 670-693
  5. Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Palindromic Trees for a Sliding Window and Its Applications
     Information Processing Letters 173 (2022): 106174
  6. Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Space-Efficient Algorithms for Computing Minimal/Shortest Unique Substrings
     Theoretical Computer Science 845 (2020): 230-242
  7. Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Algorithms and Combinatorial Properties on Shortest Unique Palindromic Substrings
     Journal of Discrete Algorithms 52 (2018): 122-132

Proceedings (Peer Reviewed)

  1. Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
    Linear-time computation of generalized minimal absent words for multiple strings
     Proc. 30th International Symposium on String Processing and Information Retrieval (SPIRE 2023), 331--344, 2023.

  2. Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
    Internal Longest Palindrome Queries in Optimal Time
     Proc. 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), 127–138, 2023.

  3. Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
    Computing Palindromes on a Trie in Linear Time
     Proc. 33rd International Symposium on Algorithms and Computation (ISAAC 2022), 15:1-15:15, 2022.

  4. Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
    Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions
     Proc. 29th International Symposium on String Processing and Information Retrieval (SPIRE 2022), 24-37, 2022

  5. Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
    Minimal Absent Words on Run-Length Encoded Strings
     Proc. 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), 27:1-27:17, 2022

  6. Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
    RePair Grammars are the Smallest Grammars for Fibonacci Words
     Proc. 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), 26:1-26:17, 2022

  7. Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
    Cartesian Tree Subsequence Matching
     Proc. 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), 14:1-14:18, 2022

  8. Takuya Mieno, Mitsuru Funakoshi
    Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
     Proc. 33rd International Workshop on Combinatorial Algorithms (IWOCA 2022), 425-438, 2022

  9. Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
    A separation of γ and b via Thue−Morse Words
     Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021), 167-178, 2021

  10. Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
    On the approximation ratio of LZ-End to LZ77
     Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021), 114-126, 2021

  11. Mitsuru Funakoshi, Takuya Mieno
    Minimal unique palindromic substrings after single-character substitution
     Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021), 33-46, 2021

  12. Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering
    String Sanitization Under Edit Distance: Improved and Generalized
     Proc. 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), 19:1–19:18, 2021

  13. Hideo Bannai, Takuya Mieno, Yuto Nakashima
    Lyndon Words, the Three Squares Lemma, and Primitive Squares
     Proc. 27th International Symposium on String Processing and Information Retrieval (SPIRE 2020), 265-273, 2020

  14. Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
     Proc. 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), 148-160, 2020

  15. Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Compact Data Structures for Shortest Unique Substring Queries
     Proc. 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), 107-123, 2019

  16. Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Shortest Unique Palindromic Substring Queries in Optimal Time
     Proc. 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), 397-408, 2017

  17. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Tight Bounds on the Maximum Number of Shortest Unique Substrings
     Proc. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 24:1-24:11, 2017

  18. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Shortest Unique Substring Queries on Run-Length Encoded Strings
     Proc. 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 69:1-69:11, 2016