Yunshu Gao

Orcid: 0000-0001-5284-6217

According to our database1, Yunshu Gao authored at least 23 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Near packings with restriction on degrees in graphs.
Appl. Math. Comput., 2024

Aggregation Strategy with Gradient Projection for Federated Learning in Diagnosis.
Proceedings of the Advanced Intelligent Computing in Bioinformatics, 2024

2023
Placing Two Edge-disjoint Copies of a Tree into a Bipartite Graph.
Appl. Math. Comput., September, 2023

2022
Cycle Extendability in Extended Tournaments.
Graphs Comb., 2022

Disjoint Cycles of Different Lengths in 3-Regular Digraphs.
Graphs Comb., 2022

Degradation-Invariant Enhancement of Fundus Images via Pyramid Constraint Network.
Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2022, 2022

2021
Disjoint directed cycles with specified lengths in directed bipartite graphs.
Discret. Math., 2021

2020
The edge condition for independent cycles with chords in bipartite graphs.
Appl. Math. Comput., 2020

2019
Vertex-disjoint double chorded cycles in bipartite graphs.
Discret. Math., 2019

2017
Vertex-Disjoint Quadrilaterals in Multigraphs.
Graphs Comb., 2017

The Extremal Function for Three Disjoint Theta Graphs.
Ars Comb., 2017

The Analysis of Consumer Behavior of Fresh- products E-Business - Based on Research in Chengdu.
Proceedings of the 16th Wuhan International Conference on E-Business, 2017

2014
Graph partition into small cliques.
Discret. Appl. Math., 2014

2013
Disjoint cycles with different length in 4-arc-dominated digraphs.
Oper. Res. Lett., 2013

Every Cycle-Connected Multipartite Tournament with δ ≥ 2 Contains At Least Two Universal Arcs.
Graphs Comb., 2013

Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs.
Graphs Comb., 2013

Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs.
Ars Comb., 2013

Disjoint Small Cycles in Graphs and Bipartite Graphs.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2011
On 2-Factors with Chorded Quadrilaterals in Graphs.
Ars Comb., 2011

On the Maximum Number of Disjoint Chorded Cycles in Graphs.
Ars Comb., 2011

2010
On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs.
Graphs Comb., 2010

2009
Degree condition for the existence of a k-factor containing a given Hamiltonian cycle.
Discret. Math., 2009

2008
Disjoint Cycles and Chorded Cycles in Graphs.
Proceedings of the 2008 International Conference on Foundations of Computer Science, 2008


  Loading...