By Dr Dong Wen

Preprints

Huang W; Wang H; Wen D; Cao X; Han B; Zhang Y; Zhang W, 2026, RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning, http://dx.doi.org/10.48550/arxiv.2601.12416

Xu L; Zhang J; Wen D; Qin L; Zhang Y; Lin X, 2026, Constant-time Connectivity and 2-Edge Connectivity Querying in Dynamic Graphs, http://dx.doi.org/10.48550/arxiv.2601.17285

Huang W; Wang H; Wen D; Ma S; Zhang W; Lin X, 2025, Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GAN, http://dx.doi.org/10.48550/arxiv.2506.01977

Ma Z; Wen D; Chen K; Fang Y; Lin X; Zhang W, 2025, Accelerating Historical K-Core Search in Temporal Graphs, http://dx.doi.org/10.48550/arxiv.2508.18151

Ma Z; Wen D; Wang H; Li W; Zhang W; Lin X, 2025, Accelerating K-Core Computation in Temporal Graphs, http://dx.doi.org/10.48550/arxiv.2508.14147

Ma S; Wang H; Wen D; Zhang W; Huang W; Zhang Y, 2025, WOCD: A Semi-Supervised Method for Overlapping Community Detection Using Weak Cliques, http://dx.doi.org/10.48550/arxiv.2508.00927

Huang W; Wang H; Wen D; Zhang W; Zhang Y; Lin X, 2025, DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching, http://dx.doi.org/10.48550/arxiv.2503.18245

Wu Y; Sun R; Wang X; Wen D; Zhang Y; Qin L; Lin X, 2024, Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs, http://dx.doi.org/10.48550/arxiv.2407.03954

Yu Y; Wen D; Zhang Y; Wang X; Zhang W; Lin X, 2020, Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems, http://dx.doi.org/10.48550/arxiv.2006.15980

Jin Y; Wang H; Zhang Y; Wen D; Qin L; Zhang W, Data in Agentic AI: A Comprehensive Survey, http://dx.doi.org/10.36227/techrxiv.176704339.93520117/v1

Back to profile page