Biblio

Export 11 results:
Filters: Author is Lijun Chang  [Clear All Filters]
2011
Chang, L., J. Xu Yu, L. Qin, Y. Zhu, and H. Wang, "Finding information nebula over large networks", CIKM, pp. 1465-1474, 2011.
2012
Qin, L., J. Xu Yu, and L. Chang, "Computing Structural Statistics by Keywords in Databases", IEEE Trans. Knowl. Data Eng., vol. 24, no. 10, pp. 1731-1746, 2012.
Qin, L., J. Xu Yu, and L. Chang, "Diversifying Top-K Results", PVLDB, vol. 5, no. 11, pp. 1124-1135, 2012.
Qiao, M., H. Cheng, L. Chang, and J. Xu Yu, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", ICDE, pp. 462-473, 2012.
Chang, L., J. Xu Yu, L. Qin, H. Cheng, and M. Qiao, "The exact distance to destination in undirected world", VLDB J., vol. 21, no. 6, pp. 869-888, 2012.
2013
Qiao, M., H. Cheng, L. Qin, J. Xu Yu, P. S. Yu, and L. Chang, "Computing weight constraint reachability in large networks", VLDB J., vol. 22, no. 3, pp. 275-294, 2013.
Chang, L., J. Xu Yu, L. Qin, X. Lin, C. Liu, and W. Liang, "Efficiently computing k-edge connected components via graph decomposition", SIGMOD Conference: ACM, pp. 205-216, 2013.
Chang, L., J. Xu Yu, and L. Qin, "Fast Maximal Cliques Enumeration in Sparse Graphs", Algorithmica, vol. 66, no. 1, pp. 173-186, 2013.
Zhang, Z., J. Xu Yu, L. Qin, L. Chang, and X. Lin, "I/O efficient: computing SCCs in massive graphs", SIGMOD Conference: ACM, pp. 181-192, 2013.
2014
Qiao, M., H. Cheng, L. Chang, and J. Xu Yu, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", IEEE Trans. Knowl. Data Eng., vol. 26, no. 1, pp. 55-68, 2014.
2015
Zhang, Z., J. Xu Yu, L. Qin, L. Chang, and X. Lin, "I/O efficient: computing SCCs in massive graphs", {VLDB} J., vol. 24, pp. 245–270, 2015.