default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhuo Diao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j9]Yasir Ahmad, Xiang-Feng Pan
, Umar Ali, Zhuo Diao:
Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains. Discret. Appl. Math. 361: 111-120 (2025)- 2024
- [c13]Zhongzheng Tang, Yaxuan Li, Zhuo Diao:
Some Combinatorial Algorithms on the Edge Cover Number of k-Regular Connected Hypergraphs. TAMC 2024: 284-295 - 2023
- [j8]Zhuo Diao, Xianfu Huang, Han Liu, Zhanwei Liu:
LE-YOLOv5: A Lightweight and Efficient Road Damage Detection Algorithm Based on Improved YOLOv5. Int. J. Intell. Syst. 2023: 1-17 (2023) - [j7]Zian Chen, Bin Chen, Zhongzheng Tang, Zhuo Diao:
A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size. J. Comb. Optim. 45(1): 37 (2023) - [c12]Zhuo Diao, Zhongzheng Tang:
Some Combinatorial Algorithms on the Dominating Number of Anti-rank k Hypergraphs. COCOA (2) 2023: 364-376 - [c11]Zhongzheng Tang, Haoyang Zou, Zhuo Diao:
On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree. IJTCS-FAW 2023: 71-84 - 2022
- [j6]Xujin Chen, Zhuo Diao, Xiao-Dong Hu:
On weak Pareto optimality of nonatomic routing networks. J. Comb. Optim. 44(3): 1705-1723 (2022) - [j5]Zhongzheng Tang, Zhuo Diao:
Triangle packing and covering in dense random graphs. J. Comb. Optim. 44(4): 3153-3164 (2022) - [j4]Zhongzheng Tang, Yucong Tang, Zhuo Diao:
Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number. J. Comb. Optim. 44(5): 3310-3330 (2022) - [c10]Zian Chen, Bin Chen, Zhongzheng Tang, Zhuo Diao:
On the Transversal Number of k-Uniform Connected Hypergraphs. AAIM 2022: 376-387 - [c9]Zhongzheng Tang, Zhuo Diao:
Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs. COCOON 2022: 325-332 - [c8]Zhongzheng Tang, Zhuo Diao:
On the Transversal Number of Rank k Hypergraphs. FAW 2022: 162-175 - 2021
- [j3]Zhuo Diao, Qingfeng Jing, Weizhi Zhong:
Comparison of the influence of Martian and Earth's atmospheric environments on terahertz band electromagnetic waves. Int. J. Commun. Syst. 34(12) (2021) - [c7]Zhongzheng Tang, Yucong Tang, Zhuo Diao:
On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs. COCOA 2021: 687-700 - 2020
- [c6]Zhuo Diao, Zhongzheng Tang:
Approximation Algorithms for Balancing Signed Graphs. AAIM 2020: 399-410 - [c5]Zhongzheng Tang, Zhuo Diao:
Packing and Covering Triangles in Dense Random Graphs. COCOA 2020: 426-439
2010 – 2019
- 2018
- [j2]Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang:
Covering Triangles in Edge-Weighted Graphs. Theory Comput. Syst. 62(6): 1525-1552 (2018) - [i2]Zhongzheng Tang, Zhuo Diao:
Approximation algorithms on k-cycle covering and k-clique covering. CoRR abs/1807.06867 (2018) - 2016
- [j1]Xujin Chen, Zhuo Diao, Xiaodong Hu:
Network Characterizations for Excluding Braess's Paradox. Theory Comput. Syst. 59(4): 747-780 (2016) - [c4]Xujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang:
Total Dual Integrality of Triangle Covering. COCOA 2016: 128-143 - [c3]Xujin Chen, Zhuo Diao:
Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing. COCOON 2016: 27-38 - [c2]Xujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang:
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles. IWOCA 2016: 266-277 - [i1]Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang:
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles. CoRR abs/1605.01816 (2016) - 2015
- [c1]Xujin Chen, Zhuo Diao, Xiao-Dong Hu:
Excluding Braess's Paradox in Nonatomic Selfish Routing. SAGT 2015: 219-230
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-07 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:
