We also give a nearly-linear time algorithm for partitioning well-clustered graphs, which is based on heat kernel embeddings and approximate nearest neighbor data structures.
I am a tenured lecturer of Computer Science at the University of Bristol. Prior to that, I was a senior researcher at the Max Planck Institute for Informatics, an independent research group leader at the Cluster of Excellence on "Multimodal Computing and Interaction", Saarland University, and a research fellow at the Simons Institute for the Theory of Computing, UC Berkeley.
I obtained a BA from Fudan University (2005), and a PhD from Fudan University (2010). I won the President Medal of Fudan University in 2004, awarded to 2 out of 45,000 students that year. My thesis won Shanghai Distinguished Dissertation Award.
My main research is in algorithm's design and analysis. Specific topics that I have worked on include computational geometry, data streaming algorithms, distributed computing, algorithmic spectral graph theory.