Issue Date | Title | Author(s) |
2015-01-01 | Optimal Enumeration: Efficient Top-k Tree Matching | Chang, L; Lin, X; Zhang, W; Yu, JX; Zhang, Y; Qin, L |
2012-07-10 | Finding top-k similar graphs in graph databases | Zhu, Y; Qin, L; Yu, JX; Cheng, H |
2009-07-08 | Querying communities in relational databases | Qin, L; Yu, JX; Chang, L; Tao, Y |
2012-01-01 | Diversifying top-κ results | Qin, L; Yu, JX; Chang, L |
2012-07-10 | I/O cost minimization: Reachability queries processing over massive graphs | Zhang, Z; Yu, JX; Qin, L; Zhu, Q; Zhou, X |
2004-06-01 | Mining dependent patterns in probabilistic databases | Zhang, S; Zhang, C; Yu, JX |
2018-01-01 | Targeted influence minimization in social networks | Wang, X; Deng, K; Li, J; Yu, JX; Jensen, CS; Yang, X |
2018-02-01 | Reachability querying: an independent permutation labeling approach | Wei, H; Yu, JX; Lu, C; Jin, R |
2008-01-01 | Taming verification hardness: An efficient algorithm for testing subgraph isomorphism | Shang, H; Zhang, Y; Lin, X; Yu, JX |
2008-05-16 | Finding time-dependent shortest paths over large graphs | Ding, B; Yu, JX; Qin, L |