NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs. - Ke Zhu 001; Ying Zhang 001; Xuemin Lin 001; Gaoping Zhu; Wei Wang 011 (DASFAA (1), 2010)

Similarity search on supergraph containment. - Haichuan Shang; Ke Zhu 001; Xuemin Lin 001; Ying Zhang 001; Ryutaro Ichise (ICDE, 2010)

BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries. - Ke Zhu 001; Wenjie Zhang 001; Gaoping Zhu; Ying Zhang 001; Xuemin Lin 001 (DASFAA (1), 2011)

Efficient Subgraph Similarity All-Matching. - Gaoping Zhu; Ke Zhu 001; Wenjie Zhang 001; Xuemin Lin 001; Chuan Xiao 001 (DASFAA (1), 2012)

TreeSpan: efficiently computing similarity all-matching. - Gaoping Zhu; Xuemin Lin 001; Ke Zhu 001; Wenjie Zhang 001; Jeffrey Xu Yu (SIGMOD Conference, 2012)

Graph database, and its tale on uncertainty. - Ke Zhu 001 (2013)

Efficient Probabilistic Supergraph Search. - Wenjie Zhang 001; Xuemin Lin 001; Ying Zhang 001; Ke Zhu 001; Gaoping Zhu (IEEE Trans. Knowl. Data Eng., 2016)