default search action
Yunshu Gao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Qian Yang
, Yunshu Gao:
Near packings with restriction on degrees in graphs. Appl. Math. Comput. 477: 128828 (2024) - [c5]Huiyan Lin, Yunshu Gao, Heng Li, Xiaotian Zhang, Xiangyang Yu, Jianwen Chen, Jiang Liu:
Aggregation Strategy with Gradient Projection for Federated Learning in Diagnosis. ICIC (LNBI 1) 2024: 207-218 - 2023
- [j17]Hui Li, Yunshu Gao:
Placing Two Edge-disjoint Copies of a Tree into a Bipartite Graph. Appl. Math. Comput. 452: 128045 (2023) - 2022
- [j16]Zhihong He
Disjoint Cycles of Different Lengths in 3-Regular Digraphs. Graphs Comb. 38(3): 74 (2022) - [j15]Yuzhen Qi, Zhilan Wang, Yunshu Gao, Jin Yan:
Cycle Extendability in Extended Tournaments. Graphs Comb. 38(4): 108 (2022) - [c4]Haofeng Liu, Heng Li, Huazhu Fu
Degradation-Invariant Enhancement of Fundus Images via Pyramid Constraint Network. MICCAI (2) 2022: 507-516 - [i1]Haofeng Liu
Degradation-invariant Enhancement of Fundus Images via Pyramid Constraint Network. CoRR abs/2210.09606 (2022) - 2021
- [j14]Yunshu Gao
Disjoint directed cycles with specified lengths in directed bipartite graphs. Discret. Math. 344(4): 112276 (2021) - 2020
- [j13]Yunshu Gao, Xue Wang
The edge condition for independent cycles with chords in bipartite graphs. Appl. Math. Comput. 377: 125163 (2020)
2010 – 2019
- 2019
- [j12]Yunshu Gao, Xiaoyao Lin, Hong Wang:
Vertex-disjoint double chorded cycles in bipartite graphs. Discret. Math. 342(9): 2482-2492 (2019) - 2017
- [j11]Yunshu Gao, Lingxiu Wu:
The Extremal Function for Three Disjoint Theta Graphs. Ars Comb. 133: 37-49 (2017) - [j10]Yunshu Gao, Qingsong Zou, Liyan Ma:
Vertex-Disjoint Quadrilaterals in Multigraphs. Graphs Comb. 33(4): 901-912 (2017) - [c3]Liqin Tan, Yunshu Gao:
The Analysis of Consumer Behavior of Fresh- products E-Business - Based on Research in Chengdu. WHICEB 2017: 47 - 2014
- [j9]Jin Yan, Yunshu Gao, Beibei Zhang:
Graph partition into small cliques. Discret. Appl. Math. 162: 322-327 (2014) - 2013
- [j8]Yunshu Gao, Guojun Li, Jin Yan:
Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs. Ars Comb. 109: 405-414 (2013) - [j7]Qingsong Zou, Guojun Li, Yunshu Gao:
Every Cycle-Connected Multipartite Tournament with δ ≥ 2 Contains At Least Two Universal Arcs. Graphs Comb. 29(4): 1141-1149 (2013) - [j6]Yunshu Gao, Guojun Li, Jin Yan:
Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs. Graphs Comb. 29(5): 1337-1345 (2013) - [j5]Yunshu Gao, Ding Ma:
Disjoint cycles with different length in 4-arc-dominated digraphs. Oper. Res. Lett. 41(6): 650-653 (2013) - [c2]Ding Ma, Yunshu Gao:
Disjoint Small Cycles in Graphs and Bipartite Graphs. FAW-AAIM 2013: 4-11 - 2011
- [j4]Yunshu Gao, Jin Yan, Guojun Li:
On 2-Factors with Chorded Quadrilaterals in Graphs. Ars Comb. 98: 193-201 (2011) - [j3]Yunshu Gao, Guojun Li:
On the Maximum Number of Disjoint Chorded Cycles in Graphs. Ars Comb. 98: 415-422 (2011) - 2010
- [j2]Shuya Chiba, Shinya Fujita, Yunshu Gao, Guojun Li:
On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs. Graphs Comb. 26(2): 173-186 (2010)
2000 – 2009
- 2009
- [j1]Yunshu Gao, Guojun Li, Xuechao Li:
Degree condition for the existence of a k-factor containing a given Hamiltonian cycle. Discret. Math. 309(8): 2373-2381 (2009) - 2008
- [c1]Yunshu Gao, Guojun Li, Jonathan Z. Sun, Jin Yan:
Disjoint Cycles and Chorded Cycles in Graphs. FCS 2008: 9-13
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-10 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: