Shaofeng Jiang

LG 101, Chow Yei Ching Building
Department of Computer Science
The University of Hong Kong

Email: sfjiang at

I am a fourth year PhD candidate in the department of computer science, under the supervision of Dr. Hubert Chan. I am currently interested in approximation algorithms and online optimization. I obtained my BEng degree from Shandong University in June 2013.

I have been the coach of HKU ACM/ICPC Team since September 2014.


Conference Papers

  • Online Submodular Maximization with Free Disposal: Randomization Beats 1/4 for Partition Matroids. T-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang. SODA 2017.
  • A PTAS for the Steiner Forest Problem in Doubling Metrics. T-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang. FOCS 2016.
  • Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. T-H. Hubert Chan, Shaofeng H.-C. Jiang. SODA 2016.
  • Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order. T-H. Hubert Chan, Fei Chen, Shaofeng H.-C. Jiang. SODA 2015.


  • Teaching assistant [Fall 2014]: COMP8802 - Foundations on Digital Forensics and Security.