Huan Li (李寰)

 

Ph.D. student
Department of Computer and Information Science
University of Pennsylvania

Email:  huanli<at>cis<dot>upenn<dot>edu

I am a first-year PhD student in Computer and Information Science at University of Pennsylvania, co-advised by Profs. Anindya De and Sanjeev Khanna. My research interests lie in algorithms and lower bounds for combinatorial optimization. Previously, I obtained my bachelor's and master's degrees in Computer Science from Fudan University, where I was advised by Prof. Zhongzhi Zhang and worked on spectral graph theory and network science.

Selected Publications

(See my Google Scholar or DBLP page for a full list)

(Authors are ordered alphabetically unless stated otherwise)

  • An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs.
  • Anindya De, Sanjeev Khanna, Huan Li, and Hesam Nikpey.

    ICALP 2020. (arXiv).

  • Maximizing the Number of Spanning Trees in a Connected Graph.
  • Huan Li, Stacy Patterson, Yuhao Yi, and Zhongzhi Zhang.

    IEEE Trans. Information Theory 66(2): 1248-1260 (2020). (arXiv).

  • Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem.
  • Huan Li, He Sun, and Luca Zanetti.

    ESA 2019. (arXiv).

  • Current Flow Group Closeness Centrality for Complex Networks.
  • Huan Li, Richard Peng, Liren Shan, Yuhao Yi, and Zhongzhi Zhang.

    WWW 2019. (arXiv | Julia code).

  • Spectral Subspace Sparsification.
  • Huan Li and Aaron Schild.

    FOCS 2018. (arXiv).

  • Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms.
  • Huan Li and Zhongzhi Zhang.

    SODA 2018. (arXiv).

    Talks

  • An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs
  • Spectral Subspace Sparsification
  • Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms