Biblio
"Measuring robustness of complex networks under MVC attack", CIKM, pp. 1512-1516, 2012.
, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", ICDE, pp. 462-473, 2012.
, "Robust Reputation-Based Ranking on Bipartite Rating Networks", SDM, pp. 612-623, 2012.
, "Semi-supervised Clustering of Graph Objects: A Subgraph Mining Approach", DASFAA (1), pp. 197-212, 2012.
, "The exact distance to destination in undirected world", VLDB J., vol. 21, no. 6, pp. 869-888, 2012.
, "Catch the Wind: Graph workload balancing on cloud", ICDE: IEEE Computer Society, pp. 553-564, 2013.
, "Computing weight constraint reachability in large networks", VLDB J., vol. 22, no. 3, pp. 275-294, 2013.
, "Co-occurrence prediction in a large location-based social network", Frontiers of Computer Science, vol. 7, no. 2, pp. 185-194, 2013.
, "Efficient Direct Mining of Selective Discriminative Patterns for Classification", Contrast Data Mining: CRC Press, pp. 39-58, 2013.
, "Efficiently computing k-edge connected components via graph decomposition", SIGMOD Conference: ACM, pp. 205-216, 2013.
, "Fast Maximal Cliques Enumeration in Sparse Graphs", Algorithmica, vol. 66, no. 1, pp. 173-186, 2013.
, "Frequent Subgraph Summarization with Error Control", WAIM: Springer, pp. 1-12, 2013.
, "High efficiency and quality: large graphs matching", VLDB J., vol. 22, no. 3, pp. 345-368, 2013.
, "I/O efficient: computing SCCs in massive graphs", SIGMOD Conference: ACM, pp. 181-192, 2013.
, "Random-walk domination in large graphs: problem definitions and fast solutions", CoRR, vol. abs/1302.4546, 2013.
, "Scalable Diversified Ranking on Large Graphs", IEEE Trans. Knowl. Data Eng., vol. 25, no. 9, pp. 2133-2146, 2013.
, "Top-K Nearest Keyword Search on Large Graphs", PVLDB, vol. 6, no. 10, pp. 901-912, 2013.
, "Top-K Structural Diversity Search in Large Networks", PVLDB, vol. 6, no. 13, pp. 1618-1629, 2013.
, "What's Your Next Move: User Activity Prediction in Location-based Social Networks", SDM: SIAM, pp. 171-179, 2013.
, "Auto-Approximation of Graph Computing", {PVLDB}, vol. 7, pp. 1833–1844, 2014.
, "Contract & Expand: I/O Efficient SCCs Computing", ICDE, pp. 208–219, 2014.
, "Measuring the impact of MVC attack in large complex networks", Inf. Sci., vol. 278, pp. 685–702, 2014.
, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", IEEE Trans. Knowl. Data Eng., vol. 26, no. 1, pp. 55-68, 2014.
, "Querying k-truss community in large and dynamic graphs", SIGMOD, pp. 1311–1322, 2014.
, "Random-walk domination in large graphs", ICDE, pp. 736–747, 2014.
,