| 2024 | CPM | Finding Diverse Strings and Longest Common Subsequences in a Graph. | Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura |
| 2024 | IWOCA | Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. | Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige |
| 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 |
| 2022 | CPM | Cartesian Tree Subsequence Matching. | Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura |
| 2021 | AAAI | Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. | Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura |
| 2020 | IJCAI | DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization. | Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Hiroki Arimura |
| 2019 | IWOCA | An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. | Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura |
| 2019 | SPIRE | Fast Identification of Heavy Hitters by Cached and Packed Group Testing. | Yusaku Kaneta, Takeaki Uno, Hiroki Arimura |
| 2018 | ISAAC | Efficient Enumeration of Dominating Sets for Sparse Graphs. | Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno |
| 2018 | IWOCA | Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. | Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura |
| 2017 | IJCAI | Discovering Relevance-Dependent Bicluster Structure from Relational Data. | Iku Ohama, Takuya Kida, Hiroki Arimura |
| 2017 | KDD | Statistical Emerging Pattern Mining with Multiple Testing Correction. | Junpei Komiyama, Masakazu Ishihata, Hiroki Arimura, Takashi Nishibayashi, Shin-ichi Minato |
| 2017 | SPIRE | Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. | Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura |
| 2016 | CPM | Fully-online Construction of Suffix Trees for Multiple Texts. | Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura |
| 2016 | IWOCA | Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. | Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura |
| 2016 | LATA | The Complexity of Induced Tree Reconfiguration Problems. | Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura |
| 2015 | SDM | Multi-Layered Framework for Modeling Relationships between Biased Objects. | Iku Ohama, Takuya Kida, Hiroki Arimura |
| 2015 | SISAP | Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score. | Yoichi Sasaki, Tetsuo Shibuya, Kimihito Ito, Hiroki Arimura |
| 2014 | ISAAC | Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. | Kunihiro Wasa, Hiroki Arimura, Takeaki Uno |
| 2013 | DIS | Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. | Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, Hiroki Arimura |
| 2013 | IC3K | Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories. | Xiaoliang Geng, Takeaki Uno, Hiroki Arimura |
| 2013 | PAKDD | An Extension of the Infinite Relational Model Incorporating Interaction between Objects. | Iku Ohama, Hiromi Iida, Takuya Kida, Hiroki Arimura |
| 2013 | SISAP | Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. | Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura |
| 2012 | COCOON | Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. | Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura |
| 2011 | CPM | Sparse and Truncated Suffix Trees on Variable-Length Codes. | Takashi Uemura, Hiroki Arimura |
| 2010 | IWOCA | Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. | Yusaku Kaneta, Hiroki Arimura |
| 2010 | SPIRE | Fast Bit-Parallel Matching for Network and Regular Expressions. | Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura |
| 2009 | DIS | Mining Frequent Bipartite Episode from Event Sequences. | Takashi Katoh, Hiroki Arimura, Kouichi Hirata |
| 2009 | PAKDD | A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. | Takashi Katoh, Hiroki Arimura, Kouichi Hirata |
| 2009 | SDM | Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. | Hiroki Arimura, Takeaki Uno |
| 2008 | DIS | Unsupervised Spam Detection by Document Complexity Estimation. | Takashi Uemura, Daisuke Ikeda, Hiroki Arimura |
| 2008 | PAKDD | Efficient Algorithms for Mining Frequent and Closed Patterns from Semi-structured Data. | Hiroki Arimura |
| 2008 | PAKDD | An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting. | Tatsuya Asai, Seishi Okamoto, Hiroki Arimura |
| 2008 | PAKDD | Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream. | Takuya Kida, Tomoya Saito, Hiroki Arimura |
| 2008 | PAKDD | LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation. | Shin-ichi Minato, Takeaki Uno, Hiroki Arimura |
| 2008 | PAKDD | Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration. | Takeaki Uno, Hiroki Arimura |
| 2007 | DIS | Time and Space Efficient Discovery of Maximal Geometric Graphs. | Hiroki Arimura, Takeaki Uno, Shinichi Shimozono |
| 2007 | DIS | An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. | Takeaki Uno, Hiroki Arimura |
| 2005 | ILP | An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. | Hiroki Arimura, Takeaki Uno |
| 2005 | ISAAC | A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. | Hiroki Arimura, Takeaki Uno |
| 2005 | KDD | Key semantics extraction by dependency tree mining. | Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, Yosuke Sakao, Susumu Akamine |
| 2004 | DIS | An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. | Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura |
| 2003 | DIS | Discovering Frequent Substructures in Large Unordered Trees. | Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano |
| 2002 | CPM | Efficient Text Mining with Optimized Pattern Discovery. | Hiroki Arimura |
| 2002 | ICDM | Online Algorithms for Mining Semi-structured Data Stream. | Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, Setsuo Arikawa |
| 2002 | SDM | Efficient Substructure Discovery from Large Semi-structured Data. | Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa |
| 2001 | ALT | Efficient Learning of Semi-structured Data from Queries. | Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa |
| 2001 | CPM | Efficient Discovery of Proximity Patterns with Suffix Arrays. | Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa |
| 2001 | CPM | Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. | Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park |
| 2001 | DIS | Mining Semi-structured Data by Path Expressions. | Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa |
| 2001 | FlAIRS | Extracting Partial Structures from HTML Documents. | Hiroshi Sakamoto, Yoshitsugu Murakami, Hiroki Arimura, Setsuo Arikawa |
| 2001 | ILP | Modelling Semi-structured Documents with Hedges for Deduction and Induction. | Akihiro Yamamoto, Kimihito Ito, Akira Ishino, Hiroki Arimura |
| 2000 | ILP | Learning Term Rewriting Systems from Entailment . | Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa |
| 2000 | PAKDD | Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. | Ryoichi Fujino, Hiroki Arimura, Setsuo Arikawa |
| 2000 | RECOMB | On approximation algorithms for local multiple alignment. | Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono |
| 1999 | DIS | Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers. | Toru Takae, Minoru Chikamune, Hiroki Arimura, Ayumi Shinohara, Hitoshi Inoue, Shun-ichi Takeya, Keiko Uezono, Terukazu Kawasaki |
| 1999 | DIS | Automatic Detection of Geomagnetic Sudden Commencement Using Lifting Wavelet Filters. | Shigeru Takano, Teruya Minamoto, Hiroki Arimura, Koichi Niijima, Toshihiko Iyemori, Tohru Araki |
| 1998 | ALT | A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. | Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Setsuo Arikawa |
| 1998 | DIS | An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases. | Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Shinichi Shimozono, Setsuo Arikawa |
| 1998 | ISAAC | Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. | Hiroki Arimura, Shinichi Shimozono |
| 1997 | ALT | Learning Acyclic First-Order Horn Sentences from Entailment. | Hiroki Arimura |
| 1997 | DLT | On the Complexity of Languages Definable by Hereditary Elementary Formal Systems. | Daisuke Ikeda, Hiroki Arimura |
| 1996 | ALT | Inductive Inference of Unbounded Unions of Pattern Languages from Positive Data. | Takeshi Shinohara, Hiroki Arimura |
| 1995 | ALT | Learning Unions of Tree Patterns Using Queries. | Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara |
| 1994 | ALT | Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. | Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara |
| 1994 | STACS | Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data. | Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki |
| 1992 | ALT | Efficient Inductive Inference of Primitive Prologs from Positive Data. | Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara |
| 1992 | COLT | Polynomial Time Inference of a Subclass of Context-Free Transformations. | Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara |
| 1991 | ALT | Polynomial-time inference of unions of tree pattern languages. | Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki |