default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaoqiang Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c9]Siu-Wing Cheng, Haoqiang Huang:
Fréchet Distance in Subquadratic Time. SODA 2025: 5100-5113- 2024
- [j4]Haoqiang Huang, Zihe Wang, Zhide Wei, Jie Zhang
:
Bounded incentives in manipulating the probabilistic serial rule. J. Comput. Syst. Sci. 140: 103491 (2024) - [j3]Yuchao Zhang, Haoqiang Huang, Ahmed M. Abdelmoniem, Gaoxiong Zeng, Chenyue Zheng, Xirong Que, Wendong Wang, Ke Xu:
FLAIR: A Fast and Low-Redundancy Failure Recovery Framework for Inter Data Center Network. IEEE Trans. Cloud Comput. 12(2): 737-749 (2024) - [c8]Haoqiang Huang, Zihe Wang, Zhide Wei, Jie Zhang:
Cost Minimization for Equilibrium Transition. AAAI 2024: 9765-9772 - [c7]Siu-Wing Cheng, Haoqiang Huang:
Solving Fréchet Distance Problems by Algebraic Geometric Methods. SODA 2024: 4502-4513 - [i5]Siu-Wing Cheng, Haoqiang Huang:
Fréchet Distance in Subquadratic Time. CoRR abs/2407.05231 (2024) - 2023
- [j2]Chi Zhang, Haisheng Tan, Haoqiang Huang, Zhenhua Han, Shaofeng H.-C. Jiang, Guopeng Li, Xiangyang Li:
Online Approximation Scheme for Scheduling Heterogeneous Utility Jobs in Edge Computing. IEEE/ACM Trans. Netw. 31(1): 352-365 (2023) - [c6]Haiyang Jiang, Yuchao Zhang, Haoqiang Huang, Lei Wang, Xirong Que, Zhuo Jiang, Wendong Wang:
FaCa: Fast Aware and Competition-Avoided Balancing for Data Center Network. ICA3PP (6) 2023: 39-58 - [c5]Siu-Wing Cheng, Haoqiang Huang:
Approximate Nearest Neighbor for Polygonal Curves Under Fréchet Distance. ICALP 2023: 40:1-40:18 - [c4]Siu-Wing Cheng, Haoqiang Huang:
Curve Simplification and Clustering under Fréchet Distance. SODA 2023: 1414-1432 - [c3]Haoqiang Huang, Yuchao Zhang, Ran Wang, Qiao Xiang, Wendong Wang, Xirong Que, Ke Xu:
FRAVaR: A Fast Failure Recovery Framework for Inter-DC Network. WCNC 2023: 1-6 - [i4]Siu-Wing Cheng, Haoqiang Huang:
Approximate Nearest Neighbor for Polygonal Curves under Fréchet Distance. CoRR abs/2304.14643 (2023) - [i3]Siu-Wing Cheng, Haoqiang Huang:
Solving Fréchet Distance Problems by Algebraic Geometric Methods. CoRR abs/2308.14569 (2023) - [i2]Haoqiang Huang, Zihe Wang, Zhide Wei, Jie Zhang:
Cost Minimization for Equilibrium Transition. CoRR abs/2312.07603 (2023) - 2022
- [j1]Mengjing Chen, Haoqiang Huang, Weiran Shen, Pingzhong Tang, Zihe Wang, Jie Zhang:
Optimal pricing policy design for selling cost-reducing innovation in Cournot games. Theor. Comput. Sci. 901: 62-86 (2022) - [i1]Siu-Wing Cheng, Haoqiang Huang:
Curve Simplification and Clustering under Fréchet Distance. CoRR abs/2207.07809 (2022) - 2020
- [c2]Chi Zhang, Haisheng Tan, Haoqiang Huang, Zhenhua Han, Shaofeng H.-C. Jiang, Nikolaos M. Freris, Xiang-Yang Li:
Online dispatching and scheduling of jobs with heterogeneous utilities in edge computing. MobiHoc 2020: 101-110
2010 – 2019
- 2019
- [c1]Liuyan Liu, Haoqiang Huang, Haisheng Tan, Wanli Cao, Panlong Yang, Xiang-Yang Li:
Online DAG Scheduling with On-Demand Function Configuration in Edge Computing. WASA 2019: 213-224
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 2025-01-31 23:41 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:
