default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakuya Mieno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Takuya Mieno, Mitsuru Funakoshi:
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings. Algorithmica 86(3): 852-873 (2024)- [c23]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Shortest Cover After Edit. CPM 2024: 24:1-24:15 - [c22]Mitsuru Funakoshi
, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Maximal Palindromes in Non-standard Matching Models. IWOCA 2024: 165-179 - [c21]Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige:
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. IWOCA 2024: 327-340 - [c20]Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. IWOCA 2024: 369-381 - [c19]Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga:
Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations. SPIRE 2024: 321-335 - [i27]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Shortest cover after edit. CoRR abs/2402.17428 (2024) - [i26]Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige:
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. CoRR abs/2402.18090 (2024) - [i25]Taketo Tsujimoto, Koki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Computing Longest Common Subsequence under Cartesian-Tree Matching Model. CoRR abs/2402.19146 (2024) - [i24]Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara:
Subsequence Pattern Matching with Segment Number Constraint. CoRR abs/2407.19796 (2024) - [i23]Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga:
Faster and simpler online/sliding rightmost Lempel-Ziv factorizations. CoRR abs/2408.03008 (2024) - [i22]Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama:
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. CoRR abs/2409.19576 (2024) - 2023
- [j6]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Finding top-k longest palindromes in substrings. Theor. Comput. Sci. 979: 114183 (2023) - [c18]Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. SPIRE 2023: 331-344 - [c17]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Internal Longest Palindrome Queries in Optimal Time. WALCOM 2023: 127-138 - [i21]Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno:
Sliding suffix trees simplified. CoRR abs/2307.01412 (2023) - [i20]Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Linear-time computation of generalized minimal absent words for multiple strings. CoRR abs/2307.01967 (2023) - 2022
- [j5]Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Minimal Unique Substrings for a Sliding Window. Algorithmica 84(3): 670-693 (2022) - [j4]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: 106174 (2022) - [j3]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: 109-119 (2022) - [c16]Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura:
Cartesian Tree Subsequence Matching. CPM 2022: 14:1-14:18 - [c15]Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama:
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. CPM 2022: 26:1-26:17 - [c14]Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Minimal Absent Words on Run-Length Encoded Strings. CPM 2022: 27:1-27:17 - [c13]Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga:
Computing Palindromes on a Trie in Linear Time. ISAAC 2022: 15:1-15:15 - [c12]Takuya Mieno, Mitsuru Funakoshi:
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. IWOCA 2022: 425-438 - [c11]Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno:
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. SPIRE 2022: 24-37 - [i19]Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura:
Cartesian Tree Subsequence Matching. CoRR abs/2202.04349 (2022) - [i18]Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama:
RePair Grammars are the Smallest Grammars for Fibonacci Words. CoRR abs/2202.08447 (2022) - [i17]Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Minimal Absent Words on Run-Length Encoded Strings. CoRR abs/2202.13591 (2022) - [i16]Takuya Mieno, Mitsuru Funakoshi:
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. CoRR abs/2204.07327 (2022) - [i15]Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno:
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions. CoRR abs/2207.04194 (2022) - [i14]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Internal Longest Palindrome Queries in Optimal Time. CoRR abs/2210.02000 (2022) - [i13]Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing maximal generalized palindromes. CoRR abs/2210.02067 (2022) - [i12]Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga:
Computing palindromes on a trie in linear time. CoRR abs/2211.03995 (2022) - 2021
- [c10]Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering:
String Sanitization Under Edit Distance: Improved and Generalized. CPM 2021: 19:1-19:18 - [c9]Mitsuru Funakoshi, Takuya Mieno:
Minimal Unique Palindromic Substrings After Single-Character Substitution. SPIRE 2021: 33-46 - [c8]Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
On the Approximation Ratio of LZ-End to LZ77. SPIRE 2021: 114-126 - [c7]Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto:
A Separation of γ and b via Thue-Morse Words. SPIRE 2021: 167-178 - [i11]Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto:
A Separation of γ and b via Thue-Morse Words. CoRR abs/2104.09985 (2021) - [i10]Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Combinatorics of minimal absent words for a sliding window. CoRR abs/2105.08496 (2021) - [i9]Mitsuru Funakoshi, Takuya Mieno:
Minimal unique palindromic substrings after single-character substitution. CoRR abs/2105.11693 (2021) - [i8]Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
On the approximation ratio of LZ-End to LZ77. CoRR abs/2106.01173 (2021) - 2020
- [j2]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: 230-242 (2020) - [c6]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: 148-160 - [c5]Hideo Bannai, Takuya Mieno, Yuto Nakashima:
Lyndon Words, the Three Squares Lemma, and Primitive Squares. SPIRE 2020: 265-273 - [i7]Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Palindromic Trees for a Sliding Window and Its Applications. CoRR abs/2006.02134 (2020) - [i6]Hideo Bannai, Takuya Mieno, Yuto Nakashima:
Lyndon Words, the Three Squares Lemma, and Primitive Squares. CoRR abs/2006.13576 (2020) - [i5]Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering:
String Sanitization Under Edit Distance: Improved and Generalized. CoRR abs/2007.08179 (2020)
2010 – 2019
- 2019
- [c4]Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compact Data Structures for Shortest Unique Substring Queries. SPIRE 2019: 107-123 - [i4]Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compact Data Structures for Shortest Unique Substring Queries. CoRR abs/1905.12854 (2019) - [i3]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 abs/1909.02804 (2019) - 2018
- [j1]Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms 52-53: 122-132 (2018) - 2017
- [c3]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Tight Bounds on the Maximum Number of Shortest Unique Substrings. CPM 2017: 24:1-24:11 - [c2]Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA 2017: 397-408 - 2016
- [c1]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Substring Queries on Run-Length Encoded Strings. MFCS 2016: 69:1-69:11 - [i2]Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest unique palindromic substring queries in optimal time. CoRR abs/1608.05550 (2016) - [i1]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Tight bound on the maximum number of shortest unique substrings. CoRR abs/1609.07220 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
