Frequent Subgraph Discovery. - Michihiro Kuramochi; George Karypis (ICDM, 2001)

Automated Approaches for Classifying Structures. - Mukund Deshpande; Michihiro Kuramochi; George Karypis (BIOKDD, 2002)

Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds. - Mukund Deshpande; Michihiro Kuramochi; George Karypis (ICDM, 2003)

GREW-A Scalable Frequent Subgraph Discovery Algorithm. - Michihiro Kuramochi; George Karypis (ICDM, 2004)

Finding Frequent Patterns in a Large Sparse Graph. - Michihiro Kuramochi; George Karypis (SDM, 2004)

An Efficient Algorithm for Discovering Frequent Subgraphs. - Michihiro Kuramochi; George Karypis (IEEE Trans. Knowl. Data Eng., 2004)

Mining Chemical Compounds. - Mukund Deshpande; Michihiro Kuramochi; George Karypis (Data Mining in Bioinformatics, 2005)

Finding Frequent Patterns in a Large Sparse Graph*. - Michihiro Kuramochi; George Karypis (Data Min. Knowl. Discov., 2005)

Gene Classification Using Expression Profiles: A Feasibility Study. - Michihiro Kuramochi; George Karypis (Int. J. Artif. Intell. Tools, 2005)

Frequent Substructure-Based Approaches for Classifying Chemical Compounds. - Mukund Deshpande; Michihiro Kuramochi; Nikil Wale; George Karypis (IEEE Trans. Knowl. Data Eng., 2005)

Discovering frequent geometric subgraphs. - Michihiro Kuramochi; George Karypis (Inf. Syst., 2007)