Dr. Piao received his BEng degree in Computer Science from Renmin University of China in 2017 and his PhD degree in Systems Engineering and Engineering Management from the Chinese University of Hong Kong in 2023. His research interests include developing inexact algorithms for NP-hard graph problems and creating machine learning models for database queries. He has published papers in renowned conferences such as PVLDB, KDD, and ICDE. Dr. Piao actively participates in academic competitions like CCF CSP and was invited to deliver a special lecture on NP-hard problems at APIO2022.

• Graph Algorithms
• NP-hard Problems
• AI for Database

• C. Piao, T. Xu, X. Sun, Y. Rong, K. Zhao, and H. Cheng. “Computing Graph Edit Distance via Neural Graph Matching.” Proceedings of the VLDB Endowment (PVLDB’23), 16(8): 1817-1829, 2023.
• W. Zheng, Y. Yang, and C. Piao. “Accelerating Set Intersections over Graphs by Reducing-Merging.” Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, 2349-2359.
• C. Piao, W. Zheng, Y. Rong, and H. Cheng. “Maximizing the Reduction Ability for Near-Maximum Independent Set Computation.” Proceedings of the VLDB Endowment (PVLDB’20), 13(12): 2466-2478, 2020.
• W. Zheng, C. Piao, H. Cheng, and J. Yu. “Computing a Near-Maximum Independent Set in Dynamic Graphs.” IEEE International Conference on Data Engineering (ICDE’19), 76-87, 2019.