Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks. - Jingbang Chen; Qiuyang Mang; Hangrui Zhou; Richard Peng; Yu Gao 001; Chenhao Ma 001 (KDD, 2024)

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index. - Qiuyang Mang; Jingbang Chen; Hangrui Zhou; Yu Gao 001; Yingli Zhou; Richard Peng; Yixiang Fang; Chenhao Ma 001 (CoRR, 2024)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval. - William Kuszmaul; Aaron Putterman; Tingqiang Xu; Hangrui Zhou; Renfei Zhou (SODA, 2025)

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index. - Qiuyang Mang; Jingbang Chen; Hangrui Zhou; Yu Gao 001; Yingli Zhou; Qingyu Shi; Richard Peng; Yixiang Fang; Chenhao Ma 001 (Proc. VLDB Endow., 2025)

Scalable Approximate Biclique Counting over Large Bipartite Graphs. - Jingbang Chen; Weinuo Li; Yingli Zhou; Hangrui Zhou; Qiuyang Mang; Can Wang; Yixiang Fang; Chenhao Ma 001 (CoRR, 2025)