Research on combined framework and measurement design of parallel kinematic machines (PKM) digital prototyping. - Fan Zhang 036; Zhe Yin; Liwen Guan; Liping Wang 001 (SMC (5), 2004)

Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem. - Fan Zhang 036; Ying Zhang 001; Lu Qin 001; Wenjie Zhang 001; Xuemin Lin 001 (AAAI, 2017)

When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks. - Fan Zhang 036; Ying Zhang 001; Lu Qin 001; Wenjie Zhang 001; Xuemin Lin 001 (Proc. VLDB Endow., 2017)

OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks. - Fan Zhang 036; Wenjie Zhang 001; Ying Zhang 001; Lu Qin 001; Xuemin Lin 001 (Proc. VLDB Endow., 2017)

Cohesive subgraph mining on social networks - Fan Zhang 036 (2017)

Finding Maximal Stable Cores in Social Networks. - Alexander Zhou 001; Fan Zhang 036; Long Yuan 001; Ying Zhang 001; Xuemin Lin 001 (ADC, 2018)

Towards Efficient Path Skyline Computation in Bicriteria Networks. - Dian Ouyang; Long Yuan 001; Fan Zhang 036; Lu Qin 001; Xuemin Lin 001 (DASFAA (1), 2018)

External Topological Sorting in Large Graphs. - Zhu Qing; Long Yuan 001; Fan Zhang 036; Lu Qin 001; Xuemin Lin 001; Wenjie Zhang 001 (DASFAA (1), 2018)

Discovering Strong Communities with User Engagement and Tie Strength. - Fan Zhang 036; Long Yuan 001; Ying Zhang 001; Lu Qin 001; Xuemin Lin 001; Alexander Zhou 001 (DASFAA (1), 2018)

Efficiently Reinforcing Social Networks over User Engagement and Tie Strength. - Fan Zhang 036; Ying Zhang 001; Lu Qin 001; Wenjie Zhang 001; Xuemin Lin 001 (ICDE, 2018)

Similarity Evaluation on Labeled Graphs via Hierarchical Core Decomposition. - Deming Chu; Fan Zhang 036; Jingjing Lin (Big Data (CCF), 2019)

Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques. - Chen Zhang 013; Wenjie Zhang 001; Ying Zhang 001; Lu Qin 001; Fan Zhang 036; Xuemin Lin 001 (CIKM, 2019)

Hierarchical Decomposition of Big Graphs. - Ying Zhang 001; Lu Qin 001; Fan Zhang 036; Wenjie Zhang 001 (ICDE, 2019)

K-Core Maximization: An Edge Addition Approach. - Zhongxin Zhou; Fan Zhang 036; Xuemin Lin 001; Wenjie Zhang 001; Chen Chen 017 (IJCAI, 2019)

Pivotal Relationship Identification: The K-Truss Minimization Problem. - Weijie Zhu; Mengqi Zhang; Chen Chen 017; Xiaoyang Wang 002; Fan Zhang 036; Xuemin Lin 001 (IJCAI, 2019)

CoreCube: Core Decomposition in Multilayer Graphs. - Boge Liu; Fan Zhang 036; Chen Zhang 013; Wenjie Zhang 001; Xuemin Lin 001 (WISE, 2019)

K-Core Maximization through Edge Additions. - Zhongxin Zhou; Fan Zhang 036; Xuemin Lin 001; Wenjie Zhang 001; Chen Chen 017 (CoRR, 2019)

Critical Edge Identification: A K-Truss Based Model. - Wenjie Zhu; Mengqi Zhang; Chen Chen 017; Xiaoyang Wang 002; Fan Zhang 036; Xuemin Lin 001 (CoRR, 2019)

Efficient Progressive Minimum k-core Search. - Conggai Li; Fan Zhang 036; Ying Zhang 001; Lu Qin 001; Wenjie Zhang 001; Xuemin Lin 001 (Proc. VLDB Endow., 2019)

Efficient community discovery with user engagement and similarity. - Fan Zhang 036; Xuemin Lin 001; Ying Zhang 001; Lu Qin 001; Wenjie Zhang 001 (VLDB J., 2019)

Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength. - Maryam Ghafouri; Kai Wang 037; Fan Zhang 036; Ying Zhang 001; Xuemin Lin 001 (DASFAA (2), 2020)

Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation. - Chen Zhang 013; Fan Zhang 036; Wenjie Zhang 001; Boge Liu; Ying Zhang 001; Lu Qin 001; Xuemin Lin 001 (ICDE, 2020)

Finding the Best k in Core Decomposition: A Time and Space Optimal Solution. - Deming Chu; Fan Zhang 036; Xuemin Lin 001; Wenjie Zhang 001; Ying Zhang 001; Yinglong Xia; Chenyi Zhang 002 (ICDE, 2020)

Global Reinforcement of Social Networks: The Anchored Coreness Problem. - Qingyuan Linghu; Fan Zhang 036; Xuemin Lin 001; Wenjie Zhang 001; Ying Zhang 001 (SIGMOD Conference, 2020)

Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems. - Fan Zhang 036; Conggai Li; Ying Zhang 001; Lu Qin 001; Wenjie Zhang 001 (IEEE Trans. Knowl. Data Eng., 2020)

Truss Decomposition on Multilayer Graphs. - Hongxuan Huang; Qingyuan Linghu; Fan Zhang 036; Dian Ouyang; Shiyu Yang (IEEE BigData, 2021)

Efficient Community Search with Size Constraint. - Boge Liu; Fan Zhang 036; Wenjie Zhang 001; Xuemin Lin 001; Ying Zhang 001 (ICDE, 2021)

Towards User Engagement Dynamics in Social Networks. - Qingyuan Linghu; Fan Zhang 036; Xuemin Lin 001; Wenjie Zhang 001; Ying Zhang 001 (CoRR, 2021)

Discovering fortress-like cohesive subgraphs. - Conggai Li; Fan Zhang 036; Ying Zhang 001; Lu Qin 001; Wenjie Zhang 001; Xuemin Lin 001 (Knowl. Inf. Syst., 2021)

Hierarchical Core Maintenance on Large Dynamic Graphs. - Zhe Lin; Fan Zhang 036; Xuemin Lin 001; Wenjie Zhang 001; Zhihong Tian (Proc. VLDB Endow., 2021)

Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search. - Deming Chu; Fan Zhang 036; Wenjie Zhang 001; Xuemin Lin 001; Ying Zhang 001 (ICDE, 2022)

Are we really making much progress in unsupervised graph outlier detection? Revisiting the problem with new insight and superior method. - Yihong Huang; Liping Wang 001; Fan Zhang 036; Xuemin Lin 001 (CoRR, 2022)

Anchored coreness: efficient reinforcement of social networks. - Qingyuan Linghu; Fan Zhang 036; Xuemin Lin 001; Wenjie Zhang 001; Ying Zhang 001 (VLDB J., 2022)

Discovering key users for defending network structural stability. - Fan Zhang 036; Jiadong Xie 002; Kai Wang 037; Shiyu Yang; Yu Jiang (World Wide Web, 2022)

VEK: a vertex-oriented approach for edge k-core problem. - Zhongxin Zhou; Wenchao Zhang; Fan Zhang 036; Deming Chu; Binghao Li (World Wide Web, 2022)

Finding Introverted Cores in Bipartite Graphs. - Kaiyuan Shu; Qi Liang 006; Haicheng Guo; Fan Zhang 036; Kai Wang 037; Long Yuan 001 (WISA, 2023)

IMinimize: A System for Negative Influence Minimization via Vertex Blocking. - Siyi Teng; Jiadong Xie 002; Mingkai Zhang; Kai Wang 037; Fan Zhang 036 (CIKM, 2023)

Minimizing the Influence of Misinformation via Vertex Blocking. - Jiadong Xie 002; Fan Zhang 036; Kai Wang 037; Xuemin Lin 001; Wenjie Zhang 001 (ICDE, 2023)

Unsupervised Graph Outlier Detection: Problem Revisit, New Insight, and Superior Method. - Yihong Huang; Liping Wang 001; Fan Zhang 036; Xuemin Lin 001 (ICDE, 2023)

Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs. - Jiujing Zhang; Shiyu Yang; Dian Ouyang; Fan Zhang 036; Xuemin Lin 001; Long Yuan 001 (ICDE, 2023)

Quantifying Node Importance over Network Structural Stability. - Fan Zhang 036; Qingyuan Linghu; Jiadong Xie 002; Kai Wang 037; Xuemin Lin 001; Wenjie Zhang 001 (KDD, 2023)

GPUSCAN++: Eficient Structural Graph Clustering on GPUs. - Long Yuan 001; Zeyu Zhou; Xuemin Lin 001; Zi Chen 003; Xiang Zhao 002; Fan Zhang 036 (CoRR, 2023)

Influence Minimization via Blocking Strategies. - Jiadong Xie 002; Fan Zhang 036; Kai Wang 037; Jialu Liu; Xuemin Lin 001; Wenjie Zhang 001 (CoRR, 2023)

Efficient m-closest entity matching over heterogeneous information networks. - Wancheng Long; Xiaowen Li; Liping Wang 012; Fan Zhang 036; Zhe Lin; Xuemin Lin 001 (Knowl. Based Syst., 2023)

Adaptive Asynchronous Clustering Algorithms for Wireless Mesh Networks. - Cheng Qiao; Kenneth N. Brown; Fan Zhang 036; Zhihong Tian (IEEE Trans. Knowl. Data Eng., 2023)

Efficient p-Biclique Query on Large Bipartite Networks. - Zhizhi Gao; Deming Chu; Fan Zhang 036; Kai Wang 037; Long Yuan 001 (WISA, 2024)

Seeing the Forest for the Trees: Road-Level Insights Assisted Lane-Level Traffic Prediction. - Shuhao Li 001; Yue Cui 001; Jingyi Xu; Jing Zhao; Fan Zhang 036; Weidong Yang 001; Xiaofang Zhou 001 (CIKM, 2024)

Maximizing Coreness Gain via Incentive Allocation. - Juntao Fang; Jinyu Duan; Fan Zhang 036; Jiachen Sun; Wenqing Lin (DSIT, 2024)

ST-ABC: Spatio-Temporal Attention-Based Convolutional Network for Multi-Scale Lane-Level Traffic Prediction. - Shuhao Li 001; Yue Cui 001; Libin Li; Weidong Yang 001; Fan Zhang 036; Xiaofang Zhou 001 (ICDE, 2024)

EntropyStop: Unsupervised Deep Outlier Detection with Loss Entropy. - Yihong Huang; Yuang Zhang; Liping Wang 012; Fan Zhang 036; Xuemin Lin 001 (KDD, 2024)

Optimizing Network Resilience via Vertex Anchoring. - Siyi Teng; Jiadong Xie 002; Fan Zhang 036; Can Lu; Juntao Fang; Kai Wang 037 (WWW, 2024)

Graph Summarization: Compactness Meets Efficiency. - Deming Chu; Fan Zhang 036; Wenjie Zhang 001; Ying Zhang 001; Xuemin Lin 001 (Proc. ACM Manag. Data, 2024)

Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution. - Fan Zhang 036; Haicheng Guo; Dian Ouyang; Shiyu Yang; Xuemin Lin 001; Zhihong Tian (IEEE Trans. Knowl. Data Eng., 2024)

Influence Maximization via Vertex Countering. - Jiadong Xie 002; Zehua Chen; Deming Chu; Fan Zhang 036; Xuemin Lin 001; Zhihong Tian (Proc. VLDB Endow., 2024)

Efficient Regular Simple Path Queries under Transitive Restricted Expressions. - Qi Liang 006; Dian Ouyang; Fan Zhang 036; Jianye Yang 001; Xuemin Lin 001; Zhihong Tian (Proc. VLDB Endow., 2024)

Discovering and Maintaining the Best $k$k in Core Decomposition. - Deming Chu; Fan Zhang 036; Wenjie Zhang 001; Xuemin Lin 001; Ying Zhang 001; Yinglong Xia; Chenyi Zhang 002 (IEEE Trans. Knowl. Data Eng., 2024)

Most Similar Biclique Search at Scale. - Deming Chu; Zhizhi Gao; Fan Zhang 036; Wenjie Zhang 001; Xuemin Lin 001; Zhihong Tian (Proc. VLDB Endow., 2024)

Multi-Source Shortest Path Query With Assembly Points on Large Graphs. - Dian Ouyang; Zhuoran Wang; Fan Zhang 036; Shiyu Yang; Jianye Yang 001; Xuemin Lin 001 (IEEE Trans. Knowl. Data Eng., 2024)

The k-Trine Cohesive Subgraph and Its Efficient Algorithms. - Jinyu Duan; Haicheng Guo; Fan Zhang 036; Kai Wang 037; Zhengping Qian; Zhihong Tian (KDD (1), 2025)

A Knowledge Extraction Framework on Cyber Threat Reports with Enhanced Security Profiles. - Yongxin Cai; Jing Qiu 002; Fan Zhang 036; Qiang Li; Lei Chen 002 (SIGIR, 2025)

Fine-Grained Traffic Inference from Road to Lane via Spatio-Temporal Graph Node Generation. - Shuhao Li 001; Weidong Yang 001; Yue Cui 001; Xiaoxing Liu; Lingkai Meng; Lipeng Ma; Fan Zhang 036 (CoRR, 2025)

Unifying Lane-Level Traffic Prediction From a Graph Structural Perspective: Benchmark and Baseline. - Shuhao Li 001; Yue Cui 001; Jingyi Xu; Libin Li; Lingkai Meng; Weidong Yang 001; Fan Zhang 036; Xiaofang Zhou 001 (IEEE Trans. Knowl. Data Eng., 2025)

$ text {GPUSCAN}^{++}$: Efficient Structural Graph Clustering on GPUs. - Long Yuan 001; Zeyu Zhou; Zi Chen 003; Xuemin Lin 001; Xiang Zhao 002; Fan Zhang 036 (IEEE Trans. Parallel Distributed Syst., 2025)