Shunsuke Inenaga
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
141
Venues
18
Active years
2001–2026
Best venue rank
A*
Where they publish
Papers
141 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | Sensitivity of Repetitiveness Measures to String Reversal. | Hideo Bannai, Yuto Fujie, Peaker Guo, Shunsuke Inenaga, Yuto Nakashima, Simon J. Puglisi, Cristian Urbina |
| 2026 | CPM | Constant Multiplicative Sensitivity on the CDAWGs. | Rikuya Hamai, Hiroto Fujimaru, Shunsuke Inenaga |
| 2026 | CPM | LZBE: An LZ-Style Compressor Supporting O(log n)-Time Random Access. | Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga |
| 2025 | CIAC | Subsequence Matching and LCS with Segment Number Constraints. | Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara |
| 2025 | CPM | Space-Efficient Online Computation of String Net Occurrences. | Takuya Mieno, Shunsuke Inenaga |
| 2025 | SOFSEM | Packed Acyclic Deterministic Finite Automata. | Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga |
| 2025 | SPIRE | Tight Additive Sensitivity on LZ-Style Compressors and String Attractors. | Yuto Fujie, Hiroki Shibata, Yuto Nakashima, Shunsuke Inenaga |
| 2025 | SPIRE | On the Number of MUSs Crossing a Position. | Hiroto Fujimaru, Takuya Mieno, Shunsuke Inenaga |
| 2025 | SPIRE | Nyldon Factorization of Thue-Morse Words and Fibonacci Words. | Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2025 | SPIRE | Counting Distinct (Non-)crossing Substrings. | Haruki Umezaki, Hiroki Shibata, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 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 | MFCS | Edit and Alphabet-Ordering Sensitivity of Lex-Parse. | Yuto Nakashima, Dominik Kppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai |
| 2024 | SPIRE | Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings. | Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga |
| 2024 | SPIRE | On the Number of Non-equivalent Parameterized Squares in a String. | Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2024 | SPIRE | All-Pairs Suffix-Prefix on Dynamic Set of Strings. | Masaru Kikuchi, Shunsuke Inenaga |
| 2024 | SPIRE | Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations. | Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga |
| 2024 | SPIRE | Simple Linear-Time Repetition Factorization. | Yuki Yonemoto, Shunsuke Inenaga |
| 2023 | DLT | Bit Catastrophes for the Burrows-Wheeler Transform. | Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Liptk, Giuseppe Romana, Marinella Sciortino, Cristian Urbina |
| 2023 | SOFSEM | Space-Efficient STR-IC-LCS Computation. | Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | SPIRE | Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. | Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue |
| 2023 | SPIRE | Largest Repetition Factorization of Fibonacci Words. | Kaisei Kishi, Yuto Nakashima, 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 |
| 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 | SPIRE | Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. | Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno |
| 2021 | CIAC | The Parameterized Suffix Tray. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SOFSEM | Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. | Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Liptk, Nicola Prezza, Marinella Sciortino, Anna Toffanello |
| 2021 | SPIRE | Grammar Index by Induced Suffix Sorting. | Tooru Akagi, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SPIRE | Longest Common Rollercoasters. | Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SPIRE | On the Approximation Ratio of LZ-End to LZ77. | Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda |
| 2021 | SPIRE | Position Heaps for Cartesian-Tree Matching on Strings and Tries. | Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga |
| 2020 | CPM | Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara |
| 2020 | CPM | DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. | Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda |
| 2020 | DCC | c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. | Kazuya Tsuruta, Dominik Kppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | ISAAC | A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. | Yoshifumi Sakai, Shunsuke Inenaga |
| 2020 | LATIN | Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. | Shunsuke Inenaga |
| 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 | SOFSEM | Faster STR-EC-LCS Computation. | Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SPIRE | Longest Square Subsequence Problem Revisited. | Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai |
| 2020 | SPIRE | On Repetitiveness Measures of Thue-Morse Words. | Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SPIRE | Towards Efficient Interactive Computation of Dynamic Time Warping Distance. | Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CIAC | The Parameterized Position Heap of a Trie. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | Faster Queries for Longest Substring Palindrome After Block Edit. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | Online Algorithms for Constructing Linear-Size Suffix Trie. | Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga |
| 2019 | CPM | Computing Runs on a Trie. | Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. | Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | DCC | MR-RePair: Grammar Compression Based on Maximal Repeats. | Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida |
| 2019 | ISAAC | An Improved Data Structure for Left-Right Maximal Generic Words Problem. | Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | IWOCA | Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. | Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | SPIRE | Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | SPIRE | On Longest Common Property Preserved Substring Queries. | Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka |
| 2019 | SPIRE | Compact Data Structures for Shortest Unique Substring Queries. | Takuya Mieno, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Faster Online Elastic Degenerate String Matching. | Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Longest substring palindrome after edit. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Lyndon Factorization of Grammar Compressed Texts Revisited. | Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Computing longest common square subsequences. | Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyr, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Longest Lyndon Substring After Edit. | Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | SPIRE | Block Palindromes: A New Generalization of Palindromes. | Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga |
| 2018 | SPIRE | Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. | Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | CPM | Computing All Distinct Squares in Linear Time for Integer Alphabets. | Hideo Bannai, Shunsuke Inenaga, Dominik Kppl |
| 2017 | CPM | Faster STR-IC-LCS Computation via RLE. | Keita Kuboi, Yuta Fujishige, 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 | ISAAC | Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. | Yuta Fujishige, Yuto Nakashima, 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 |
| 2017 | IWOCA | Computing Abelian String Regularities Based on RLE. | Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | MFCS | Small-Space LCE Data Structure with Constant-Time Queries. | Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2017 | SOFSEM | Computing Longest Single-arm-gapped Palindromes in a String. | Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara |
| 2017 | SOFSEM | Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings. | Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara |
| 2017 | SPIRE | On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. | Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi |
| 2017 | SPIRE | Order Preserving Pattern Matching on Trees and DAGs. | Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | SPIRE | Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. | Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura |
| 2016 | CPM | Factorizing a String into Squares in Linear Time. | Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea |
| 2016 | CPM | Fully-online Construction of Suffix Trees for Multiple Texts. | Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura |
| 2016 | CPM | Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. | Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda |
| 2016 | IWOCA | Finding Gapped Palindromes Online. | Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | IWOCA | Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. | Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura |
| 2016 | MFCS | Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. | Yuta Fujishige, Yuki Tsujimaru, 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 |
| 2016 | MFCS | Fully Dynamic Data Structure for LCE Queries in Compressed Space. | Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | STACS | Efficiently Finding All Maximal alpha-gapped Repeats. | Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Kppl, Florin Manea |
| 2016 | SOFSEM | Compacting a Dynamic Edit Distance Table by RLE Compression. | Heikki Hyyr, Shunsuke Inenaga |
| 2015 | CIAC | An Opportunistic Text Indexing Structure Based on Run Length Encoding. | Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | CPM | LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2015 | CPM | Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. | Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | DLT | Diverse Palindromic Factorization Is NP-complete. | Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Krkkinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto |
| 2015 | ISAAC | Inferring Strings from Full Abelian Periods. | Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | SODA | A new characterization of maximal repetitions by Lyndon trees. | Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta |
| 2015 | SPIRE | Efficient Algorithms for Longest Closed Factor Array. | Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen |
| 2015 | SPIRE | A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String. | Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | CPM | Computing Palindromic Factorizations and Palindromic Covers On-line. | Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | MFCS | Inferring Strings from Lyndon Factorization. | Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | STACS | Faster Compact On-Line Lempel-Ziv Factorization. | Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2014 | SOFSEM | Shortest Unique Substrings Queries in Optimal Time. | Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | CPM | Converting SLP to LZ78 in almost Linear Time. | Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda |
| 2013 | CPM | Efficient Lyndon Factorization of Grammar Compressed Text. | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | DCC | From Run Length Encoding to LZ78 and Back Again. | Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | DCC | Computing Convolution on Grammar-Compressed Text. | Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | MFCS | Detecting Regularities on Grammar-Compressed Strings. | Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara |
| 2013 | SOFSEM | Permuted Pattern Matching on Multi-track Strings. | Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga |
| 2013 | SPIRE | Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2012 | CPM | Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2012 | SOFSEM | Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2012 | SPIRE | Efficient LZ78 Factorization of Grammar Compressed Text. | Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2012 | SPIRE | The Position Heap of a Trie. | Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2011 | CPM | Palindrome Pattern Matching. | Tomohiro I, Shunsuke Inenaga, Masayuki Takeda |
| 2011 | CPM | Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. | Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2011 | SPIRE | Fast q-gram Mining on SLP Compressed Strings. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2010 | CPM | Verifying a Parameterized Border Array in | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2010 | ICCSA | An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services. | Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura |
| 2010 | SOFSEM | Dynamic Edit Distance Table under a General Weighted Cost Function. | Heikki Hyyr, Kazuyuki Narisawa, Shunsuke Inenaga |
| 2010 | SPIRE | Counting and Verifying Maximal Palindromes. | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2009 | IWOCA | Lightweight Parameterized Suffix Array Construction. | Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2009 | LATA | Counting Parameterized Border Arrays for a Binary Alphabet. | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2009 | PDPTA | Modeling Costs of Access Control with Various Key Management Systems. | Tomomi Yamasaki, Shunsuke Inenaga, Daisuke Ikeda, Hiroto Yasuura |
| 2008 | DIS | String Kernels Based on Variable-Length-Don't-Care Patterns. | Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda |
| 2008 | SOFSEM | Computing Longest Common Substring and All Palindromes from Compressed Strings. | Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto |
| 2007 | CPM | Efficient Computation of Substring Equivalence Classes with Suffix Arrays. | Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2007 | DCC | Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. | Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2006 | CPM | On-Line Linear-Time Construction of Word Suffix Trees. | Shunsuke Inenaga, Masayuki Takeda |
| 2006 | DIS | A New Family of String Classifiers Based on Local Relatedness. | Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2006 | SPIRE | Sparse Directed Acyclic Word Graphs. | Shunsuke Inenaga, Masayuki Takeda |
| 2005 | DIS | Practical Algorithms for Pattern Based Linear Regression. | Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda |
| 2005 | FCT | Fully Incremental LCS Computation. | Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda |
| 2005 | SPIRE | Composite Pattern Discovery for PCR Application. | Stanislav Angelov, Shunsuke Inenaga |
| 2004 | DIS | Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. | Shunsuke Inenaga, Hideo Bannai, Heikki Hyyr, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano |
| 2004 | DLT | An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda |
| 2004 | WABI | Finding Missing Patterns. | Shunsuke Inenaga, Teemu Kivioja, Veli Mkinen |
| 2003 | DIS | Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. | Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa |
| 2003 | MFCS | Inferring Strings from Graphs and Arrays. | Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda |
| 2003 | SPIRE | Linear-Time Off-Line Text Compression by Longest-First Substitution. | Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara |
| 2002 | CPM | The Minimum DAWG for All Suffixes of a String and Its Applications. | Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa |
| 2002 | DIS | Discovering Best Variable-Length-Don't-Care Patterns. | Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2002 | MFCS | Space-Economical Construction of Index Structures for All Suffixes of a String. | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa |
| 2002 | SPIRE | Compact Directed Acyclic Word Graphs for a Sliding Window. | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2001 | CPM | On-Line Construction of Compact Directed Acyclic Word Graphs. | Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi |
| 2001 | DIS | A Practical Algorithm to Find the Best Episode Patterns. | Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2001 | SPIRE | On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. | Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |