Published in SIGMOD 2026, 2026
Recommended citation: Yizhang He, Wenjie Zhang, Kai Wang, Xuemin Lin, Ying Zhang, Wei Ni. Efficient and Effective Biclique Counting with Local Differential Privacy. In Proc. ACM Manag. Data (SIGMOD), 4(1): 1-24, 2026.
Download Paper
Published in SIGMOD 2025, 2025
Recommended citation: Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Wei Ni. Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy. In Proc. ACM Manag. Data (SIGMOD), 3(3): 211:1-211:26, 2025.
Download Paper
Published in SIGMOD 2025, 2025
Recommended citation: Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang. Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy. In Proc. ACM Manag. Data (SIGMOD), 2(6): 228:1-228:26, 2024. Also In SIGMOD, 2025.
Download Paper
Published in ICDE 2025, 2025
Recommended citation: Yuting Zhang, Wei Ni, Kai Wang, Yizhang He, Conggai Li. Truss Decomposition Under Edge Local Differential Privacy. In IEEE ICDE, pages 2670-2683, 2025.
Published in TKDE 2025, 2025
Recommended citation: Shunyang Li, Kai Wang, Wenjie Zhang, Xuemin Lin, Yizhang He. Efficient Bitruss Decomposition on GPU. IEEE Trans. Knowl. Data Eng., 37(8): 4578-4590, 2025.
Published in ICDE 2024, 2024
Recommended citation: Shunyang Li, Kai Wang, Xuemin Lin, Wenjie Zhang, Yizhang He, Long Yuan. Querying Historical Cohesive Subgraphs over Temporal Bipartite Graphs. In IEEE ICDE, pages 2503-2516, 2024.
Published in ICDE 2024, 2024
Recommended citation: Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Wei Ni, Ying Zhang. Butterfly Counting over Bipartite Graphs with Local Differential Privacy. In IEEE ICDE, pages 2351-2364, 2024.
Published in VLDBJ 2024, 2024
Recommended citation: Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang. Discovering Critical Vertices for Reinforcement of Large-scale Bipartite Networks. VLDB J., 33(6): 1861-1886, 2024.
Download Paper
Published in SIGMOD 2023, 2023
Recommended citation: Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang. Scaling Up k-Clique Densest Subgraph Detection. In Proc. ACM Manag. Data (SIGMOD), 1(1): 69:1-69:26, 2023.
Published in TKDE 2023, 2023
Recommended citation: Kai Wang, Gengda Zhao, Wenjie Zhang, Xuemin Lin, Ying Zhang, Yizhang He, Chunxiao Li. Cohesive Subgraph Discovery over Uncertain Bipartite Graphs. IEEE Trans. Knowl. Data Eng., 35(11): 11165-11179, 2023.
Published in ICDE 2022, 2022
Recommended citation: Gengda Zhao, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Yizhang He. Efficient Computation of Cohesive Subgraphs in Uncertain Bipartite Graphs. In IEEE ICDE, pages 2333-2345, 2022.
Published in ICDE 2022, 2022
Recommended citation: Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang. Efficient Reinforcement of Bipartite Networks at Billion Scale. In IEEE ICDE, pages 446-458, 2022.
Published in Information Sciences, 2021
Recommended citation: Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang. Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs. Information Sciences, 572: 277-296, 2021.
Download Paper
Also available on Google Scholar.