Renchi Yang (杨任驰) is currently a Research Fellow at NUS. He obtained his B.E. from BUPT, and received his Ph.D. in computer science from NTU, advised by Prof. Xiaokui XIAO and Prof. Sourav Saha Bhowmick. His general research area is large-scale data management and analytics. He is currently interested in graph mining and learning, as well as designing efficient algorithms for massive high-dimensional data.


  • Aug 09, 2021: Our paper titled “Scaling Attributed Network Embedding to Massive Graphs” was selected as the best research paper in VLDB 2021
  • May 15, 2021: One paper “Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization” has been accepted by VLDB 2021
  • Jan 16, 2021: One paper “Effective and Scalable Clustering on Massive Attributed Graphs” has been accepted by TheWebConf 2021

Research Interests

  • Data management and analytics
  • Graph mining and learning
  • Parallel and distributed computing

Doctoral Thesis

Efficient and Scalable Techniques for PageRank-based Graph Analytics, Renchi Yang
Thesis Committee: James Cheng, George Fletcher and Ying Zhang