Takuya Mieno

72 papers B 12C 15Journal 43Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Online Computation of Palindromes and Suffix Trees on Tries.
CoRR
Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno, Masakazu Ishihata, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2026 J jnl
Subsequence Matching and LCS under Cartesian-Tree Equivalence.
Theory Comput. Syst.
Taketo Tsujimoto, Yuki Yonemoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
2026 J jnl
The Smallest String Attractors of Fibonacci and Period-Doubling Words.
CoRR
Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Köppl, Takuya Mieno, Yoshio Okamoto
2025 J jnl
Compact representation of maximal palindromes.
CoRR
Takuya Mieno
2025 J jnl
Computing maximal palindromes in non-standard matching models.
Inf. Comput.
Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2025 C conf
Longest Unbordered Factors on Run-Length Encoded Strings.
SPIRE
Shoma Sekizaki, Takuya Mieno
2025 J jnl
Longest Unbordered Factors on Run-Length Encoded Strings.
CoRR
Shoma Sekizaki, Takuya Mieno
2025 C conf
On the Number of MUSs Crossing a Position.
SPIRE
Hiroto Fujimaru, Takuya Mieno, Shunsuke Inenaga
2025 J jnl
On the number of MUSs crossing a position.
CoRR
Hiroto Fujimaru, Takuya Mieno, Shunsuke Inenaga
2025 — conf
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees.
SOFSEM (2)
Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama
2025 B conf
Sorted Consecutive Occurrence Queries in Substrings.
CPM
Waseem Akram, Takuya Mieno
2025 B conf
Space-Efficient Online Computation of String Net Occurrences.
CPM
Takuya Mieno, Shunsuke Inenaga
2025 — conf
Subsequence Matching and LCS with Segment Number Constraints.
CIAC (2)
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
2024 C conf
Computing Longest Common Subsequence Under Cartesian-Tree Matching Model.
IWOCA
Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
2024 J jnl
Computing Longest Common Subsequence under Cartesian-Tree Matching Model.
CoRR
Taketo Tsujimoto, Koki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
2024 C conf
Computing Maximal Palindromes in Non-standard Matching Models.
IWOCA
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2024 C conf
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.
IWOCA
Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
2024 J jnl
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.
CoRR
Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
2024 J jnl
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings.
Algorithmica
Takuya Mieno, Mitsuru Funakoshi
2024 C conf
Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations.
SPIRE
Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga
2024 J jnl
Faster and simpler online/sliding rightmost Lempel-Ziv factorizations.
CoRR
Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga
2024 J jnl
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees.
CoRR
Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama
2024 B conf
Shortest Cover After Edit.
CPM
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2024 J jnl
Shortest cover after edit.
CoRR
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2024 J jnl
Sorted Consecutive Occurrence Queries in Substrings.
CoRR
Waseem Akram, Takuya Mieno
2024 J jnl
Space-Efficient Online Computation of String Net Occurrences.
CoRR
Takuya Mieno, Shunsuke Inenaga
2024 J jnl
Subsequence Pattern Matching with Segment Number Constraint.
CoRR
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
2023 J jnl
Finding top-
Theor. Comput. Sci.
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2023 B conf
Internal Longest Palindrome Queries in Optimal Time.
WALCOM
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2023 C conf
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings.
SPIRE
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2023 J jnl
Linear-time computation of generalized minimal absent words for multiple strings.
CoRR
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2023 J jnl
Sliding suffix trees simplified.
CoRR
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
2022 B conf
Cartesian Tree Subsequence Matching.
CPM
Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
2022 J jnl
Cartesian Tree Subsequence Matching.
CoRR
Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
2022 J jnl
Combinatorics of minimal absent words for a sliding window.
Theor. Comput. Sci.
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Computing Minimal Unique Substrings for a Sliding Window.
Algorithmica
Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 B conf
Computing Palindromes on a Trie in Linear Time.
ISAAC
Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
2022 J jnl
Computing maximal generalized palindromes.
CoRR
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Computing palindromes on a trie in linear time.
CoRR
Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
2022 J jnl
Internal Longest Palindrome Queries in Optimal Time.
CoRR
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2022 B conf
Minimal Absent Words on Run-Length Encoded Strings.
CPM
Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
2022 J jnl
Minimal Absent Words on Run-Length Encoded Strings.
CoRR
Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
2022 C conf
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions.
SPIRE
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
2022 J jnl
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions.
CoRR
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
2022 J jnl
Palindromic trees for a sliding window and its applications.
Inf. Process. Lett.
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
RePair Grammars are the Smallest Grammars for Fibonacci Words.
CoRR
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
2022 C conf
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings.
IWOCA
Takuya Mieno, Mitsuru Funakoshi
2022 J jnl
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings.
CoRR
Takuya Mieno, Mitsuru Funakoshi
2022 B conf
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words.
CPM
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
2021 C conf
A Separation of γ and b via Thue-Morse Words.
SPIRE
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
2021 J jnl
A Separation of γ and b via Thue-Morse Words.
CoRR
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
2021 J jnl
Combinatorics of minimal absent words for a sliding window.
CoRR
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 C conf
Minimal Unique Palindromic Substrings After Single-Character Substitution.
SPIRE
Mitsuru Funakoshi, Takuya Mieno
2021 J jnl
Minimal unique palindromic substrings after single-character substitution.
CoRR
Mitsuru Funakoshi, Takuya Mieno
2021 C conf
On the Approximation Ratio of LZ-End to LZ77.
SPIRE
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021 J jnl
On the approximation ratio of LZ-End to LZ77.
CoRR
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021 B conf
String Sanitization Under Edit Distance: Improved and Generalized.
CPM
Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering
2020 J jnl
Computing Palindromic Trees for a Sliding Window and Its Applications.
CoRR
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 C conf
Lyndon Words, the Three Squares Lemma, and Primitive Squares.
SPIRE
Hideo Bannai, Takuya Mieno, Yuto Nakashima
2020 J jnl
Lyndon Words, the Three Squares Lemma, and Primitive Squares.
CoRR
Hideo Bannai, Takuya Mieno, Yuto Nakashima
2020 B conf
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.
SOFSEM
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Space-efficient algorithms for computing minimal/shortest unique substrings.
Theor. Comput. Sci.
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
String Sanitization Under Edit Distance: Improved and Generalized.
CoRR
Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering
2019 C conf
Compact Data Structures for Shortest Unique Substring Queries.
SPIRE
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Compact Data Structures for Shortest Unique Substring Queries.
CoRR
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.
CoRR
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 J jnl
Algorithms and combinatorial properties on shortest unique palindromic substrings.
J. Discrete Algorithms
Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 C conf
Shortest Unique Palindromic Substring Queries in Optimal Time.
IWOCA
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 B conf
Tight Bounds on the Maximum Number of Shortest Unique Substrings.
CPM
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 B conf
Shortest Unique Substring Queries on Run-Length Encoded Strings.
MFCS
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Shortest unique palindromic substring queries in optimal time.
CoRR
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Tight bound on the maximum number of shortest unique substrings.
CoRR
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda