default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaoyun Lu
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Yiling Liu, Jundong Tan, Shiliang Hu, Muzammal Hussain
, Chang Qiao, Yaoquan Tu, Xiaoyun Lu, Yang Zhou:
Dynamics Playing a Key Role in the Covalent Binding of Inhibitors to Focal Adhesion Kinase. J. Chem. Inf. Model. 64(15): 6053-6061 (2024)- [c3]Jialong Li, Chunjie Zhou, Shengjie Liu, Xiaoyun Lu:
A Distillation Network using Improved ConvLSTM for Video Anomaly Detection. CMLDS 2024: 50:1-50:5 - 2023
- [j26]Juhua Wu, Qide Zhang, Lei Tao, Xiaoyun Lu:
Influencing Factors Analysis and Prediction Model Development of Stroke: The Machine Learning Approach. J. Inf. Knowl. Manag. 22(1): 2250079:1-2250079:16 (2023) - [c2]Shengjie Liu, Chunjie Zhou, Jialong Li, Xiaoyun Lu:
Rare Association Rule Mining Based on Reinforcement Learning. ICCPR 2023: 79-86 - 2021
- [j25]Min Zhao, Xunlei Zhang, Haizhen Chen, Wenjing Zhao, Haiyan Yu, Xiaoyun Lu, Jianyun Zhou, Xudong Chen, Aiguo Shen:
The Clinicopathologic and Prognostic Significance of c-Myc Expression in Hepatocellular Carcinoma: A Meta-Analysis. Frontiers Bioinform. 1 (2021) - 2020
- [j24]Xiaoyun Lu, Jiuying Dong, Shuping Wan:
A Novel Three-Phase LINMAP Method for Hybrid Multi-Criteria Group Decision Making With Dual Hesitant Fuzzy Truth Degrees. IEEE Access 8: 112462-112483 (2020) - [j23]Xiaoyun Lu:
On king-serf pair in tournaments. Discret. Math. 343(7): 111903 (2020)
2010 – 2019
- 2019
- [j22]Xiaoyun Lu:
A Note on Min-Max Pair in Tournaments. Graphs Comb. 35(5): 1139-1145 (2019) - 2018
- [j21]Xiaoyun Lu:
On Min-Max Pair in Tournaments. Graphs Comb. 34(4): 613-618 (2018) - 2016
- [j20]Xiaoyun Lu, Douglas B. West:
A new proof that 4-connected planar graphs are Hamiltonian-connected. Discuss. Math. Graph Theory 36(3): 555-564 (2016) - 2011
- [j19]Xiaoyun Lu:
A note on Barnette's conjecture. Discret. Math. 311(23-24): 2711-2715 (2011) - 2010
- [j18]Xiaoyun Lu:
A note on 3-connected cubic planar graphs. Discret. Math. 310(13-14): 2054-2058 (2010)
2000 – 2009
- 2009
- [c1]Haijun Fang, Xiaoyun Lu, Jianbo Lu, Zongli Lin:
System optimization in the control of heavy duty vehicle braking sub-systems. CDC 2009: 3563-3568 - 2000
- [j17]Xiaoyun Lu, Da-Wei Wang, C. K. Wong:
On the bounded domination number of tournaments. Discret. Math. 220(1-3): 257-261 (2000) - [j16]Xiaoyun Lu, Da-Wei Wang, Jiaofeng Pan, C. K. Wong:
Rooted Spanning Trees in Tournaments. Graphs Comb. 16(4): 411-427 (2000)
1990 – 1999
- 1999
- [j15]Xiaoyun Lu, Da-Wei Wang, C. K. Wong:
The strong Hall property and symmetric chain orders. Discret. Math. 203(1-3): 161-168 (1999) - [j14]Xiaoyun Lu, Da-Wei Wang, Gerard J. Chang, In-Jen Lin, C. K. Wong:
On k-ary spanning trees of tournaments. J. Graph Theory 30(3): 167-176 (1999) - 1998
- [j13]Xiaoyun Lu, Da-Wei Wang, C. K. Wong:
On avoidable and unavoidable claws. Discret. Math. 184(1-3): 259-265 (1998) - [j12]Guantao Chen, Xiaoyun Lu, Douglas B. West:
Star-factors of tournaments. J. Graph Theory 28(3): 141-145 (1998) - 1996
- [j11]Xiaoyun Lu:
On avoidable and unavoidable trees. J. Graph Theory 22(4): 335-346 (1996) - 1995
- [j10]Xiaoyun Lu:
Hamiltonian Cycles in Bipartite Graphs. Comb. 15(2): 247-254 (1995) - [j9]Xiaoyun Lu:
A Note on Biased and Non-biased Games. Discret. Appl. Math. 60(1-3): 285-291 (1995) - [j8]Xiaoyun Lu:
A Hamiltonian game on Kn, n. Discret. Math. 142(1-3): 185-191 (1995) - 1994
- [j7]Xiaoyun Lu:
A chvátal-erdős type condition for hamiltonian graphs. J. Graph Theory 18(8): 791-800 (1994) - 1993
- [j6]Xiaoyun Lu:
Claws contained in all n-tournaments. Discret. Math. 119(1-3): 107-111 (1993) - 1992
- [j5]Xiaoyun Lu:
A characterization on n-critical economical generalized tic-tac-toe games. Discret. Math. 110(1-3): 197-203 (1992) - [j4]Xiaoyun Lu:
Hamiltonian games. J. Comb. Theory B 55(1): 18-32 (1992) - 1991
- [j3]Xiaoyun Lu:
On claws belonging to every tournament. Comb. 11(2): 173-179 (1991) - [j2]Xiaoyun Lu:
A matching game. Discret. Math. 94(3): 199-207 (1991) - 1990
- [j1]Maolin Zheng, Xiaoyun Lu:
On the maximum induced forests of a connected cubic graph without triangles. Discret. Math. 85(1): 89-96 (1990)
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 2025-01-21 00:02 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:
