Yuansheng Yang

Orcid: 0000-0003-4024-9030

According to our database1, Yuansheng Yang authored at least 98 papers between 1994 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes.
J. Graph Theory, 2022

2021
Italian domination in the Cartesian product of paths.
J. Comb. Optim., 2021

2019
Fault-Tolerant Panconnectivity of Augmented Cubes AQn.
Int. J. Found. Comput. Sci., 2019

Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks THLNs.
CoRR, 2019

Bagging Approach for Italian Domination in $C_{n} \square\, P_{m}$.
IEEE Access, 2019

2018
A feature selection method based on effective range and SVM-RFE.
Int. J. Wirel. Mob. Comput., 2018

The crossing number of locally twisted cubes LTQn.
Discret. Appl. Math., 2018

The Feedback Number of Knodel graph W3, n.
Ars Comb., 2018

On the total signed domination number of P<sub>m</sub> [square] C<sub>n</sub>.
Ars Comb., 2018

Fault-Tolerant Hamiltonian Connectivity of Twisted Hypercube-Like Networks THLNs.
IEEE Access, 2018

2017
On the total signed domination number of the Cartesian product of paths.
Contributions Discret. Math., 2017

The crossing number of pancake graph P<sub>4</sub> is six.
Ars Comb., 2017

An upper bound for the crossing number of locally twisted cubes.
Ars Comb., 2017

2015
Decycling bubble sort graphs.
Discret. Appl. Math., 2015

The decycling number of generalized Petersen graphs.
Discret. Appl. Math., 2015

On the Domination Number of Generalized Petersen Graphs P(ck, k).
Ars Comb., 2015

Ensemble unsupervised feature selection based on permutation and R-value.
Proceedings of the 12th International Conference on Fuzzy Systems and Knowledge Discovery, 2015

2014
Erratum to: Some Graphs with Double Domination Subdivision Number Three.
Graphs Comb., 2014

Some Graphs with Double Domination Subdivision Number Three.
Graphs Comb., 2014

Feedback Number of Generalized Kautz Digraphs GK(2, n).
Ars Comb., 2014

2013
The crossing number of the generalized Petersen graph <i>P</i>(10, 3) is six.
Int. J. Comput. Math., 2013

An upper bound for the crossing number of augmented cubes.
Int. J. Comput. Math., 2013

Roman domination number of Generalized Petersen Graphs P(n, 2).
Ars Comb., 2013

L(2, 1)-labeling of flower snark and related graphs.
Ars Comb., 2013

Prime labeling on Knödel graphs W<sub>3, n</sub>.
Ars Comb., 2013

2012
The crossing numbers of K<sub>m</sub> × P<sub>n</sub> and K<sub>m</sub> × C<sub>n</sub>
CoRR, 2012

The crossing number of the generalized Petersen graph P(10, 3) is six
CoRR, 2012

The crossing numbers of K<sub>n,n</sub> - nK<sub>2</sub>, K<sub>n</sub> × P<sub>2</sub>, K<sub>n</sub> × P<sub>3</sub> and K<sub>n</sub> × C<sub>4</sub>
CoRR, 2012

An upper bound for the crossing number of bubble-sort graph Bn
CoRR, 2012

On the Packing Number of Generalized Petersen Graphs P(n, 2).
Ars Comb., 2012

Prime Cordial labeling of Flower Snark and related graphs.
Ars Comb., 2012

Hamiltonian Properties of the 3-(γ, 2)-Critical Graphs.
Ars Comb., 2012

An Extended ISOMAP by Enhancing Similarity for Clustering.
Proceedings of the Advanced Research in Applied Artificial Intelligence, 2012

2011
On the distance paired domination of generalized Petersen graphs <i>P</i>(<i>n</i>, 1) and <i>P</i>(<i>n</i>, 2).
J. Comb. Optim., 2011

Fault-tolerant edge-pancyclicity of locally twisted cubes.
Inf. Sci., 2011

Radio number of ladder graphs.
Int. J. Comput. Math., 2011

Feasibility study of software reengineering towards role-based access control.
Int. J. Comput. Appl. Technol., 2011

Using ontology to generate test cases for GUI testing.
Int. J. Comput. Appl. Technol., 2011

Voting-Based Ensemble Classifiers to Detect Hedges and Their Scopes in Biomedical Texts.
IEICE Trans. Inf. Syst., 2011

The Crossing Numbers of Cartesian Product of Cone Graph C<sub>m</sub> + K<sub>l</sub> with Path P<sub>n</sub>.
Ars Comb., 2011

Skolem-Gracefulness of k-Stars.
Ars Comb., 2011

A lower bound for 2-rainbow domination number of generalized Petersen graphs P(n, 3).
Ars Comb., 2011

On the Domination Number of the Circulant Graphs C(n;{1, 2}), C(n;{1, 3}) and C(n;{1, 4}).
Ars Comb., 2011

The Connected Domination and Tree Domination of P(n, k) for k = 1, 2, [n/2].
Ars Comb., 2011

Detecting hedges scope based on phrase structures and dependency structures.
Proceedings of the 7th International Conference on Natural Language Processing and Knowledge Engineering, 2011

Combining Syntactic and Semantic Features by SVM for Unrestricted Coreference Resolution.
Proceedings of the Fifteenth Conference on Computational Natural Language Learning: Shared Task, 2011

2010
Recursive Feature Selection Based on Minimum Redundancy Maximum Relevancy.
Proceedings of the Third International Symposium on Parallel Architectures, 2010

Exploiting Multi-Features to Detect Hedges and their Scope in Biomedical Texts.
Proceedings of the Fourteenth Conference on Computational Natural Language Learning: Shared Task, 2010

2009
On the domination number of generalized Petersen graphs P(n, 2).
Discret. Math., 2009

Roman domination in regular graphs.
Discret. Math., 2009

2-rainbow domination of generalized Petersen graphs P(n, 2).
Discret. Appl. Math., 2009

Equitable total coloring of C<sub>m</sub>C<sub>n</sub>.
Discret. Appl. Math., 2009

The crossing numbers of generalized Petersen graphs with small order.
Discret. Appl. Math., 2009

On the Crossing Numbers of the k-th Power of P<sub>n</sub>.
Ars Comb., 2009

The Graphs C<sup>(t)</sup><sub>13</sub> are Graceful for t = 0, 3 (mod 4).
Ars Comb., 2009

(d, 1)-Total labellings of regular nonbipartite graphs and an application to flower snarks.
Ars Comb., 2009

The Connected and Tree Domination Number of P(n, k) for k = 4, 6, 8.
Ars Comb., 2009

An Effective Approach for Multicast on Multi-core Architecture.
Proceedings of the International Conference on Scalable Computing and Communications / Eighth International Conference on Embedded Computing, 2009

An Ontology-Based Approach for GUI Testing.
Proceedings of the 33rd Annual IEEE International Computer Software and Applications Conference, 2009

2008
The crossing number of K<sub>2, m</sub>P<sub>n</sub>.
Discret. Math., 2008

The planar Ramsey number <i>I</i>.
Discret. Math., 2008

Domination dot-critical graphs with no critical vertices.
Discret. Math., 2008

On the crossing numbers of K<sub>m</sub>square C<sub>n</sub> and K<sub>m, l</sub>square P<sub>n</sub>.
Discret. Appl. Math., 2008

A note on the signed edge domination number in graphs.
Discret. Appl. Math., 2008

The crossing number of flower snarks and related graphs.
Ars Comb., 2008

Super Vertex-magic Total Labelings of W3, n.
Ars Comb., 2008

One edge union of k shell graphs is cordial.
Ars Comb., 2008

The planar Ramsey numbers PR(K4-e, Kk-e).
Ars Comb., 2008

The Graphs C(t)11 are Graceful for t = 0, 1 (mod 4).
Ars Comb., 2008

On (a, d)-Antimagic Labelings of Generalized Petersen Graphs P(n, 3).
Ars Comb., 2008

An Improved Random Walk Algorithm Based on Correlation Coefficient to Find Scientific Communities.
Proceedings of the International Conference on Computer Science and Software Engineering, 2008

2007
On the Crossing Number of <i>K</i> <sub> <i>m</i> </sub> <i>P</i> <sub> <i>n</i> </sub>.
Graphs Comb., 2007

The planar Ramsey number PR(K<sub>4</sub>-e, K<sub>5</sub>).
Discret. Math., 2007

The Graphs C(t)9 are Graceful for t = 0, 3 (mod 4).
Ars Comb., 2007

On the Three Color Ramsey Numbers R(Cm, C4, C4).
Ars Comb., 2007

On Multicolor Ramsey Numbers for Even Cycles in Graphs.
Ars Comb., 2007

Super Edge-Magic Labelings of Generalized Petersen Graphs P(n, 3).
Ars Comb., 2007

On the Domination Number of Generalized Petersen Graphs P(n, 3).
Ars Comb., 2007

2006
New Lower Bounds on the Multicolor Ramsey Numbers <i>R</i><sub><i>r</i></sub>(<i>C</i><sub>2</sub><sub><i>m</i></sub>).
Graphs Comb., 2006

The face pair of planar graphs.
Discret. Math., 2006

The Graphs C(t)7 are Graceful for t = 0, 1, (mod 4).
Ars Comb., 2006

Hybrid Models for Chinese Named Entity Recognition.
Proceedings of the Fifth Workshop on Chinese Language Processing, 2006

2005
Some 3-connected 4-edge-critical non-Hamiltonian graphs.
J. Graph Theory, 2005

The Crossing Number of <i>C</i>(<i>mk</i>;{1, <i>k</i>}).
Graphs Comb., 2005

On Harmonious Labelings of the Balanced Quadruple Shells.
Ars Comb., 2005

The Graphs C(t)5 are Graceful for t = 0, 3 (mod 4).
Ars Comb., 2005

2004
The crossing number of <i>C</i>(<i>n</i>; 1, 3 ).
Discret. Math., 2004

Identifying Pronunciation-Translated Names from Chinese Texts Based on Support Vector Machines.
Proceedings of the Advances in Neural Networks, 2004

Maximizing Battery Life Routing in Wireless Ad Hoc Networks.
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004

2003
4-regular graphs without cut-vertices having the same path layer matrix.
J. Graph Theory, 2003

The minimum number of vertices with girth 6 and degree set <i>D</i>={<i>r, m</i>}.
Discret. Math., 2003

2002
Small regular graphs having the same path layer matrix.
J. Graph Theory, 2002

Three forbidden subgraphs for line graphs.
Discret. Math., 2002

2000
On Kotzig's conjecture concerning graphs with a unique regular path-connectivity.
Discret. Math., 2000

1997
On distinct distance sets in a graph.
Discret. Math., 1997

On Smallest Maximally Nonhamiltonian Graphs.
Ars Comb., 1997

1995
The ramsey number <i>r</i>(<i>k</i><sub>1</sub> + <i>c</i><sub>4</sub>, <i>k</i><sub>5</sub> - <i>e</i>).
J. Graph Theory, 1995

1994
The third Ramsey numbers for graphs with at most four edges.
Discret. Math., 1994


  Loading...