Effects of reciprocity on random walks in weighted networks. - Zhongzhi Zhang; Huan Li 002; Yibin Sheng (CoRR, 2017)

Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs. - Yujia Jin; Huan Li 002; Zhongzhi Zhang (Theor. Comput. Sci., 2017)

Maximum matchings in scale-free networks with identical degree distribution. - Huan Li 002; Zhongzhi Zhang (Theor. Comput. Sci., 2017)

Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph. - Liren Shan; Huan Li 002; Zhongzhi Zhang (Theor. Comput. Sci., 2017)

Spectral Subspace Sparsification. - Huan Li 002; Aaron Schild (FOCS, 2018)

Biharmonic Distance Related Centrality for Edges in Weighted Networks. - Yuhao Yi; Liren Shan; Huan Li 002; Zhongzhi Zhang (IJCAI, 2018)

Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms. - Huan Li 002; Zhongzhi Zhang (SODA, 2018)

Extended Corona Product as an Exactly Tractable Model for Weighted Heterogeneous Networks. - Yi Qi; Huan Li 002; Zhongzhi Zhang (Comput. J., 2018)

Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. - Liren Shan; Huan Li 002; Zhongzhi Zhang (Theor. Comput. Sci., 2018)

Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem. - Huan Li 002; He Sun 001; Luca Zanetti (ESA, 2019)

Current Flow Group Closeness Centrality for Complex Networks? - Huan Li 002; Richard Peng; Liren Shan; Yuhao Yi; Zhongzhi Zhang (WWW, 2019)

Consensus in Self-Similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence. - Yi Qi; Zhongzhi Zhang; Yuhao Yi; Huan Li 002 (IEEE Trans. Cybern., 2019)

Hermitian matrices for clustering directed graphs: insights and applications. - Mihai Cucuringu; Huan Li 002; He Sun 001; Luca Zanetti (AISTATS, 2020)

An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. - Anindya De; Sanjeev Khanna; Huan Li 002; Hesam Nikpey (ICALP, 2020)

Maximizing the Number of Spanning Trees in a Connected Graph. - Huan Li 002; Stacy Patterson; Yuhao Yi; Zhongzhi Zhang (IEEE Trans. Inf. Theory, 2020)

Approximate optimization of convex functions with outlier noise. - Anindya De; Sanjeev Khanna; Huan Li 002; MohammadHesam NikpeySalekde (NeurIPS, 2021)

On Weighted Graph Sparsification by Linear Sketching. - Yu Chen 039; Sanjeev Khanna; Huan Li 002 (FOCS, 2022)

Sublinear Algorithms for Hierarchical Clustering. - Arpit Agarwal; Sanjeev Khanna; Huan Li 002; Prathamesh Patil (NeurIPS, 2022)

Nearly Tight Bounds for Discrete Search under Outlier Noise. - Anindya De; Sanjeev Khanna; Huan Li 002; Hesam Nikpey (SOSA, 2022)

On Regularity Lemma and Barriers in Streaming and Dynamic Matching. - Sepehr Assadi; Soheil Behnezhad; Sanjeev Khanna; Huan Li 002 (STOC, 2023)

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. - Arpit Agarwal; Sanjeev Khanna; Huan Li 002; Prathamesh Patil; Chen Wang 027; Nathan White; Peilin Zhong (SODA, 2024)

Detecting Low-Degree Truncation. - Anindya De; Huan Li 002; Shivam Nadimpalli; Rocco A. Servedio (STOC, 2024)

Resistance distances in directed graphs: Definitions, properties, and applications. - Mingzhe Zhu; Liwang Zhu; Huan Li 002; Wei Li 055; Zhongzhi Zhang (Theor. Comput. Sci., 2024)

Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification. - Sanjeev Khanna; Huan Li 002; Aaron Putterman (STOC, 2025)