Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Zhuo Diao
Observed name:
Diao, Zhuo
Institution:
Central University of Finance and Economics
Observed institutions:
Central University of Finance and Economics,
Chinese Academy of Sciences,
Academy of Mathematics and Systems Science
ORCID:
0000-0003-1729-5960
Observed ORCID:
0000-0003-1729-5960
OpenAlex ID:
A5044459160
Network Characterizations for Excluding Braess’s Paradox
2016
·
Xujin Chen
, Zhuo Diao
, et al.
·
Theory of Computing Systems
·
26
Excluding Braess’s Paradox in Nonatomic Selfish Routing
2015
·
Xujin Chen
, Zhuo Diao
, et al.
·
Lecture notes in computer science
·
19
Covering Triangles in Edge-Weighted Graphs
2018
·
Xujin Chen
, Zhuo Diao
, et al.
·
Theory of Computing Systems
·
8
Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
2016
·
Xujin Chen
, Zhuo Diao
, et al.
·
Lecture notes in computer science
·
7
PDF
Approximation Algorithms for Balancing Signed Graphs
2020
·
Zhuo Diao
, Zhongzheng Tang
·
Lecture notes in computer science
·
5
On the Vertex Cover Number of 3-Uniform Hypergraph
2020
·
Zhuo Diao
·
Journal of the Operations Research Society of China
·
4
PDF
Total Dual Integrality of Triangle Covering
2016
·
Xujin Chen
, Zhuo Diao
, et al.
·
Lecture notes in computer science
·
4
Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing
2016
·
Xujin Chen
, Zhuo Diao
·
Lecture notes in computer science
·
3
Characterizing the Extremal k-Girth Graphs on Feedback Vertex Set
2023
·
Zhong-Zheng Tang
, Zhuo Diao
·
Journal of the Operations Research Society of China
·
2
A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size
2022
·
Zian Chen
, Bin Chen
, et al.
·
Journal of Combinatorial Optimization
·
2
Approximation Algorithms on k-Correlation Clustering
2022
·
Zhong-Zheng Tang
, Zhuo Diao
·
Journal of the Operations Research Society of China
·
2
Approximation Algorithms on k-Cycle Transversal and k-Clique Transversal
2021
·
Zhong-Zheng Tang
, Zhuo Diao
·
Journal of the Operations Research Society of China
·
2
Some Combinatorial Algorithms on the Independent Number of k-Regular Connected Hypergraphs
2025
·
Zhuo Diao
, Haoyang Zou
·
Lecture notes in computer science
·
1
On the Transversal Number of k-Uniform Connected Hypergraphs
2022
·
Zian Chen
, Bin Chen
, et al.
·
Lecture notes in computer science
·
1
Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
2022
·
Zhongzheng Tang
, Yucong Tang
, et al.
·
Journal of Combinatorial Optimization
·
1
On the Transversal Number of Rank k Hypergraphs
2022
·
Zhongzheng Tang
, Zhuo Diao
·
Lecture notes in computer science
·
1
On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs
2021
·
Zhongzheng Tang
, Yucong Tang
, et al.
·
Lecture notes in computer science
·
1
Packing and Covering Triangles in Dense Random Graphs
2020
·
Zhongzheng Tang
, Zhuo Diao
·
Lecture notes in computer science
·
1
On the feedback number of 3-uniform hypergraph
2018
·
Diao, Zhuo
, Tang, Zhongzheng
·
arXiv (Cornell University)
·
1
PDF
The feasibility of computer games in learning theory based subjects
2014
·
Zhuo Diao
, Yuan Gao
·
DiVA (University of Gävle)
·
1
A new form of Gallai theorem on regular hypergraphs
2026
·
Zhongzheng Tang
, Haoyang Zou
, et al.
·
Journal of Combinatorial Optimization
Some sharp upper bounds on the eliminating feedback number of regular hypergraphs
2026
·
Zhongzheng Tang
, Haoyang Zou
, et al.
·
Journal of Computer and System Sciences
A simple approximation algorithm for k-correlation clustering on uniform hypergraphs
2026
·
Zhongzheng Tang
, Yaxuan Li
, et al.
·
Theoretical Computer Science
Some Combinatorial Algorithms on the Eliminating Edge Feedback Number of Hypergraphs
2026
·
Zhongzheng Tang
, Haoyang Zou
, et al.
·
Lecture notes in computer science
A sharp upper bound for the edge dominating number of hypergraphs with minimum degree
2025
·
Zhongzheng Tang
, Zhuo Diao
·
Journal of Combinatorial Optimization
Show more works
View as search
Works count:
34
Citation count:
92
H-index:
5
I10-index:
2
Year
Topic
Type