Xuemin Lin (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

159 Gaoping Zhu, Ke Zhu, Wenjie Zhang, Xuemin Lin, Chuan Xiao: Efficient Subgraph Similarity All-Matching. DASFAA (1) 2012: 455-469

153 Gaoping Zhu, Xuemin Lin, Ke Zhu, Wenjie Zhang, Jeffrey Xu Yu: TreeSpan: efficiently computing similarity all-matching. SIGMOD Conference 2012: 529-540

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

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

124 Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ryutaro Ichise: Similarity search on supergraph containment. ICDE 2010: 637-648

Selection of 5 from 159 records - Xuemin Lin has 117 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

159		Gaoping Zhu, Ke Zhu, Wenjie Zhang, Xuemin Lin, Chuan Xiao: Efficient Subgraph Similarity All-Matching. DASFAA (1) 2012: 455-469
153		Gaoping Zhu, Xuemin Lin, Ke Zhu, Wenjie Zhang, Jeffrey Xu Yu: TreeSpan: efficiently computing similarity all-matching. SIGMOD Conference 2012: 529-540
145		Ke Zhu, Wenjie Zhang, Gaoping Zhu, Ying Zhang, Xuemin Lin: BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries. DASFAA (1) 2011: 434-449
130		Ke Zhu, Ying Zhang, Xuemin Lin, Gaoping Zhu, Wei Wang: NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs. DASFAA (1) 2010: 140-154
124		Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ryutaro Ichise: Similarity search on supergraph containment. ICDE 2010: 637-648