Zhuo Diao

Orcid: 0000-0003-1729-5960

According to our database1, Zhuo Diao authored at least 20 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size.
J. Comb. Optim., 2023

On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree.
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

Some Combinatorial Algorithms on the Dominating Number of Anti-rank k Hypergraphs.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number.
J. Comb. Optim., 2022

Triangle packing and covering in dense random graphs.
J. Comb. Optim., 2022

On weak Pareto optimality of nonatomic routing networks.
J. Comb. Optim., 2022

On the Transversal Number of Rank k Hypergraphs.
Proceedings of the Frontiers of Algorithmic Wisdom, 2022

Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

On the Transversal Number of k-Uniform Connected Hypergraphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
Comparison of the influence of Martian and Earth's atmospheric environments on terahertz band electromagnetic waves.
Int. J. Commun. Syst., 2021

On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Packing and Covering Triangles in Dense Random Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2020

Approximation Algorithms for Balancing Signed Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2018
Covering Triangles in Edge-Weighted Graphs.
Theory Comput. Syst., 2018

Approximation algorithms on k-cycle covering and k-clique covering.
CoRR, 2018

2016
Network Characterizations for Excluding Braess's Paradox.
Theory Comput. Syst., 2016

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Total Dual Integrality of Triangle Covering.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Excluding Braess's Paradox in Nonatomic Selfish Routing.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015


  Loading...