Yucong Tang

According to our database, Yucong Tang authored at least 12 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Anti-Ramsey Numbers of Loose Paths and Cycles in Uniform Hypergraphs.

Tong Li, Yucong Tang, Guanghui Wang, Guiying Yan

Graphs Comb., August, 2025

A Benders and Column Generation Method to Integrated Aircraft and Passenger Recovery with Cruise Speed Control Under Slot Capacity Restriction.

Jiajin Lin, Jianlin Jiang, Yucong Tang

Asia Pac. J. Oper. Res., August, 2025

2024

Anti-Ramsey number of disjoint union of star-like hypergraphs.

Yucong Tang, Tong Li, Guiying Yan

Discret. Math., April, 2024

Fully distributed adaptive cooperative output regulation of heterogeneous multi-agent systems with hybrid event-triggering mechanism.

Guanglei Zhao, Yucong Tang, Changchun Hua

Inf. Sci., 2024

Self-adaptive Multi-objective Differential Evolution for Feature Selection in Classification.

Shuyi Zhuang, Yucong Tang

Proceedings of the 6th International Conference on Internet of Things, 2024

2023

Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs.

Tong Li, Yucong Tang, Guiying Yan, Wenling Zhou

Discret. Math., September, 2023

2022

A New Estimation Method for the Biological Interaction Predicting Problems.

Lewei Zhou, Yucong Tang, Guiying Yan

IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Anti-Ramsey number of expansions of paths and cycles in uniform hypergraphs.

Yucong Tang, Tong Li, Guiying Yan

J. Graph Theory, 2022

Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number.

Zhongzheng Tang, Yucong Tang, Zhuo Diao

J. Comb. Optim., 2022

2021

On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs.

Zhongzheng Tang, Yucong Tang, Zhuo Diao

Proceedings of the Combinatorial Optimization and Applications, 2021

2017

An approximate ore-type result for tight Hamilton cycles in uniform hypergraphs.

Yucong Tang, Guiying Yan

Discret. Math., 2017

2015

On judicious partitions of hypergraphs with edges of size at most 3.

Yao Zhang, Yucong Tang, Guiying Yan

Eur. J. Comb., 2015