Takuya Mieno

According to our database, Takuya Mieno authored at least 32 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Data Structures for Computing Unique Palindromes in Static and Non-Static Strings.

Takuya Mieno, Mitsuru Funakoshi

Algorithmica, March, 2024

Computing Longest Common Subsequence under Cartesian-Tree Matching Model.

Taketo Tsujimoto, Koki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga

CoRR, 2024

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.

Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige

CoRR, 2024

Shortest cover after edit.

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

CoRR, 2024

2023

Finding top-<i>k</i> longest palindromes in substrings.

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

Theor. Comput. Sci., November, 2023

Sliding suffix trees simplified.

Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno

CoRR, 2023

Internal Longest Palindrome Queries in Optimal Time.

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

Proceedings of the WALCOM: Algorithms and Computation, 2023

Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings.

Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai

Proceedings of the String Processing and Information Retrieval, 2023

2022

Combinatorics of minimal absent words for a sliding window.

Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theor. Comput. Sci., 2022

Palindromic trees for a sliding window and its applications.

Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Inf. Process. Lett., 2022

Computing maximal generalized palindromes.

Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

CoRR, 2022

Computing Minimal Unique Substrings for a Sliding Window.

Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Algorithmica, 2022

Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions.

Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno

Proceedings of the String Processing and Information Retrieval, 2022

Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings.

Takuya Mieno, Mitsuru Funakoshi

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Computing Palindromes on a Trie in Linear Time.

Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Cartesian Tree Subsequence Matching.

Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

{RePair} Grammars Are the Smallest Grammars for Fibonacci Words.

Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

Minimal Absent Words on Run-Length Encoded Strings.

Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

On the Approximation Ratio of LZ-End to LZ77.

Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda

Proceedings of the String Processing and Information Retrieval, 2021

Minimal Unique Palindromic Substrings After Single-Character Substitution.

Mitsuru Funakoshi, Takuya Mieno

Proceedings of the String Processing and Information Retrieval, 2021

A Separation of γ and b via Thue-Morse Words.

Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto

Proceedings of the String Processing and Information Retrieval, 2021

String Sanitization Under Edit Distance: Improved and Generalized.

Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Space-efficient algorithms for computing minimal/shortest unique substrings.

Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theor. Comput. Sci., 2020

Computing Palindromic Trees for a Sliding Window and Its Applications.

Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

CoRR, 2020

Lyndon Words, the Three Squares Lemma, and Primitive Squares.

Hideo Bannai, Takuya Mieno, Yuto Nakashima

Proceedings of the String Processing and Information Retrieval, 2020

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.

Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

Compact Data Structures for Shortest Unique Substring Queries.

Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proceedings of the String Processing and Information Retrieval, 2019

2018

Algorithms and combinatorial properties on shortest unique palindromic substrings.

Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

J. Discrete Algorithms, 2018

2017

Shortest Unique Palindromic Substring Queries in Optimal Time.

Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Tight Bounds on the Maximum Number of Shortest Unique Substrings.

Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Tight bound on the maximum number of shortest unique substrings.

Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

CoRR, 2016

Shortest Unique Substring Queries on Run-Length Encoded Strings.

Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016