| TreeSpan: efficiently computing similarity all-matching G Zhu, X Lin, K Zhu, W Zhang, JX Yu Proceedings of the 2012 ACM SIGMOD International Conference on Management of …, 2012 | 55 | 2012 |
| Similarity search on supergraph containment H Shang, K Zhu, X Lin, Y Zhang, R Ichise 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 637-648, 2010 | 45 | 2010 |
| Nova: A novel and efficient framework for finding subgraph isomorphism mappings in large graphs K Zhu, Y Zhang, X Lin, G Zhu, W Wang Database Systems for Advanced Applications: 15th International Conference …, 2010 | 43 | 2010 |
| BMC: An efficient method to evaluate probabilistic reachability queries K Zhu, W Zhang, G Zhu, Y Zhang, X Lin Database Systems for Advanced Applications: 16th International Conference …, 2011 | 27 | 2011 |
| Efficient subgraph similarity all-matching G Zhu, K Zhu, W Zhang, X Lin, C Xiao Database Systems for Advanced Applications: 17th International Conference …, 2012 | 1 | 2012 |
| Graph database, and its tale on uncertainty K Zhu UNSW Sydney, 2013 | | 2013 |
Ying ZhangProfessor, School of Computer Science, the University of Technology Sydney (UTS)Verified email at uts.edu.au
