Takuya Mieno
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
32
Venues
9
Active years
2016–2026
Best venue rank
A*
Where they publish
Papers
32 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | The Smallest String Attractors of Fibonacci and Period-Doubling Words. | Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Kppl, Takuya Mieno, Yoshio Okamoto |
| 2026 | CPM | Compact Representation of Maximal Palindromes. | Takuya Mieno |
| 2026 | KR | Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis. | Mutsunori Banbara, Hideo Bannai, Takashi Horiyama, Dominik Kppl, Takuya Mieno, Hidetomo Nabeshima |
| 2025 | CIAC | Subsequence Matching and LCS with Segment Number Constraints. | Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara |
| 2025 | CPM | Sorted Consecutive Occurrence Queries in Substrings. | Waseem Akram, Takuya Mieno |
| 2025 | CPM | Space-Efficient Online Computation of String Net Occurrences. | Takuya Mieno, Shunsuke Inenaga |
| 2025 | SOFSEM | Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. | Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama |
| 2025 | SPIRE | On the Number of MUSs Crossing a Position. | Hiroto Fujimaru, Takuya Mieno, Shunsuke Inenaga |
| 2025 | SPIRE | Longest Unbordered Factors on Run-Length Encoded Strings. | Shoma Sekizaki, Takuya Mieno |
| 2024 | CPM | Shortest Cover After Edit. | Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama |
| 2024 | IWOCA | Computing Maximal Palindromes in Non-standard Matching Models. | Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2024 | IWOCA | Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. | Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige |
| 2024 | IWOCA | Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. | Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga |
| 2024 | SPIRE | Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations. | Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga |
| 2023 | SPIRE | Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. | Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | WALCOM | Internal Longest Palindrome Queries in Optimal Time. | Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama |
| 2022 | CPM | Minimal Absent Words on Run-Length Encoded Strings. | Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga |
| 2022 | CPM | {RePair} Grammars Are the Smallest Grammars for Fibonacci Words. | Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama |
| 2022 | CPM | Cartesian Tree Subsequence Matching. | Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura |
| 2022 | ISAAC | Computing Palindromes on a Trie in Linear Time. | Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga |
| 2022 | IWOCA | Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. | Takuya Mieno, Mitsuru Funakoshi |
| 2022 | SPIRE | Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. | Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno |
| 2021 | CPM | String Sanitization Under Edit Distance: Improved and Generalized. | Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering |
| 2021 | SPIRE | A Separation of γ and b via Thue-Morse Words. | Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Kppl, Takuya Mieno, Takaaki Nishimoto |
| 2021 | SPIRE | Minimal Unique Palindromic Substrings After Single-Character Substitution. | Mitsuru Funakoshi, Takuya Mieno |
| 2021 | SPIRE | On the Approximation Ratio of LZ-End to LZ77. | Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda |
| 2020 | SOFSEM | 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 |
| 2020 | SPIRE | Lyndon Words, the Three Squares Lemma, and Primitive Squares. | Hideo Bannai, Takuya Mieno, Yuto Nakashima |
| 2019 | SPIRE | Compact Data Structures for Shortest Unique Substring Queries. | Takuya Mieno, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | CPM | Tight Bounds on the Maximum Number of Shortest Unique Substrings. | Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | IWOCA | Shortest Unique Palindromic Substring Queries in Optimal Time. | Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | MFCS | Shortest Unique Substring Queries on Run-Length Encoded Strings. | Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |