Xiaofan Li
I am a PhD student at Swinburne University of Technology, Australia. My PhD thesis mainly focuses on bridging Maximal Clique Enumeration algorithms to clique-related applications, by addressing the bottleneck of unbearable efficiency/memory cost caused by clique redundancy. I am also interested in more generalized cohesive subgraphs, e.g., k-core, k-truss, etc. Another topic of mine is quantum algorithm on database and graph, to speed up classical algorithms by quantum superposition and entanglement.
EMAIL / DBLP / GOOGLE SCHOLAR
Education
PhD Candidate in Computer Science
Swinburne University of Technology
Master Candidate in Theoretical Physics
University of Science and Technology of China
Bachelor of Engineering in Geodesy and Geomatics Engineering
Wuhan University
Publications
Conference Papers:
- One Set to Cover All Maximal Cliques Approximately
Xiaofan Li, Rui Zhou, Lu Chen, Chengfei Liu, Qiang He, and Yun Yang
SIGMOD 2022 - Finding a Summary for All Maximal Cliques
Xiaofan Li, Rui Zhou, Lu Chen, Yong Zhang, Chengfei Liu, Qiang He, and Yun Yang
ICDE 2021 - Mining Maximal Clique Summary with Effective Sampling
Xiaofan Li, Rui Zhou, Yujun Dai, Lu Chen, Chengfei Liu, Qiang He, and Yun Yang
ICDM 2019
Unpublished / To be submitted:
- Clique Comparator: A Fundamental Operator for Finding a Concise Clique Summary
Xiaofan Li, Rui Zhou, Lu Chen, Chengfei Liu, Qiang He, and Yun Yang
ACM VLDBJ 2022 - Efficiently Finding a Maximal Clique Summary via Effective Sampling
Xiaofan Li, Rui Zhou, Lu Chen, Chengfei Liu, Qiang He, and Yun Yang
IEEE TKDE 2022
Services
Awards
Excellent Student of Physics Summer School, Wuhan University (ranked 2/154 in school)
National Encouragement Scholarship (twice)
Star of Memory Challenge (ranked 6 in Wuhan University)