📚 Reading List & Resources

🏛️ Top Conferences

You can obtain the following conferences from their corresponding homepages or the DBLP search engine:

SIGMOD VLDB ICDE SIGKDD SIGIR WWW NeurIPS ICLR ICML ACM MM AAAI
💡 导师寄语 (General Advice)

在科研探索中,扎实的理论基础是支撑高质量工作的基石,我们需要沉下心来去“啃”透这些理论。当然,作为计算机领域的学者,我们并非纯粹为了证明数学定理;真正的难点与核心在于:理清理论背后的逻辑脉络,并将其灵活应用、适当改造,以解决我们的实际问题。

同时,切记不要忽视底层的数据结构与算法技巧,要养成严谨分析时间复杂度与正确性的习惯。只有当你将数学的严密性与计算机的工程/算法思维完美结合时,才能做出好的研究成果。


📌 Graph Clustering

👨‍🎓 适合群体:本科生和硕士研究生。 标记 Theory 表示该作者的研究偏向理论基础,硬核且非常有趣。
ScholarAffiliationResearch TopicHomepage
Renchi YangHKBUGraph Clustering🔗 Visit
Xinwang LiuNUDTGraph Clustering🔗 Visit
Feiping NieNPUGraph Clustering🔗 Visit
Xuelong LiNPUGraph Clustering🔗 Visit
Dongqi FuUIUCHigher-order Clustering🔗 Visit
Nate VeldtTexas A&M UniversityHypergraph Clustering Theory🔗 Visit
dgleichPurdue UniversityLocal Clustering Theory🔗 Visit
Kimon FountoulakisUniversity of WaterlooLocal Clustering Theory🔗 Visit
Daniel A. SpielmanYale UniveristySpectral Graph Theory Theory🔗 Visit
Zeyuan ALLEN-ZHUMeta FAIR LabsLocal/Improve Cluster Theory🔗 Visit
Lap Chi LauUniversity of WaterlooSpectral Graph Theory Theory🔗 Visit
Austin R. BensonCornell UniversityHigher-order Clustering Theory🔗 Visit
Michael KapralovEPFLSpectral Graph Theory Theory🔗 Visit
He SunUniversity of EdinburghLocal Clustering Theory🔗 Visit


🚀 适合群体:对算法与数据结构有浓厚兴趣的同学(门槛稍高,本科生需量力而行)。
ScholarAffiliationResearch TopicHomepage
Meihao LiaoBITPPR🔗 Visit
Hanzhi WangRUCPPR and GNN🔗 Visit
Sibo WangCUHKPPR and GNN🔗 Visit
Pan LiPurdue UniversityPPR and GNN🔗 Visit
Jinhong JungJeonbuk National UniversityPPR🔗 Visit
Zhewei WeiRUCPPR and GNN🔗 Visit
Ronghua LiBITPPR and GNN🔗 Visit
Dongqi FuUIUCPPR and GNN🔗 Visit


📌 Community Search / Cohesive Subgraph

🚀 适合群体:对复杂图算法与底层数据结构有浓厚兴趣的同学。
ScholarAffiliationResearch TopicHomepage
Yixiang FangCUHK (Shenzhen)Community Search / (higher-order) Densest Subgraph🔗 Visit
Ronghua LiBITCommunity Search / Subgraph Counting🔗 Visit
C. SeshadhriUniversity of CaliforniaSubgraph Counting🔗 Visit
Shweta JainUniversity of UtahSubgraph Counting (Turan theorem for counting)🔗 Visit
Julian ShunMITParallel Algorithms for Cohesive Subgraph🔗 Visit
A. Erdem SarıyüceUniversity at BuffaloHierarchical Dense Subgraph / Nucleus Decomposition🔗 Visit
Kijung ShinKAISTCohesive Subgraph🔗 Visit
Ronghua LiBITKcore / Clique🔗 Visit
Xin HuangHKBUk-truss Community Search by Index🔗 Visit
Aristides GionisKTHDensest Subgraph🔗 Visit
Lijun ChangUSYDCohesive Subgraph book🔗 Visit
Charalampos E. TsourakakisBoston University(Higher-order) Densest Subgraph🔗 Visit


🌐 Classic Learning Resources

Resource & TopicAuthor / InstructorAccess Link
CS224W: Machine Learning with GraphsJure Leskovec (Stanford)🔗 Course
Theoretical Computer Science at NJUYitong Yin (NJU)🔗 Course
Graph Theory and Additive CombinatoricsYufei Zhao🔗 Book
Graph PartitioningLuca Trevisan (Stanford)🔗 Course
Advanced Data Structures (CUHK)Yufei Tao (CUHK)🔗 Course
Advanced Data Structures (MIT)Erik Demaine (MIT)🔗 Course
动手学深度学习 (Dive into Deep Learning)Mu Li🔗 Book
Mining of Massive DatasetsJure Leskovec🔗 Book