( en | de | ru )

 

Disambiguation of "Diao, Zhuo"

Author of the publication

copydeleteadd this publication to your clipboard
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles.

, , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 266-277. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Xunxing Diao

Xinping Zhuo

Zhuo Tang

Zhuo Li

Linan Diao

 

Other publications of authors with the same name

Covering Triangles in Edge-Weighted Graphs., , , and . Theory Comput. Syst., 62 (6): 1525-1552 (2018)Total Dual Integrality of Triangle Covering., , , and . COCOA, volume 10043 of Lecture Notes in Computer Science, page 128-143. Springer, (2016)Packing and Covering Triangles in Dense Random Graphs., and . COCOA, volume 12577 of Lecture Notes in Computer Science, page 426-439. Springer, (2020)Some Combinatorial Algorithms on the Edge Cover Number of k-Regular Connected Hypergraphs., , and . TAMC, volume 14637 of Lecture Notes in Computer Science, page 284-295. Springer, (2024)On the Transversal Number of Rank k Hypergraphs., and . FAW, volume 13461 of Lecture Notes in Computer Science, page 162-175. Springer, (2022)On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree., , and . IJTCS-FAW, volume 13933 of Lecture Notes in Computer Science, page 71-84. Springer, (2023)Approximation Algorithms for Balancing Signed Graphs., and . AAIM, volume 12290 of Lecture Notes in Computer Science, page 399-410. Springer, (2020)On the Transversal Number of k-Uniform Connected Hypergraphs., , , and . AAIM, volume 13513 of Lecture Notes in Computer Science, page 376-387. Springer, (2022)A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size., , , and . J. Comb. Optim., 45 (1): 37 (2023)Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing., and . COCOON, volume 9797 of Lecture Notes in Computer Science, page 27-38. Springer, (2016)