Yuansheng Yang
Orcid: 0000-0003-4024-9030
According to our database1,
Yuansheng Yang
authored at least 98 papers
between 1994 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
J. Graph Theory, 2022
2021
2019
Int. J. Found. Comput. Sci., 2019
IEEE Access, 2019
2018
Int. J. Wirel. Mob. Comput., 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
IEEE Access, 2018
2017
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
On the Domination Number of Generalized Petersen Graphs P(ck, k).
Ars Comb., 2015
Proceedings of the 12th International Conference on Fuzzy Systems and Knowledge Discovery, 2015
2014
Graphs Comb., 2014
Feedback Number of Generalized Kautz Digraphs GK(2, n).
Ars Comb., 2014
2013
Int. J. Comput. Math., 2013
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 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
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
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
Int. J. Comput. Appl. Technol., 2011
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
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
Proceedings of the Third International Symposium on Parallel Architectures, 2010
Proceedings of the Fourteenth Conference on Computational Natural Language Learning: Shared Task, 2010
2009
Discret. Math., 2009
Discret. Appl. Math., 2009
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
Proceedings of the International Conference on Scalable Computing and Communications / Eighth International Conference on Embedded Computing, 2009
Proceedings of the 33rd Annual IEEE International Computer Software and Applications Conference, 2009
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
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 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 Graphs C(t)7 are Graceful for t = 0, 1, (mod 4).
Ars Comb., 2006
Proceedings of the Fifth Workshop on Chinese Language Processing, 2006
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
Identifying Pronunciation-Translated Names from Chinese Texts Based on Support Vector Machines.
Proceedings of the Advances in Neural Networks, 2004
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004
2003
J. Graph Theory, 2003
Discret. Math., 2003
2002
2000
Discret. Math., 2000
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