default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuan Li 0002
Person information
- unicode name: 李寰
- affiliation: University of Pennsylvania, Department of Computer and Information Science, Philadelphia, PA, USA
- affiliation: Fudan University, School of Computer Science / Shanghai Key Laboratory of Intelligent Information Processing, China
Other persons with the same name
- Huan Li (aka: Hu'an Li) — disambiguation page
- Huan Li 0001 — Beihang University, Beijing, China (and 1 more)
- Huan Li 0003
![[0000-0003-0084-1662]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-0084-1662")
— Zhejiang University, Department of Computer Science and Technology, Hangzhou, China (and 1 more) - Huan Li 0004 — National Marine Data and Information Service, Tianjin, China (and 1 more)
- Huan Li 0005 — Chinese Academy of Sciences, Institute of Automation, Beijing, China
- Huan Li 0006 — Xidian University, School of Computer Science and Technology, Xi'an, China
- Huan Li 0007 — Nankai University, Institute of Robotics and Automatic Information System, Tianjin, China (and 2 more)
- Huan Li 0008 — Université de Technologie de Belfort-Montbéliard, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j8]Mingzhe Zhu, Liwang Zhu, Huan Li, Wei Li, Zhongzhi Zhang:
Resistance distances in directed graphs: Definitions, properties, and applications. Theor. Comput. Sci. 1009: 114700 (2024)- 2020
- [j7]Huan Li, Stacy Patterson, Yuhao Yi, Zhongzhi Zhang:
Maximizing the Number of Spanning Trees in a Connected Graph. IEEE Trans. Inf. Theory 66(2): 1248-1260 (2020) - 2019
- [j6]Yi Qi, Zhongzhi Zhang, Yuhao Yi, Huan Li:
Consensus in Self-Similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence. IEEE Trans. Cybern. 49(2): 592-603 (2019) - 2018
- [j5]Yi Qi, Huan Li, Zhongzhi Zhang:
Extended Corona Product as an Exactly Tractable Model for Weighted Heterogeneous Networks. Comput. J. 61(5): 745-760 (2018) - [j4]Liren Shan, Huan Li, Zhongzhi Zhang:
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. Theor. Comput. Sci. 720: 47-54 (2018) - 2017
- [j3]Huan Li, Zhongzhi Zhang:
Maximum matchings in scale-free networks with identical degree distribution. Theor. Comput. Sci. 675: 64-81 (2017) - [j2]Liren Shan, Huan Li, Zhongzhi Zhang:
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph. Theor. Comput. Sci. 677: 12-30 (2017) - [j1]Yujia Jin, Huan Li, Zhongzhi Zhang:
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs. Theor. Comput. Sci. 703: 37-54 (2017)
Conference and Workshop Papers
- 2024
- [c14]Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong:
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. SODA 2024: 3997-4061 - [c13]Anindya De, Huan Li, Shivam Nadimpalli, Rocco A. Servedio:
Detecting Low-Degree Truncation. STOC 2024: 1027-1038 - 2023
- [c12]Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li:
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. STOC 2023: 131-144 - 2022
- [c11]Yu Chen, Sanjeev Khanna, Huan Li:
On Weighted Graph Sparsification by Linear Sketching. FOCS 2022: 474-485 - [c10]Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil:
Sublinear Algorithms for Hierarchical Clustering. NeurIPS 2022 - [c9]Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
Nearly Tight Bounds for Discrete Search under Outlier Noise. SOSA 2022: 161-173 - 2021
- [c8]Anindya De, Sanjeev Khanna, Huan Li, MohammadHesam NikpeySalekde:
Approximate optimization of convex functions with outlier noise. NeurIPS 2021: 8147-8157 - 2020
- [c7]Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti:
Hermitian matrices for clustering directed graphs: insights and applications. AISTATS 2020: i - [c6]Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. ICALP 2020: 37:1-37:18 - 2019
- [c5]Huan Li, He Sun, Luca Zanetti:
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem. ESA 2019: 71:1-71:14 - [c4]Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang:
Current Flow Group Closeness Centrality for Complex Networks? WWW 2019: 961-971 - 2018
- [c3]Huan Li, Aaron Schild:
Spectral Subspace Sparsification. FOCS 2018: 385-396 - [c2]Yuhao Yi, Liren Shan, Huan Li, Zhongzhi Zhang:
Biharmonic Distance Related Centrality for Edges in Weighted Networks. IJCAI 2018: 3620-3626 - [c1]Huan Li, Zhongzhi Zhang:
Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms. SODA 2018: 2377-2396
Informal and Other Publications
- 2024
- [i20]Anindya De, Huan Li, Shivam Nadimpalli, Rocco A. Servedio:
Detecting Low-Degree Truncation. CoRR abs/2402.08133 (2024) - [i19]Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong:
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. CoRR abs/2402.14950 (2024) - 2023
- [i18]Mingzhe Zhu, Liwang Zhu, Huan Li, Wei Li, Zhongzhi Zhang:
Resistance Distances in Directed Graphs: Definitions, Properties, and Applications. CoRR abs/2302.04114 (2023) - 2022
- [i17]Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil:
Sublinear Algorithms for Hierarchical Clustering. CoRR abs/2206.07633 (2022) - [i16]Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li:
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR abs/2207.09354 (2022) - [i15]Yu Chen, Sanjeev Khanna, Huan Li:
On Weighted Graph Sparsification by Linear Sketching. CoRR abs/2209.07729 (2022) - 2020
- [i14]Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. CoRR abs/2006.12670 (2020) - 2019
- [i13]Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti:
Hermitian matrices for clustering directed graphs: insights and applications. CoRR abs/1908.02096 (2019) - 2018
- [i12]Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang:
Current Flow Group Closeness Centrality for Complex Networks. CoRR abs/1802.02556 (2018) - [i11]Liren Shan, Huan Li, Zhongzhi Zhang:
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. CoRR abs/1803.00829 (2018) - [i10]Huan Li, Stacy Patterson, Yuhao Yi, Zhongzhi Zhang:
Maximizing the Number of Spanning Trees in a Connected Graph. CoRR abs/1804.02785 (2018) - [i9]Huan Li, Aaron Schild:
Spectral Subspace Sparsification. CoRR abs/1810.03224 (2018) - [i8]Huan Li, He Sun, Luca Zanetti:
Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem. CoRR abs/1811.10909 (2018) - 2017
- [i7]Liren Shan, Huan Li, Zhongzhi Zhang:
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph. CoRR abs/1703.09023 (2017) - [i6]Huan Li, Zhongzhi Zhang:
Maximum matchings in scale-free networks with identical degree distribution. CoRR abs/1703.09041 (2017) - [i5]Zhongzhi Zhang, Huan Li, Yibin Sheng:
Effects of reciprocity on random walks in weighted networks. CoRR abs/1703.09117 (2017) - [i4]Huan Li, Zhongzhi Zhang:
Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms. CoRR abs/1708.05959 (2017) - [i3]Yujia Jin, Huan Li, Zhongzhi Zhang:
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs. CoRR abs/1709.04404 (2017) - [i2]Yi Qi, Huan Li, Zhongzhi Zhang:
Extended corona product as an exactly tractable model for weighted heterogeneous networks. CoRR abs/1709.04739 (2017) - [i1]Yi Qi, Zhongzhi Zhang, Yuhao Yi, Huan Li:
Consensus in Self-similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence. CoRR abs/1712.06496 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
