Professor Chan, Hubert T.H.

PhD Carnegie Mellon
BEng(CompSc) Programme Director; Associate Professor

Tel: (+852) 2857 8461
Fax: (+852) 2559 8447


Professor Hubert Chan is currently an Associate Professor at the Department of Computer Science at the University of Hong Kong. He completed his PhD in Computer Science at Carnegie Mellon University in 2007. In his PhD thesis, he investigated notions of metric dimension and the design of algorithms whose performance adapts to the dimension of the given metric. Before taking up the faculty position at HKU, he spent two years as a post-doc at Max-Planck-Institut fuer Informatik in Germany.

Research Interests

Algorithms, Combinatorial Optimization, Discrete Metric Spaces, Graphs and Information Networks, Security & Privacy

Selected Publications

  • T.-H. Hubert Chan, Arnaud Guerqin, Mauro Sozio, Fully Dynamic k-Center Clustering, WWW 2018
  • T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi, Cache-Oblivious and Data-Oblivious Sorting and Applications, SODA 2018
  • Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan, Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method, ICML 2017
  • Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio, Large Scale Density-friendly Graph Decomposition via Convex Programming, WWW 2017
  • T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang, Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids, SODA 2017
  • T-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang, A PTAS for the Steiner Forest Problem in Doubling Metrics, FOCS 2016
  • Yossi Azar, Niv Buchbinder, T-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph (Seffi) Naor, Debmalya Panigrahi, Online Algorithms for Covering and Packing Problems with Convex Objectives, FOCS 2016
  • T-H. Hubert Chan, Fei Chen, Shaofeng H.-C. Jiang, Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order, SODA 2015
  • T-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao, Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints, SODA 2014
  • T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon, New Doubling Spanners: Better and Simpler, ICALP 2013
  • T-H. Hubert Chan, Mingfei Li and Li Ning, Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree, ICALP 2012
  • Elaine Shi, T-H. Hubert Chan, Emil Stefanov, Mingfei Li, Oblivious RAM with O(log N ^ 3) Worst-Case Cost , Asiacrypt 2011
  • Elaine Shi, T-H. Hubert Chan, Eleanor Rieffel, Richard Chow, Dawn Song, Privacy-Preserving Aggregation of Time-Series Data, Network & Distributed System Security Symposium (NDSS) 2011
  • T-H. Hubert Chan, Elaine Shi and Dawn Song, Private and Continual Release of Statistics, ICALP 2010
  • Serge Abiteboul, T-H. Hubert Chan, Evgeny Kharlamov, Werner Nutt, and Pierre Senellart, Aggregate Queries for Discrete and Continuous Probabilistic XML, International Conference on Database Theory (ICDT) 2010
  • T-H. Hubert Chan and Khaled Elbassioni, A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics, SODA 2010
  • T.-H. Hubert Chan, Anupam Gupta, and Kunal Talwar, Ultra-low-dimensional Embeddings for Doubling Metrics , Journal of the ACM. 2010
  • T-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon Kleinberg, and Aleksandrs Slivkins, Metric Embeddings with Relaxed Guarantees, SIAM Journal on Computing. 2009
  • Elaine Shi, John Bethencourt, T-H. Hubert Chan, Dawn Song and Adrian Perrig, Multi-dimensional Range Query over Encrypted Data, IEEE Symposium on Security and Privacy 2007
  • Avrim Blum, T-H. Hubert Chan, and Mugizi Robert Rwebangira, A Random-Surfer Web-Graph Model, ANALCO 2006

Recent Research Grants

  • 2018/19. Private and I/O-Efficient Concurrent Data Structures and Parallel Algorithms. 17200418. (Hong Kong RGC)
  • 2017/18. Spectral Analysis and Optimization Problems in Directed Hypergraph Diffusion Processes. 17200817. (Hong Kong RGC)
  • 2016/17. Group Traveling Salesman Problems and Network Connectivity Problems on Fully Dynamic Metric Spaces with Bounded Growth. 17217716. (Hong Kong RGC)
  • 2015/16. Primal-Dual Mathematical Programming Methods for Online Matching Problems with Generalized Constraints. 17202715. (Hong Kong RGC)
  • 2014/15. Oblivious Matching Algorithms on Unknown (Hyper) Graphs. HKU17200214E. (Hong Kong UGC)
  • 2012/13. Privacy-Preserving Mechanisms on Multi-User Data in Ubiquitous Computing Environments. HKU719312E. (Hong Kong UGC Early Career Scheme)

Department of Computer Science
Rm 301 Chow Yei Ching Building
The University of Hong Kong
Pokfulam Road, Hong Kong

Copyright © Department of Computer Science, Faculty of Engineering, The University of Hong Kong. All rights reserved.

Privacy Policy
Don't have an account yet? Register Now!

Sign in to your account