Efficient Antagonistic k-plex Enumeration in Signed Graphs. - Lantian Xu 002; Rong-Hua Li; Dong Wen 001; Qiangqiang Dai; Guoren Wang; Lu Qin 001 (CoRR, 2024)

On Querying Historical Connectivity in Temporal Graphs. - Jingyi Song; Dong Wen 001; Lantian Xu 002; Lu Qin 001; Wenjie Zhang 001; Xuemin Lin 001 (Proc. ACM Manag. Data, 2024)

Constant-time Connectivity Querying in Dynamic Graphs. - Lantian Xu 002; Dong Wen 001; Lu Qin 001; Ronghua Li; Ying Zhang 001; Xuemin Lin 001 (Proc. ACM Manag. Data, 2024)

Minimum Spanning Tree Maintenance in Dynamic Graphs. - Lantian Xu 002; Dong Wen 001; Lu Qin 001; Ronghua Li; Ying Zhang 001; Yang Lu; Xuemin Lin 001 (Proc. ACM Manag. Data, 2025)

Constant-time Connectivity and 2-Edge Connectivity Querying in Dynamic Graphs. - Lantian Xu 002; Junhua Zhang; Dong Wen 001; Lu Qin 001; Ying Zhang 001; Xuemin Lin 001 (CoRR, 2026)

On Querying Historical Connectivity in Large-scale Temporal Graphs. - Lantian Xu 002; Dong Wen 001; Lu Qin 001; Wenjie Zhang 001; Xubo Wang; Xuemin Lin 001 (VLDB J., 2026)