Takuya Mieno

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 54

Top Topics

Top Venues

Publications

Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. IWOCA (2024)
Takuya Mieno, Mitsuru Funakoshi
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings. Algorithmica 86 (3) (2024)
Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. IWOCA (2024)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Shortest Cover After Edit. CPM (2024)
Taketo Tsujimoto, Koki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
Computing Longest Common Subsequence under Cartesian-Tree Matching Model. CoRR (2024)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Shortest cover after edit. CoRR (2024)
Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. CoRR (2024)
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
Subsequence Pattern Matching with Segment Number Constraint. CoRR (2024)
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Maximal Palindromes in Non-standard Matching Models. IWOCA (2024)
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. SPIRE (2023)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
longest palindromes in substrings. Theor. Comput. Sci. 979 (2023)
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
Sliding suffix trees simplified. CoRR (2023)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Internal Longest Palindrome Queries in Optimal Time. WALCOM (2023)
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Linear-time computation of generalized minimal absent words for multiple strings. CoRR (2023)
Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
Computing palindromes on a trie in linear time. CoRR (2022)
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Palindromic trees for a sliding window and its applications. Inf. Process. Lett. 173 (2022)
Takuya Mieno, Mitsuru Funakoshi
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. IWOCA (2022)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Internal Longest Palindrome Queries in Optimal Time. CoRR (2022)
Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Minimal Unique Substrings for a Sliding Window. Algorithmica 84 (3) (2022)
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Combinatorics of minimal absent words for a sliding window. Theor. Comput. Sci. 927 (2022)
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. CPM (2022)
Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
Minimal Absent Words on Run-Length Encoded Strings. CoRR (2022)
Takuya Mieno, Mitsuru Funakoshi
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. CoRR (2022)
Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
Computing Palindromes on a Trie in Linear Time. ISAAC (2022)
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions. CoRR (2022)
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
RePair Grammars are the Smallest Grammars for Fibonacci Words. CoRR (2022)
Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
Cartesian Tree Subsequence Matching. CoRR (2022)
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing maximal generalized palindromes. CoRR (2022)
Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
Cartesian Tree Subsequence Matching. CPM (2022)
Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
Minimal Absent Words on Run-Length Encoded Strings. CPM (2022)
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. SPIRE (2022)
Mitsuru Funakoshi, Takuya Mieno
Minimal Unique Palindromic Substrings After Single-Character Substitution. SPIRE (2021)
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
On the Approximation Ratio of LZ-End to LZ77. SPIRE (2021)
Mitsuru Funakoshi, Takuya Mieno
Minimal unique palindromic substrings after single-character substitution. CoRR (2021)
Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering
String Sanitization Under Edit Distance: Improved and Generalized. CPM (2021)
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
A Separation of γ and b via Thue-Morse Words. SPIRE (2021)
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
On the approximation ratio of LZ-End to LZ77. CoRR (2021)
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Combinatorics of minimal absent words for a sliding window. CoRR (2021)
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
A Separation of γ and b via Thue-Morse Words. CoRR (2021)
Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering
String Sanitization Under Edit Distance: Improved and Generalized. CoRR (2020)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Space-efficient algorithms for computing minimal/shortest unique substrings. Theor. Comput. Sci. 845 (2020)
Hideo Bannai, Takuya Mieno, Yuto Nakashima
Lyndon Words, the Three Squares Lemma, and Primitive Squares. CoRR (2020)
Hideo Bannai, Takuya Mieno, Yuto Nakashima
Lyndon Words, the Three Squares Lemma, and Primitive Squares. SPIRE (2020)
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Palindromic Trees for a Sliding Window and Its Applications. CoRR (2020)
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. SOFSEM (2020)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compact Data Structures for Shortest Unique Substring Queries. CoRR (2019)
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. CoRR (2019)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compact Data Structures for Shortest Unique Substring Queries. SPIRE (2019)
Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms (2018)
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Tight Bounds on the Maximum Number of Shortest Unique Substrings. CPM (2017)
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA (2017)
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest Unique Substring Queries on Run-Length Encoded Strings. MFCS (2016)
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Shortest unique palindromic substring queries in optimal time. CoRR (2016)
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Tight bound on the maximum number of shortest unique substrings. CoRR (2016)