default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuansheng Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j82]Yuansheng Yang, Guoqing Wang
, Haoli Wang, Yan Zhou:
Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes. J. Graph Theory 100(3): 389-434 (2022)- 2021
- [j81]Hong Gao, Tingting Feng, Yuansheng Yang:
Italian domination in the Cartesian product of paths. J. Comb. Optim. 41(2): 526-543 (2021)
2010 – 2019
- 2019
- [j80]Hong Gao, Tingting Xu, Yuansheng Yang:
Bagging Approach for Italian Domination in $C_{n} \square\, P_{m}$. IEEE Access 7: 105224-105234 (2019) - [j79]Xirong Xu, Huifeng Zhang, Sijia Zhang, Yuansheng Yang:
Fault-Tolerant Panconnectivity of Augmented Cubes AQn. Int. J. Found. Comput. Sci. 30(8): 1247-1278 (2019) - [i6]Huifeng Zhang, Xirong Xu, Jing Guo, Yuansheng Yang:
Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks THLNs. CoRR abs/1906.05069 (2019) - 2018
- [j78]Huifeng Zhang, Xirong Xu, Jing Guo, Yuansheng Yang:
Fault-Tolerant Hamiltonian Connectivity of Twisted Hypercube-Like Networks THLNs. IEEE Access 6: 74081-74090 (2018) - [j77]Hong Gao, Huiping Cao, Yuansheng Yang:
On the total signed domination number of Pm [square] Cn. Ars Comb. 136: 3-19 (2018) - [j76]Sijia Zhang, Xirong Xu, Chun Yin, Yazhen Huang, Yuansheng Yang:
The Feedback Number of Knodel graph W3, n. Ars Comb. 140: 397-409 (2018) - [j75]Zhao Lingqi, Xirong Xu, Bai Siqin, Huifeng Zhang, Yuansheng Yang:
The crossing number of locally twisted cubes LTQn. Discret. Appl. Math. 247: 407-418 (2018) - [j74]Yifei Mao, Yuansheng Yang:
A feature selection method based on effective range and SVM-RFE. Int. J. Wirel. Mob. Comput. 15(2): 105-112 (2018) - 2017
- [j73]Yuansheng Yang, Bo Lv, Baigong Zheng, Xirong Xu, Ke Zhang:
The crossing number of pancake graph P4 is six. Ars Comb. 131: 43-53 (2017) - [j72]Haoli Wang, Xirong Xu, Yuansheng Yang, Bao Liu, Wenping Zheng, Guoqing Wang:
An upper bound for the crossing number of locally twisted cubes. Ars Comb. 131: 87-106 (2017) - [j71]Hong Gao, Huiping Cao, Yuansheng Yang:
On the total signed domination number of the Cartesian product of paths. Contributions Discret. Math. 12(2) (2017) - 2015
- [j70]Haoli Wang, Xirong Xu, Yuansheng Yang, Guoqing Wang:
On the Domination Number of Generalized Petersen Graphs P(ck, k). Ars Comb. 118: 33-49 (2015) - [j69]Liqing Gao, Xirong Xu, Jian Wang, Dejun Zhu, Yuansheng Yang:
The decycling number of generalized Petersen graphs. Discret. Appl. Math. 181: 297-300 (2015) - [j68]Jian Wang, Xirong Xu, Liqing Gao, Sijia Zhang, Yuansheng Yang:
Decycling bubble sort graphs. Discret. Appl. Math. 194: 178-182 (2015) - [c12]Xiaomei Wang, Xiaohui Lin, Xin Huang, Yuansheng Yang:
Ensemble unsupervised feature selection based on permutation and R-value. FSKD 2015: 795-800 - 2014
- [j67]Lei Wang, Xirong Xu, Yuansheng Yang, Di Ming, Xuezhi Dong:
Feedback Number of Generalized Kautz Digraphs GK(2, n). Ars Comb. 116: 147-160 (2014) - [j66]Haoli Wang, Xirong Xu, Yuansheng Yang, Baosheng Zhang:
Some Graphs with Double Domination Subdivision Number Three. Graphs Comb. 30(1): 247-251 (2014) - [j65]Haoli Wang, Xirong Xu, Yuansheng Yang, Baosheng Zhang:
Erratum to: Some Graphs with Double Domination Subdivision Number Three. Graphs Comb. 30(1): 253 (2014) - 2013
- [j64]Kh. Md. Mominul Haque, Xiaohui Lin, Yuansheng Yang, Pingzhong Zhao:
Prime labeling on Knödel graphs W3, n. Ars Comb. 109: 113-128 (2013) - [j63]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhengwei Hou:
L(2, 1)-labeling of flower snark and related graphs. Ars Comb. 110: 505-512 (2013) - [j62]Haoli Wang, Xirong Xu, Yuansheng Yang, Chunnian Ji:
Roman domination number of Generalized Petersen Graphs P(n, 2). Ars Comb. 112: 479-492 (2013) - [j61]Guoqing Wang, Haoli Wang, Yuansheng Yang, Xuezhi Yang, Wenping Zheng:
An upper bound for the crossing number of augmented cubes. Int. J. Comput. Math. 90(2): 183-227 (2013) - [j60]Yuansheng Yang, Baigong Zheng, Xirong Xu:
The crossing number of the generalized Petersen graph P(10, 3) is six. Int. J. Comput. Math. 90(7): 1373-1380 (2013) - 2012
- [j59]Yuansheng Yang, Xueliang Fu, Baoqi Jiang:
On the Packing Number of Generalized Petersen Graphs P(n, 2). Ars Comb. 104: 23-32 (2012) - [j58]Kh. Md. Mominul Haque, Xiaohui Lin, Yuansheng Yang, Jinbo Zhang:
Prime Cordial labeling of Flower Snark and related graphs. Ars Comb. 105: 45-52 (2012) - [j57]Chengye Zhao, Yuansheng Yang, Linlin Sun:
Hamiltonian Properties of the 3-(γ, 2)-Critical Graphs. Ars Comb. 107: 177-192 (2012) - [c11]Hong Yu, Xianchao Zhang, Yuansheng Yang, Xiaowei Zhao, Lei Cai:
An Extended ISOMAP by Enhancing Similarity for Clustering. IEA/AIE 2012: 808-815 - [i5]Baigong Zheng, Yuansheng Yang, Xirong Xu:
An upper bound for the crossing number of bubble-sort graph Bn. CoRR abs/1211.4433 (2012) - [i4]Yuansheng Yang, Baigong Zheng, Xiaohui Lin, Xirong Xu:
The crossing numbers of Kn,n - nK2, Kn × P2, Kn × P3 and Kn × C4. CoRR abs/1211.4437 (2012) - [i3]Yuansheng Yang, Baigong Zheng, Xirong Xu:
The crossing number of the generalized Petersen graph P(10, 3) is six. CoRR abs/1211.4438 (2012) - [i2]Yuansheng Yang, Baigong Zheng, Xirong Xu, Xiaohui Lin:
The crossing numbers of Km × Pn and Km × Cn. CoRR abs/1211.4641 (2012) - [i1]Yuansheng Yang, Bo Lv, Baigong Zheng, Xirong Xu, Ke Zhang:
The crossing number of pancake graph P4 is six. CoRR abs/1211.4642 (2012) - 2011
- [j56]Yue Xi, Yuansheng Yang, Xin-hong Meng:
Skolem-Gracefulness of k-Stars. Ars Comb. 98: 149-160 (2011) - [j55]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Xiwu Yang:
The Crossing Numbers of Cartesian Product of Cone Graph Cm + Kl with Path Pn. Ars Comb. 98: 433-335 (2011) - [j54]Chengye Zhao, Yuansheng Yang, Linlin Sun, Feilong Cao:
The Connected Domination and Tree Domination of P(n, k) for k = 1, 2, [n/2]. Ars Comb. 101: 467-479 (2011) - [j53]Xueliang Fu, Yuansheng Yang, Baoqi Jiang:
On the Domination Number of the Circulant Graphs C(n;{1, 2}), C(n;{1, 3}) and C(n;{1, 4}). Ars Comb. 102: 173-182 (2011) - [j52]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Baosheng Zhang, Xianchen Zheng:
A lower bound for 2-rainbow domination number of generalized Petersen graphs P(n, 3). Ars Comb. 102: 483-492 (2011) - [j51]Huiwei Zhou, Xiaoyan Li, Degen Huang, Yuansheng Yang, Fuji Ren:
Voting-Based Ensemble Classifiers to Detect Hedges and Their Scopes in Biomedical Texts. IEICE Trans. Inf. Syst. 94-D(10): 1989-1997 (2011) - [j50]Han Li, He Guo, Feng Chen, Hongji Yang, Yuansheng Yang:
Using ontology to generate test cases for GUI testing. Int. J. Comput. Appl. Technol. 42(2/3): 213-224 (2011) - [j49]Han Li, Hongji Yang, Feng Chen, He Guo, Yuansheng Yang:
Feasibility study of software reengineering towards role-based access control. Int. J. Comput. Appl. Technol. 42(2/3): 239-251 (2011) - [j48]Haoli Wang, Xirong Xu, Yuansheng Yang, Baosheng Zhang, Meiqin Luo, Guoqing Wang:
Radio number of ladder graphs. Int. J. Comput. Math. 88(10): 2026-2034 (2011) - [j47]Xirong Xu, Wenhua Zhai, Jun-Ming Xu, Aihua Deng, Yuansheng Yang:
Fault-tolerant edge-pancyclicity of locally twisted cubes. Inf. Sci. 181(11): 2268-2277 (2011) - [j46]Haoli Wang, Xirong Xu, Yuansheng Yang, Kai Lü:
On the distance paired domination of generalized Petersen graphs P(n, 1) and P(n, 2). J. Comb. Optim. 21(4): 481-496 (2011) - [c10]Huiwei Zhou, Yao Li, Degen Huang, Yan Zhang, Chunlong Wu, Yuansheng Yang:
Combining Syntactic and Semantic Features by SVM for Unrestricted Coreference Resolution. CoNLL Shared Task 2011: 66-70 - [c9]Huiwei Zhou, Xiaoyan Li, Degen Huang, Yuansheng Yang, Jianjun Ma:
Detecting hedges scope based on phrase structures and dependency structures. NLPKE 2011: 415-420 - 2010
- [j45]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhengwei Hou:
(d, 1)-Total labellings of regular nonbipartite graphs and an application to flower snarks. Ars Comb. 96 (2010) - [c8]Huiwei Zhou, Xiaoyan Li, Degen Huang, Zezhong Li, Yuansheng Yang:
Exploiting Multi-Features to Detect Hedges and their Scope in Biomedical Texts. CoNLL Shared Task 2010: 106-113 - [c7]Yuansheng Yang, Haiyan Li, Xiaohui Lin, Di Ming:
Recursive Feature Selection Based on Minimum Redundancy Maximum Relevancy. PAAP 2010: 281-285
2000 – 2009
- 2009
- [j44]Xirong Xu, Yuansheng Yang, Lizhong Han, Huijun Li:
The Graphs C(t)13 are Graceful for t = 0, 3 (mod 4). Ars Comb. 90 (2009) - [j43]Chengye Zhao, Yuansheng Yang, Shi Lei, Linlin Sun:
The Connected and Tree Domination Number of P(n, k) for k = 4, 6, 8. Ars Comb. 92 (2009) - [j42]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Gui Yang:
On the Crossing Numbers of the k-th Power of Pn. Ars Comb. 92 (2009) - [j41]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhengwei Hou:
(d, 1)-Total labellings of regular nonbipartite graphs and an application to flower snarks. Ars Comb. 93 (2009) - [j40]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhihe Li:
Equitable total coloring of CmCn. Discret. Appl. Math. 157(4): 596-601 (2009) - [j39]Xiaohui Lin, Yuansheng Yang, Wenping Zheng, Lei Shi, Weiming Lu:
The crossing numbers of generalized Petersen graphs with small order. Discret. Appl. Math. 157(5): 1016-1023 (2009) - [j38]Chunling Tong, Xiaohui Lin, Yuansheng Yang, Meiqin Luo:
2-rainbow domination of generalized Petersen graphs P(n, 2). Discret. Appl. Math. 157(8): 1932-1937 (2009) - [j37]Xueliang Fu, Yuansheng Yang, Baoqi Jiang:
Roman domination in regular graphs. Discret. Math. 309(6): 1528-1537 (2009) - [j36]Xueliang Fu, Yuansheng Yang, Baoqi Jiang:
On the domination number of generalized Petersen graphs P(n, 2). Discret. Math. 309(8): 2445-2451 (2009) - [c6]Han Li, Feng Chen, Hongji Yang, He Guo, William Cheng-Chung Chu, Yuansheng Yang:
An Ontology-Based Approach for GUI Testing. COMPSAC (1) 2009: 632-633 - [c5]Yuxin Wang, Liye Yuan, He Guo, Xinzhong Hui, Yuansheng Yang:
An Effective Approach for Multicast on Multi-core Architecture. ScalCom-EmbeddedCom 2009: 37-41 - 2008
- [j35]Xirong Xi, Yuansheng Yang, Yue Xi, Huijun Li:
On (a, d)-Antimagic Labelings of Generalized Petersen Graphs P(n, 3). Ars Comb. 86 (2008) - [j34]Xi Yue, Yuansheng Yang, Wang Liping:
One edge union of k shell graphs is cordial. Ars Comb. 86 (2008) - [j33]Xi Yue, Yuansheng Yang, Mominul, Wang Liping:
Super Vertex-magic Total Labelings of W3, n. Ars Comb. 86 (2008) - [j32]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Xiwu Yang:
The crossing number of flower snarks and related graphs. Ars Comb. 86 (2008) - [j31]Xirong Xu, Yuansheng Yang, Huijun Li, Xi Yue:
The Graphs C(t)11 are Graceful for t = 0, 1 (mod 4). Ars Comb. 88 (2008) - [j30]Yongqi Sun, Yuansheng Yang, Zhihai Wang:
The planar Ramsey numbers PR(K4-e, Kk-e). Ars Comb. 88 (2008) - [j29]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Chengrui Deng:
On the crossing numbers of Kmsquare Cn and Km, lsquare Pn. Discret. Appl. Math. 156(10): 1892-1907 (2008) - [j28]Xueliang Fu, Yuansheng Yang, Baoqi Jiang:
A note on the signed edge domination number in graphs. Discret. Appl. Math. 156(14): 2790-2792 (2008) - [j27]Chengye Zhao, Yuansheng Yang, Linlin Sun:
Domination dot-critical graphs with no critical vertices. Discret. Math. 308(15): 3241-3248 (2008) - [j26]Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Yanan Song:
The planar Ramsey number I. Discret. Math. 308(23): 5841-5848 (2008) - [j25]Wenping Zheng, Xiaohui Lin, Yuansheng Yang:
The crossing number of K2, mPn. Discret. Math. 308(24): 6639-6644 (2008) - [c4]Hong Yu, Xiaoliang Yang, Xianchao Zhang, Yuansheng Yang:
An Improved Random Walk Algorithm Based on Correlation Coefficient to Find Scientific Communities. CSSE (1) 2008: 690-693 - 2007
- [j24]Xueliang Fu, Yuansheng Yang, Baoqi Jiang:
On the Domination Number of Generalized Petersen Graphs P(n, 3). Ars Comb. 84 (2007) - [j23]Yongqi Sun, Yuansheng Yang, Baoqi Jiang, Xiaohui Lin, Lei Shi:
On Multicolor Ramsey Numbers for Even Cycles in Graphs. Ars Comb. 84 (2007) - [j22]Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Wenping Zheng:
On the Three Color Ramsey Numbers R(Cm, C4, C4). Ars Comb. 84 (2007) - [j21]Xirong Xu, Yuansheng Yang, Xi Yue, Khandoker Mohammed Mominul Haque, Lixin Shen:
Super Edge-Magic Labelings of Generalized Petersen Graphs P(n, 3). Ars Comb. 85 (2007) - [j20]Yuansheng Yang, Xirong Xu, Xi Yue, Huijun Li:
The Graphs C(t)9 are Graceful for t = 0, 3 (mod 4). Ars Comb. 85 (2007) - [j19]Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Qiao Jing:
The planar Ramsey number PR(K4-e, K5). Discret. Math. 307(1): 137-142 (2007) - [j18]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Chong Cui:
On the Crossing Number of K m P n . Graphs Comb. 23(3): 327-336 (2007) - 2006
- [j17]Yuansheng Yang, Xirong Xu, Xi Yue, Huijun Li, Khandoker Mohammed Mominul Haque:
The Graphs C(t)7 are Graceful for t = 0, 1, (mod 4). Ars Comb. 79 (2006) - [j16]Yuansheng Yang, Xiaohui Lin, Qiao Jing:
The face pair of planar graphs. Discret. Math. 306(15): 1742-1757 (2006) - [j15]Yongqi Sun, Yuansheng Yang, Feng Xu, Bingxi Li:
New Lower Bounds on the Multicolor Ramsey Numbers Rr(C2m). Graphs Comb. 22(2): 283-288 (2006) - [c3]Lishuang Li, Tingting Mao, Degen Huang, Yuansheng Yang:
Hybrid Models for Chinese Named Entity Recognition. SIGHAN@COLING/ACL 2006: 72-78 - 2005
- [j14]Yuansheng Yang, Xiaohui Lin, Chunyan Yu:
The Graphs C(t)5 are Graceful for t = 0, 3 (mod 4). Ars Comb. 74 (2005) - [j13]Yuansheng Yang, Xirong Xu, Xi Yue, Qiao Jing:
On Harmonious Labelings of the Balanced Quadruple Shells. Ars Comb. 75 (2005) - [j12]Xiaohui Lin, Yuansheng Yang, Jianguo Lü, Xin Hao:
The Crossing Number of C(mk;{1, k}). Graphs Comb. 21(1): 89-96 (2005) - [j11]Yuansheng Yang, Chengye Zhao, Xiaohui Lin, Yongsong Jiang, Xin Hao:
Some 3-connected 4-edge-critical non-Hamiltonian graphs. J. Graph Theory 50(4): 316-320 (2005) - 2004
- [j10]Yuansheng Yang, Xiaohui Lin, Jianguo Lü, Xin Hao:
The crossing number of C(n; 1, 3 ). Discret. Math. 289(1-3): 107-118 (2004) - [c2]Weifa Liang, Yuansheng Yang:
Maximizing Battery Life Routing in Wireless Ad Hoc Networks. HICSS 2004 - [c1]Lishuang Li, Chunrong Chen, Degen Huang, Yuansheng Yang:
Identifying Pronunciation-Translated Names from Chinese Texts Based on Support Vector Machines. ISNN (1) 2004: 983-987 - 2003
- [j9]Yuansheng Yang, Weifa Liang:
The minimum number of vertices with girth 6 and degree set D={r, m}. Discret. Math. 269(1-3): 249-258 (2003) - [j8]Yuansheng Yang, Xiaohui Lin, Zhiqiang Chen, Weiming Lu:
4-regular graphs without cut-vertices having the same path layer matrix. J. Graph Theory 44(4): 304-311 (2003) - 2002
- [j7]Yuansheng Yang, Jianhua Lin, Chunli Wang:
Three forbidden subgraphs for line graphs. Discret. Math. 252(1-3): 287-292 (2002) - [j6]Yuansheng Yang, Jianhua Lin, Chunli Wang:
Small regular graphs having the same path layer matrix. J. Graph Theory 39(4): 219-221 (2002) - 2000
- [j5]Yuansheng Yang, Jianhua Lin, Chunli Wang, Kaifeng Li:
On Kotzig's conjecture concerning graphs with a unique regular path-connectivity. Discret. Math. 211: 287-298 (2000)
1990 – 1999
- 1997
- [j4]Xiaohui Lin, Wenzhou Jiang, Chengxue Zhang, Yuansheng Yang:
On Smallest Maximally Nonhamiltonian Graphs. Ars Comb. 45 (1997) - [j3]Xiaohui Lin, Minghua Zhu, Zhengguo Yu, Chengxue Zhang, Yuansheng Yang:
On distinct distance sets in a graph. Discret. Math. 175(1-3): 277-282 (1997) - 1995
- [j2]Yuansheng Yang, George R. T. Hendry:
The ramsey number r(k1 + c4, k5 - e). J. Graph Theory 19(1): 13-15 (1995) - 1994
- [j1]Yuansheng Yang, Peter Rowlinson:
The third Ramsey numbers for graphs with at most four edges. Discret. Math. 125(1-3): 399-406 (1994)
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 21:22 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:
