(See my DBLP
or Google Scholar
page for a full list)
Maximizing the Number of Spanning Trees in a Connected Graph.
Huan Li, Stacy Patterson, Yuhao Yi, and Zhongzhi Zhang.
IEEE Transactions on Information Theory (to appear). (arXiv).
Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem.
Huan Li, He Sun, and Luca Zanetti.
ESA 2019. (arXiv).
Maximizing Current Flow Closeness under Cardinality Constraints.
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).
Spectral Subspace Sparsification
- The University of Cambridge (October 2018).
Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks:
Nearly Linear Time Algorithms
- SODA 2018 (January 2018),
- Shanghai University of Finance and Economics (November 2017).