Huan Li

Orcid: 0000-0002-7840-1053

Affiliations:
  • University of Pennsylvania, Department of Computer and Information Science, Philadelphia, PA, USA
  • Fudan University, School of Computer Science / Shanghai Key Laboratory of Intelligent Information Processing, China


According to our database1, Huan Li authored at least 23 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Resistance distances in directed graphs: Definitions, properties, and applications.
Theor. Comput. Sci., 2024

Detecting Low-Degree Truncation.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
On Regularity Lemma and Barriers in Streaming and Dynamic Matching.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Nearly Tight Bounds for Discrete Search under Outlier Noise.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Sublinear Algorithms for Hierarchical Clustering.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On Weighted Graph Sparsification by Linear Sketching.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Approximate optimization of convex functions with outlier noise.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Maximizing the Number of Spanning Trees in a Connected Graph.
IEEE Trans. Inf. Theory, 2020

An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Hermitian matrices for clustering directed graphs: insights and applications.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Consensus in Self-Similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence.
IEEE Trans. Cybern., 2019

Current Flow Group Closeness Centrality for Complex Networks?
Proceedings of the World Wide Web Conference, 2019

Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket.
Theor. Comput. Sci., 2018

Extended Corona Product as an Exactly Tractable Model for Weighted Heterogeneous Networks.
Comput. J., 2018

Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Biharmonic Distance Related Centrality for Edges in Weighted Networks.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Spectral Subspace Sparsification.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph.
Theor. Comput. Sci., 2017

Maximum matchings in scale-free networks with identical degree distribution.
Theor. Comput. Sci., 2017

Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs.
Theor. Comput. Sci., 2017

Effects of reciprocity on random walks in weighted networks.
CoRR, 2017


  Loading...