| 2026 | SOFSEM | Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries. | Souta Kobayashi, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2026 | WALCOM | Finding Order-Preserving Subgraphs. | Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden |
| 2025 | CIAC | Subsequence Matching and LCS with Segment Number Constraints. | Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara |
| 2025 | CPM | Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time. | Yuto Iguchi, Ryo Yoshinaka, Ayumi Shinohara |
| 2025 | PRICAI | Extracting Automaton from Video Recognition Model. | Junya Saito, Ryo Yoshinaka, Ayumi Shinohara |
| 2025 | SOFSEM | Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets. | Yutaro Numaya, Yoshito Kawasaki, Ryo Yoshinaka, Ayumi Shinohara |
| 2024 | CPM | Algorithms for Galois Words: Detection, Factorization, and Rotation. | Diptarama Hendrian, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2024 | ICALP | Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. | Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2024 | SOFSEM | Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages. | Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2023 | SPIRE | Efficient Parameterized Pattern Matching in Sublinear Space. | Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2023 | WALCOM | Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. | Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka |
| 2023 | WALCOM | Inferring Strings from Position Heaps in Linear Time. | Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2022 | CPM | Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations. | Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2022 | FUN | Sorting Balls and Water: Equivalence and Computational Complexity. | Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka |
| 2022 | SPIRE | Computing the Parameterized Burrows-Wheeler Transform Online. | Daiki Hashimoto, Diptarama Hendrian, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2021 | WALCOM | Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. | Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender |
| 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 | Grammar Compression with Probabilistic Context-Free Grammar. | Hiroaki Naganuma, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara, Naoki Kobayashi |
| 2020 | ETFA | Model-Based Development Considering Self-Driving Systems for Many-Core Processors. | Ryo Yoshinaka, Takuya Azumi |
| 2020 | SOFSEM | Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching. | Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2020 | SOFSEM | An Extension of Linear-size Suffix Tries for Parameterized Strings. | Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2020 | SOFSEM | AOBA: An Online Benchmark Tool for Algorithms in Stringology. | Ryu Wakimoto, Satoshi Kobayashi, Yuki Igarashi, Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2020 | SPIRE | Computing Covers Under Substring Consistent Equivalence Relations. | Natsumi Kikuchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2018 | SOFSEM | New Variants of Pattern Matching with Constants and Variables. | Yuki Igarashi, Diptarama, Ryo Yoshinaka, Ayumi Shinohara |
| 2018 | SOFSEM | Duel and Sweep Algorithm for Order-Preserving Pattern Matching. | Davaajav Jargalsaikhan, Diptarama, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara |
| 2018 | SPIRE | Linear-Time Online Algorithm Inferring the Shortest Path from a Walk. | Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2017 | ALT | An efficient query learning algorithm for zero-suppressed binary decision diagrams. | Hayato Mizumoto, Shota Todoroki, Diptarama, Ryo Yoshinaka, Ayumi Shinohara |
| 2017 | LATA | The Strong, Weak, and Very Weak Finite Context and Kernel Properties. | Makoto Kanazawa, Ryo Yoshinaka |
| 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 | WALCOM | The Time Complexity of the Token Swapping Problem and Its Parallel Variants. | Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka |
| 2016 | SAT | QBF Encoding of Generalized Tic-Tac-Toe. | Diptarama, Ryo Yoshinaka, Ayumi Shinohara |
| 2016 | SPIRE | AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching. | Diptarama, Ryo Yoshinaka, Ayumi Shinohara |
| 2015 | FG | Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars. | Makoto Kanazawa, Ryo Yoshinaka |
| 2015 | LATA | Learning Conjunctive Grammars and Contextual Binary Feature Grammars. | Ryo Yoshinaka |
| 2014 | ISAIM | A Sufficient Condition for Learning Unbounded Unions of Languages with Refinement Operators. | Tomohiko Okayama, Ryo Yoshinaka, Keisuke Otaki, Akihiro Yamamoto |
| 2013 | ALT | PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data. | Chihiro Shibata, Ryo Yoshinaka |
| 2012 | LATA | Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars. | Ryo Yoshinaka |
| 2011 | ALT | Distributional Learning of Simple Context-Free Tree Grammars. | Anna Kasprzik, Ryo Yoshinaka |
| 2011 | DLT | Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices. | Ryo Yoshinaka |
| 2010 | FG | Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher. | Ryo Yoshinaka, Alexander Clark |
| 2010 | LATA | Chomsky-Schtzenberger-Type Characterization of Multiple Context-Free Languages. | Ryo Yoshinaka, Yuichi Kaji, Hiroyuki Seki |
| 2009 | ALT | Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data. | Ryo Yoshinaka |
| 2008 | LATA | An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs. | Ryo Yoshinaka |
| 2007 | ALT | Learning Efficiency of Very Simple Grammars from Positive Data. | Ryo Yoshinaka |
| 2007 | LPAR | On Two Extensions of Abstract Categorial Grammars. | Philippe de Groote, Sarah Maarek, Ryo Yoshinaka |
| 2006 | ALT | Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning. | Takeshi Shibata, Ryo Yoshinaka, Takashi Chikayama |