Biblio
"String Similarity Search: A Hash-Based Approach", {IEEE} Trans. Knowl. Data Eng., vol. 30, pp. 170–184, 2018.
, "Predicting Path Failure In Time-Evolving Graphs", KDD, pp. 1279-1289, 2019.
, "Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks", PVLDB, pp. 1498-1510, 2020.
, "Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened.", SIGMOD, pp. 2167-2181, 2020.
, "Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened.", SIGMOD, pp. 2167-2181, 2020.
, "Efficient Approximate Algorithms for Empirical Entropy and Mutual Information", SIGMOD, pp. 274-286, 2021.
, "Learning Based Proximity Matrix Factorization for Node Embedding", KDD, pp. 2243-2253, 2021.
, "Mask-GVAE: Blind Denoising Graphs via Partition", WWW, pp. 3688-3698, 2021.
, "Mask-GVAE: Blind Denoising Graphs via Partition", WWW, pp. 3688-3698, 2021.
, "Massively Parallel Algorithms for Personalized PageRank.", PVLDB, pp. 1668-1680, 2021.
, "Massively Parallel Algorithms for Personalized PageRank.", PVLDB, pp. 1668-1680, 2021.
, "Enumerating Maximum Cliques in Massive Graphs", IEEE Trans. Knowl. Data Eng., vol. 34, pp. 4215–4230, 2022.
, "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.
, "PSPC: efficient parallel shortest path counting on large-scale graphs", 2023 IEEE 39th International Conference on Data Engineering (ICDE): IEEE, pp. 896–908, 2023.
,