Xiaoyun Lu

Orcid: 0000-0001-9602-379X

According to our database1, Xiaoyun Lu authored at least 28 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Influencing Factors Analysis and Prediction Model Development of Stroke: The Machine Learning Approach.
J. Inf. Knowl. Manag., February, 2023

Rare Association Rule Mining Based on Reinforcement Learning.
Proceedings of the 2023 12th International Conference on Computing and Pattern Recognition, 2023

2021
The Clinicopathologic and Prognostic Significance of c-Myc Expression in Hepatocellular Carcinoma: A Meta-Analysis.
Frontiers Bioinform., 2021

2020
On king-serf pair in tournaments.
Discret. Math., 2020

A Novel Three-Phase LINMAP Method for Hybrid Multi-Criteria Group Decision Making With Dual Hesitant Fuzzy Truth Degrees.
IEEE Access, 2020

2019
A Note on Min-Max Pair in Tournaments.
Graphs Comb., 2019

2018
On Min-Max Pair in Tournaments.
Graphs Comb., 2018

2016
A new proof that 4-connected planar graphs are Hamiltonian-connected.
Discuss. Math. Graph Theory, 2016

2011
A note on Barnette's conjecture.
Discret. Math., 2011

2010
A note on 3-connected cubic planar graphs.
Discret. Math., 2010

2009
System optimization in the control of heavy duty vehicle braking sub-systems.
Proceedings of the 48th IEEE Conference on Decision and Control, 2009

2000
Rooted Spanning Trees in Tournaments.
Graphs Comb., 2000

On the bounded domination number of tournaments.
Discret. Math., 2000

1999
On <i>k</i>-ary spanning trees of tournaments.
J. Graph Theory, 1999

The strong Hall property and symmetric chain orders.
Discret. Math., 1999

1998
Star-factors of tournaments.
J. Graph Theory, 1998

On avoidable and unavoidable claws.
Discret. Math., 1998

1996
On avoidable and unavoidable trees.
J. Graph Theory, 1996

1995
A Hamiltonian game on K<sub>n, n</sub>.
Discret. Math., 1995

A Note on Biased and Non-biased Games.
Discret. Appl. Math., 1995

Hamiltonian Cycles in Bipartite Graphs.
Comb., 1995

1994
A chvátal-erdős type condition for hamiltonian graphs.
J. Graph Theory, 1994

1993
Claws contained in all n-tournaments.
Discret. Math., 1993

1992
Hamiltonian games.
J. Comb. Theory, Ser. B, 1992

A characterization on n-critical economical generalized tic-tac-toe games.
Discret. Math., 1992

1991
A matching game.
Discret. Math., 1991

On claws belonging to every tournament.
Comb., 1991

1990
On the maximum induced forests of a connected cubic graph without triangles.
Discret. Math., 1990


  Loading...