Biblio

Export 169 results:
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
L
Lu, C., J. Xu Yu, and H. Wei, "Exploring Triangle-Free Dense Structures", {IEEE} Trans. Knowl. Data Eng., vol. 30, pp. 278–291, 2018.
Lu, C., J. Xu Yu, R-H. Li, and H. Wei, "Exploring Hierarchies in Online Social Networks", {IEEE} Trans. Knowl. Data Eng., vol. 28, pp. 2086–2100, 2016.
Lu, C., J. Xu Yu, H. Wei, and Y. Zhang, "Finding the maximum clique in massive graphs", {PVLDB}, vol. 10, pp. 1538–1549, 2017.
Lu, C., J. Xu Yu, R-H. Li, and H. Wei, "Exploring Hierarchies in Online Social Networks", CoRR, vol. abs/1502.04220, 2015.
Lu, C., J. Xu Yu, Z. Zhang, and H. Cheng, "Graph Iso/Auto-morphism: A Divide-&-Conquer Approach", SIGMOD, pp. 1195-1207, 2021.
P
Pan, Q., H. Cheng, D. Wu, J. Xu Yu, and Y. Ke, "Stock Risk Mining by News", ADC, 2010.
Peng, Y., S. Bian, R. Li, S. Wang, and J. Xu Yu, "Finding Top-r Influential Communities under Aggregation Functions", 38th IEEE International Conference on Data Engineering, ICDE 2022, Kuala Lumpur, Malaysia, May 9-12, 2022: IEEE, pp. 1941–1954, 2022.
Peng, Y., J. Xu Yu, and S. Wang, "PSPC: efficient parallel shortest path counting on large-scale graphs", 2023 IEEE 39th International Conference on Data Engineering (ICDE): IEEE, pp. 896–908, 2023.
Piao, C., W. Zheng, Y. Rong, and H. Cheng, "Maximizing the Reduction Ability for Near-maximum Independent Set Computation", PVLDB, pp. 2466-2478, 2020.
Q
Qiao, M., H. Cheng, and J. Xu Yu, "Querying Shortest Path Distance with Bounded Errors in Large Graphs", SSDBM, pp. 255-273, 2011.
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.
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.
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.
Qiao, M., L. Qin, H. Cheng, J. Xu Yu, and W. Tian, "Top-K Nearest Keyword Search on Large Graphs", PVLDB, vol. 6, no. 10, pp. 901-912, 2013.
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, "Keyword search in databases: the power of RDBMS", SIGMOD Conference, pp. 681-694, 2009.
Qin, L., J. Xu Yu, and L. Chang, "Scalable keyword search on large data streams", VLDB J., vol. 20, no. 1, pp. 35-57, 2011.
Qin, L., J. Xu Yu, L. Chang, and Y. Tao, "Scalable Keyword Search on Large Data Streams", ICDE, pp. 1199-1202, 2009.
Qin, L., J. Xu Yu, B. Ding, and Y. Ishikawa, "Monitoring Aggregate k-NN Objects in Road Networks", SSDBM, pp. 168-186, 2008.
Qin, L., J. Xu Yu, and L. Chang, "Scalable Keyword Search on Large Data Streams", VLDB J., 2010.
Qin, L., J. Xu Yu, and B. Ding, "It wigList : Make Twig Pattern Matching Fast", DASFAA, pp. 850-862, 2007.
Qin, L., J. Xu Yu, and L. Chang, "Diversifying Top-K Results", PVLDB, vol. 5, no. 11, pp. 1124-1135, 2012.
Qin, L., J. Xu Yu, and L. Chang, "Computing structural statistics by keywords in databases", ICDE, pp. 363-374, 2011.
Qin, L., J. Xu Yu, L. Chang, and Y. Tao, "Querying Communities in Relational Databases", ICDE, pp. 724-735, 2009.
R
Rong, Y., H. Cheng, and Z. Mo, "Why It Happened: Identifying and Modeling the Reasons of the Happening of Social Events", Proceedings of the 21th {ACM} {SIGKDD} International Conference on Knowledge Discovery and Data Mining, Sydney, NSW, Australia, August 10-13, 2015, pp. 1015–1024, 2015.

Pages