博士毕业于华东师范大学，师从林学民教授，主要研究大数据计算、数据挖掘、图数据分析等方向。江苏省科协青托工程入选者，获ACM南京分会新星奖，担任CCF数据库专委会和信息系统专委会执行委员。目前，已发表学术论文20余篇，其中CCF A类论文10余篇，包括VLDB，ICDE，TKDE，WWW等，获评DASFAA 2023最佳学生论文奖。主持国家自然科学青年基金（在研），江苏省自然科学青年基金（在研），中国博士后科学基金面上项目（已结题），参与国家科技部重点研发计划2项（已结题），公开发明专利6项。同时，应邀担任ICDE、TKDE、KDD、CIKM、DASFAA、《计算机工程》等数据库领域知名会议\期刊审稿专家。

尚有少量名额，欢迎乐观开朗、热爱科研的学生报考硕士研究生，咨询邮箱：zichen@nuaa.edu.cn

部分代表性论文：

---

( * 通讯作者 )

[1]    “Efficient Maximum Balanced k-biplex Search over Bipartite Graphs”, ICDE, accepted, 2025. [通讯，CCF A类会议]

[2]    “HINSCAN: Efficient Structural Graph Clustering over Heterogeneous Information Networks”, ICDE, accepted, 2025. [通讯，CCF A类会议]

[3]    “I/O Efficient Label-Constrained Reachability Queries in Large Graphs”, VLDB, 17(10):2590-2602, 2024.  [通讯，CCF A类会议]

[4]    “Parallel Contraction Hierarchies Construction on Road Networks”, TKDE, accepted, 2024. [一作，CCF A类期刊]

[5]    “Index-Based Biclique Percolation Communities Search on Bipartite Graphs”, IEEE International Conference on Data Engineering (ICDE), 2690-2703, 2023. [一作，CCF A类会议]             

[6]    “Higher-Order Truss Decomposition in Graphs”, IEEE Transactions on Knowledge and DataEngineering (TKDE), 35(4), 3966-3978, 2023.  [一作，CCF A类期刊]

[7]    “Balanced Clique Computation in Signed Networks: Concepts and Algorithms”, IEEE Transactions on Knowledge and Data Engineering (TKDE), 35(11), 11079-11092, 2023. [一作，CCF A类期刊]

[8]    “Efficient Maximal Balanced Clique Enumeration in Signed Networks”, The Web Conference (WWW), 339-349, 2020. [一作，CCF A类会议]

[9]    “Fully Dynamic Contraction Hierarchies with Label Restrictions on Road Networks”, Data Science and Engineering (DSE), 8(3):263-278, 2023. [一作，中科院一区]        

[10] “Finding the Maximum k-Balanced Biclique on Weighted Bipartite Graphs”, IEEE Transactions on Knowledge and Data Engineering (TKDE), 35(8), 7994-8007, 2023. [通讯，CCF A类期刊]

[11] “Index-based Structural Clustering on Directed Graphs”, IEEE International Conference on Data Engineering (ICDE), 2832-2845, 2022. [通讯，CCF A类会议]   

[12] “Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks”, VLDB, accepted, 2025. [CCF A类会议]

[13] “Towards Efficient Shortest Path Counting on Billion-Scale Graphs”, IEEE International Conference on Data Engineering (ICDE), 2570-2583, 2023. [CCF A类会议]  

[14] “Enhancing Resilience in Website Fingerprinting: Novel Adversary Strategies for Noisy Traffic Environments", TIFS, 19:7216-7231, 2024. [CCF A类期刊]

[15] “Contraction Hierarchies with Label Restrictions Maintenance in Dynamic Road Networks”, DASFAA, 269-285, 2023. [Best Student Paper, 通讯，CCF B类会议]    

主要获奖：

---

[1] ACM南京分会新星奖, 2024

[2] 江苏省科协青年科技人才托举工程, 2023

[3] DASFAA最佳学生论文奖, 2023

[4] WWW会议资助奖, 2020

研究生培养：

---

已毕业学生：

2020级：赵奕威（2A，国奖，市级优秀毕业生，舟山市选调生）

2021级：冯博（DASFAA最佳学生论文奖，中科院长春光学精密机械与物理研究所）