default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXudong Yuan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Rongzhuo Long
, Ziyu Guo, Da Han, Boxiang Liu, Xudong Yuan, Guangyong Chen, Pheng-Ann Heng, Liang Zhang:
siRNADiscovery: a graph neural network for siRNA efficacy prediction via deep RNA sequence analysis. Briefings Bioinform. 25(6) (2024)- [j15]Yinlong Zhang, Wei Liang, Xudong Yuan, Sichao Zhang, Geng Yang, Ziming Zeng:
Deep Learning-Based Abnormal Behavior Detection for Elderly Healthcare Using Consumer Network Cameras. IEEE Trans. Consumer Electron. 70(1): 2414-2422 (2024) - 2022
- [j14]Yinlong Zhang, Xiaoyan Zheng, Wei Liang, Sichao Zhang, Xudong Yuan:
Visual Surveillance for Human Fall Detection in Healthcare IoT. IEEE Multim. 29(1): 36-46 (2022) - [c1]Xudong Yuan:
Dynamic Scene Deblurring Using Deep Learning. ICISCAE 2022: 1009-1015 - 2020
- [j13]Hui Hong, Jinchi Jiang, Xudong Yuan, Shiyu Ji, Shan Keke, Guodong Su:
A low-power high-output-efficiency bipolar Colpitts VCO using base inductive feedback and Q-factor enhancement for analog signal acquisition. IEICE Electron. Express 17(7): 20200036 (2020)
2010 – 2019
- 2014
- [j12]Xudong Yuan, Yuanwei Jing:
Research for AQM based on MiniMax method. Neural Comput. Appl. 25(7-8): 1755-1760 (2014) - 2011
- [j11]Xudong Yuan, Tingting Li, Jianji Su:
The Vertices of Lower Degree in Contraction-Critical k-Connected Graphs. Ars Comb. 98: 113-127 (2011)
2000 – 2009
- 2009
- [j10]Xudong Yuan:
A note on fragments in a locally k-critical n-connected graph. Ars Comb. 93 (2009) - 2008
- [j9]Moo Young Sohn, Xudong Yuan:
i?(1)-perfect graphs with girth at least six. Ars Comb. 87 (2008) - [j8]Chengfu Qin, Xudong Yuan, Jianji Su:
Some properties of contraction-critical 5-connected graphs. Discret. Math. 308(23): 5742-5756 (2008) - [j7]Min Li, Xudong Yuan, Jianji Su:
The number of vertices of degree 7 in a contraction-critical 7-connected graph. Discret. Math. 308(24): 6262-6268 (2008) - 2006
- [j6]Jianji Su, Xudong Yuan:
A new degree sum condition for the existence of a contractible edge in a kappa-connected graph. J. Comb. Theory B 96(2): 276-295 (2006) - 2005
- [j5]Chengfu Qin, Xudong Yuan, Jianji Su:
Triangles in contraction critical 5-connected graphs. Australas. J Comb. 33: 139-146 (2005) - [j4]Jianji Su, Xudong Yuan:
Contractible Edges in 7-Connected Graphs. Graphs Comb. 21(4): 445-457 (2005) - 2000
- [j3]Xudong Yuan, Mao-cheng Cai:
Vertices of degree k in a minimally k-edge-connected digraph. Discret. Math. 218(1-3): 293-298 (2000) - [j2]Xudong Yuan, Liying Kang, Mao-cheng Cai:
The number of vertices of degree k in a minimally k-edge-connected digraph. J. Graph Theory 33(2): 94-108 (2000)
1990 – 1999
- 1999
- [j1]Minyong Shi, Xudong Yuan, Mao-cheng Cai, Odile Favaron:
(3, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15(4): 463-471 (1999)
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-12-02 21:28 CET 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:
