The third Ramsey numbers for graphs with at most four edges. - Yuansheng Yang; Peter Rowlinson (Discret. Math., 1994)

The ramsey number r(k1 + c4, k5 - e). - Yuansheng Yang; George R. T. Hendry (J. Graph Theory, 1995)

On Smallest Maximally Nonhamiltonian Graphs. - Xiaohui Lin 002; Wenzhou Jiang; Chengxue Zhang; Yuansheng Yang (Ars Comb., 1997)

On distinct distance sets in a graph. - Xiaohui Lin 002; Minghua Zhu; Zhengguo Yu; Chengxue Zhang; Yuansheng Yang (Discret. Math., 1997)

On Kotzig's conjecture concerning graphs with a unique regular path-connectivity. - Yuansheng Yang; Jianhua Lin; Chunli Wang; Kaifeng Li (Discret. Math., 2000)

Three forbidden subgraphs for line graphs. - Yuansheng Yang; Jianhua Lin; Chunli Wang (Discret. Math., 2002)

Small regular graphs having the same path layer matrix. - Yuansheng Yang; Jianhua Lin; Chunli Wang (J. Graph Theory, 2002)

The minimum number of vertices with girth 6 and degree set D={r, m}. - Yuansheng Yang; Weifa Liang (Discret. Math., 2003)

4-regular graphs without cut-vertices having the same path layer matrix. - Yuansheng Yang; Xiaohui Lin 002; Zhiqiang Chen; Weiming Lu (J. Graph Theory, 2003)

Maximizing Battery Life Routing in Wireless Ad Hoc Networks. - Weifa Liang; Yuansheng Yang (HICSS, 2004)

Identifying Pronunciation-Translated Names from Chinese Texts Based on Support Vector Machines. - Lishuang Li; Chunrong Chen; Degen Huang; Yuansheng Yang (ISNN (1), 2004)

The crossing number of C(n; 1, 3 ). - Yuansheng Yang; Xiaohui Lin 002; Jianguo Lü; Xin Hao (Discret. Math., 2004)

The Graphs C(t)5 are Graceful for t = 0, 3 (mod 4). - Yuansheng Yang; Xiaohui Lin 002; Chunyan Yu (Ars Comb., 2005)

On Harmonious Labelings of the Balanced Quadruple Shells. - Yuansheng Yang; Xirong Xu; Xi Yue; Qiao Jing (Ars Comb., 2005)

The Crossing Number of C(mk;{1, k}). - Xiaohui Lin 002; Yuansheng Yang; Jianguo Lü; Xin Hao (Graphs Comb., 2005)

Some 3-connected 4-edge-critical non-Hamiltonian graphs. - Yuansheng Yang; Chengye Zhao; Xiaohui Lin 002; Yongsong Jiang; Xin Hao (J. Graph Theory, 2005)

Hybrid Models for Chinese Named Entity Recognition. - Lishuang Li; Tingting Mao; Degen Huang; Yuansheng Yang (SIGHAN@COLING/ACL, 2006)

The Graphs C(t)7 are Graceful for t = 0, 1, (mod 4). - Yuansheng Yang; Xirong Xu; Xi Yue; Huijun Li; Khandoker Mohammed Mominul Haque (Ars Comb., 2006)

The face pair of planar graphs. - Yuansheng Yang; Xiaohui Lin 002; Qiao Jing (Discret. Math., 2006)

New Lower Bounds on the Multicolor Ramsey Numbers Rr(C2m). - Yongqi Sun; Yuansheng Yang; Feng Xu; Bingxi Li (Graphs Comb., 2006)

On the Domination Number of Generalized Petersen Graphs P(n, 3). - Xueliang Fu; Yuansheng Yang; Baoqi Jiang (Ars Comb., 2007)

Super Edge-Magic Labelings of Generalized Petersen Graphs P(n, 3). - Xirong Xu; Yuansheng Yang; Xi Yue; Khandoker Mohammed Mominul Haque; Lixin Shen (Ars Comb., 2007)

On Multicolor Ramsey Numbers for Even Cycles in Graphs. - Yongqi Sun; Yuansheng Yang; Baoqi Jiang; Xiaohui Lin 002; Lei Shi (Ars Comb., 2007)

On the Three Color Ramsey Numbers R(Cm, C4, C4). - Yongqi Sun; Yuansheng Yang; Xiaohui Lin 002; Wenping Zheng (Ars Comb., 2007)

The Graphs C(t)9 are Graceful for t = 0, 3 (mod 4). - Yuansheng Yang; Xirong Xu; Xi Yue; Huijun Li (Ars Comb., 2007)

The planar Ramsey number PR(K4-e, K5). - Yongqi Sun; Yuansheng Yang; Xiaohui Lin 002; Qiao Jing (Discret. Math., 2007)

On the Crossing Number of K m P n . - Wenping Zheng; Xiaohui Lin 002; Yuansheng Yang; Chong Cui (Graphs Comb., 2007)

An Improved Random Walk Algorithm Based on Correlation Coefficient to Find Scientific Communities. - Hong Yu 005; Xiaoliang Yang; Xianchao Zhang 001; Yuansheng Yang (CSSE (1), 2008)

On (a, d)-Antimagic Labelings of Generalized Petersen Graphs P(n, 3). - Xirong Xi; Yuansheng Yang; Yue Xi; Huijun Li (Ars Comb., 2008)

The Graphs C(t)11 are Graceful for t = 0, 1 (mod 4). - Xirong Xu; Yuansheng Yang; Huijun Li; Xi Yue (Ars Comb., 2008)

The planar Ramsey numbers PR(K4-e, Kk-e). - Yongqi Sun; Yuansheng Yang; Zhihai Wang (Ars Comb., 2008)

One edge union of k shell graphs is cordial. - Xi Yue; Yuansheng Yang; Wang Liping (Ars Comb., 2008)

Super Vertex-magic Total Labelings of W3, n. - Xi Yue; Yuansheng Yang; Mominul; Wang Liping (Ars Comb., 2008)

The crossing number of flower snarks and related graphs. - Wenping Zheng; Xiaohui Lin 002; Yuansheng Yang; Xiwu Yang (Ars Comb., 2008)

A note on the signed edge domination number in graphs. - Xueliang Fu; Yuansheng Yang; Baoqi Jiang (Discret. Appl. Math., 2008)

On the crossing numbers of Kmsquare Cn and Km, lsquare Pn. - Wenping Zheng; Xiaohui Lin 002; Yuansheng Yang; Chengrui Deng (Discret. Appl. Math., 2008)

Domination dot-critical graphs with no critical vertices. - Chengye Zhao; Yuansheng Yang; Linlin Sun (Discret. Math., 2008)

The planar Ramsey number I. - Yongqi Sun; Yuansheng Yang; Xiaohui Lin 002; Yanan Song (Discret. Math., 2008)

The crossing number of K2, mPn. - Wenping Zheng; Xiaohui Lin 002; Yuansheng Yang (Discret. Math., 2008)

An Ontology-Based Approach for GUI Testing. - Han Li; Feng Chen 004; Hongji Yang; He Guo 001; William Cheng-Chung Chu; Yuansheng Yang (COMPSAC (1), 2009)

An Effective Approach for Multicast on Multi-core Architecture. - Yuxin Wang 001; Liye Yuan; He Guo 001; Xinzhong Hui; Yuansheng Yang (ScalCom-EmbeddedCom, 2009)

The Connected and Tree Domination Number of P(n, k) for k = 4, 6, 8. - Chengye Zhao; Yuansheng Yang; Shi Lei; Linlin Sun (Ars Comb., 2009)

(d, 1)-Total labellings of regular nonbipartite graphs and an application to flower snarks. - Chunling Tong; Xiaohui Lin 002; Yuansheng Yang; Zhengwei Hou (Ars Comb., 2009)

The Graphs C(t)13 are Graceful for t = 0, 3 (mod 4). - Xirong Xu; Yuansheng Yang; Lizhong Han; Huijun Li (Ars Comb., 2009)

On the Crossing Numbers of the k-th Power of Pn. - Wenping Zheng; Xiaohui Lin 002; Yuansheng Yang; Gui Yang (Ars Comb., 2009)

The crossing numbers of generalized Petersen graphs with small order. - Xiaohui Lin 002; Yuansheng Yang; Wenping Zheng; Lei Shi; Weiming Lu (Discret. Appl. Math., 2009)

Equitable total coloring of CmCn. - Chunling Tong; Xiaohui Lin 002; Yuansheng Yang; Zhihe Li (Discret. Appl. Math., 2009)

2-rainbow domination of generalized Petersen graphs P(n, 2). - Chunling Tong; Xiaohui Lin 002; Yuansheng Yang; Meiqin Luo (Discret. Appl. Math., 2009)

Roman domination in regular graphs. - Xueliang Fu; Yuansheng Yang; Baoqi Jiang (Discret. Math., 2009)

On the domination number of generalized Petersen graphs P(n, 2). - Xueliang Fu; Yuansheng Yang; Baoqi Jiang (Discret. Math., 2009)

Exploiting Multi-Features to Detect Hedges and their Scope in Biomedical Texts. - Huiwei Zhou; Xiaoyan Li; Degen Huang; Zezhong Li; Yuansheng Yang (CoNLL Shared Task, 2010)

Recursive Feature Selection Based on Minimum Redundancy Maximum Relevancy. - Yuansheng Yang; Haiyan Li; Xiaohui Lin 002; Di Ming (PAAP, 2010)

Combining Syntactic and Semantic Features by SVM for Unrestricted Coreference Resolution. - Huiwei Zhou; Yao Li; Degen Huang; Yan Zhang; Chunlong Wu; Yuansheng Yang (CoNLL Shared Task, 2011)

Detecting hedges scope based on phrase structures and dependency structures. - Huiwei Zhou; Xiaoyan Li; Degen Huang; Yuansheng Yang; Jianjun Ma (NLPKE, 2011)

The Connected Domination and Tree Domination of P(n, k) for k = 1, 2, [n/2]. - Chengye Zhao; Yuansheng Yang; Linlin Sun; Feilong Cao (Ars Comb., 2011)

On the Domination Number of the Circulant Graphs C(n;{1, 2}), C(n;{1, 3}) and C(n;{1, 4}). - Xueliang Fu; Yuansheng Yang; Baoqi Jiang (Ars Comb., 2011)

A lower bound for 2-rainbow domination number of generalized Petersen graphs P(n, 3). - Chunling Tong; Xiaohui Lin 002; Yuansheng Yang; Baosheng Zhang; Xianchen Zheng (Ars Comb., 2011)

Skolem-Gracefulness of k-Stars. - Yue Xi; Yuansheng Yang; Xin-hong Meng (Ars Comb., 2011)

The Crossing Numbers of Cartesian Product of Cone Graph Cm + Kl with Path Pn. - Wenping Zheng; Xiaohui Lin 002; Yuansheng Yang; Xiwu Yang (Ars Comb., 2011)

Voting-Based Ensemble Classifiers to Detect Hedges and Their Scopes in Biomedical Texts. - Huiwei Zhou; Xiaoyan Li; Degen Huang; Yuansheng Yang; Fuji Ren (IEICE Trans. Inf. Syst., 2011)

Using ontology to generate test cases for GUI testing. - Han Li; He Guo 001; Feng Chen 004; Hongji Yang; Yuansheng Yang (Int. J. Comput. Appl. Technol., 2011)

Feasibility study of software reengineering towards role-based access control. - Han Li; Hongji Yang; Feng Chen 004; He Guo 001; Yuansheng Yang (Int. J. Comput. Appl. Technol., 2011)

Radio number of ladder graphs. - Haoli Wang; Xirong Xu; Yuansheng Yang; Baosheng Zhang; Meiqin Luo; Guoqing Wang (Int. J. Comput. Math., 2011)

Fault-tolerant edge-pancyclicity of locally twisted cubes. - Xirong Xu; Wenhua Zhai; Jun-Ming Xu 001; Aihua Deng; Yuansheng Yang (Inf. Sci., 2011)

On the distance paired domination of generalized Petersen graphs P(n, 1) and P(n, 2). - Haoli Wang; Xirong Xu; Yuansheng Yang; Kai Lü (J. Comb. Optim., 2011)

An Extended ISOMAP by Enhancing Similarity for Clustering. - Hong Yu 005; Xianchao Zhang 001; Yuansheng Yang; Xiaowei Zhao 003; Lei Cai (IEA/AIE, 2012)

Hamiltonian Properties of the 3-(γ, 2)-Critical Graphs. - Chengye Zhao; Yuansheng Yang; Linlin Sun (Ars Comb., 2012)

Prime Cordial labeling of Flower Snark and related graphs. - Kh. Md. Mominul Haque; Xiaohui Lin 002; Yuansheng Yang; Jinbo Zhang (Ars Comb., 2012)

On the Packing Number of Generalized Petersen Graphs P(n, 2). - Yuansheng Yang; Xueliang Fu; Baoqi Jiang (Ars Comb., 2012)

An upper bound for the crossing number of bubble-sort graph Bn - Baigong Zheng; Yuansheng Yang; Xirong Xu (CoRR, 2012)

The crossing numbers of Kn,n - nK2, Kn × P2, Kn × P3 and Kn × C4 - Yuansheng Yang; Baigong Zheng; Xiaohui Lin 002; Xirong Xu (CoRR, 2012)

The crossing number of the generalized Petersen graph P(10, 3) is six - Yuansheng Yang; Baigong Zheng; Xirong Xu (CoRR, 2012)

The crossing numbers of Km × Pn and Km × Cn - Yuansheng Yang; Baigong Zheng; Xirong Xu; Xiaohui Lin 002 (CoRR, 2012)

Prime labeling on Knödel graphs W3, n. - Kh. Md. Mominul Haque; Xiaohui Lin 002; Yuansheng Yang; Pingzhong Zhao (Ars Comb., 2013)

L(2, 1)-labeling of flower snark and related graphs. - Chunling Tong; Xiaohui Lin 002; Yuansheng Yang; Zhengwei Hou (Ars Comb., 2013)

Roman domination number of Generalized Petersen Graphs P(n, 2). - Haoli Wang; Xirong Xu; Yuansheng Yang; Chunnian Ji (Ars Comb., 2013)

An upper bound for the crossing number of augmented cubes. - Guoqing Wang; Haoli Wang; Yuansheng Yang; Xuezhi Yang; Wenping Zheng (Int. J. Comput. Math., 2013)

The crossing number of the generalized Petersen graph P(10, 3) is six. - Yuansheng Yang; Baigong Zheng; Xirong Xu (Int. J. Comput. Math., 2013)

Feedback Number of Generalized Kautz Digraphs GK(2, n). - Lei Wang; Xirong Xu; Yuansheng Yang; Di Ming; Xuezhi Dong (Ars Comb., 2014)

Some Graphs with Double Domination Subdivision Number Three. - Haoli Wang; Xirong Xu; Yuansheng Yang; Baosheng Zhang (Graphs Comb., 2014)

Erratum to: Some Graphs with Double Domination Subdivision Number Three. - Haoli Wang; Xirong Xu; Yuansheng Yang; Baosheng Zhang (Graphs Comb., 2014)

Ensemble unsupervised feature selection based on permutation and R-value. - Xiaomei Wang; Xiaohui Lin 002; Xin Huang 015; Yuansheng Yang (FSKD, 2015)

On the Domination Number of Generalized Petersen Graphs P(ck, k). - Haoli Wang; Xirong Xu; Yuansheng Yang; Guoqing Wang (Ars Comb., 2015)

The decycling number of generalized Petersen graphs. - Liqing Gao; Xirong Xu; Jian Wang; Dejun Zhu; Yuansheng Yang (Discret. Appl. Math., 2015)

Decycling bubble sort graphs. - Jian Wang; Xirong Xu; Liqing Gao; Sijia Zhang; Yuansheng Yang (Discret. Appl. Math., 2015)

An upper bound for the crossing number of locally twisted cubes. - Haoli Wang; Xirong Xu; Yuansheng Yang; Bao Liu; Wenping Zheng; Guoqing Wang (Ars Comb., 2017)

The crossing number of pancake graph P4 is six. - Yuansheng Yang; Bo Lv; Baigong Zheng; Xirong Xu; Ke Zhang (Ars Comb., 2017)

On the total signed domination number of the Cartesian product of paths. - Hong Gao 002; Huiping Cao; Yuansheng Yang (Contributions Discret. Math., 2017)

Fault-Tolerant Hamiltonian Connectivity of Twisted Hypercube-Like Networks THLNs. - Huifeng Zhang; Xirong Xu; Jing Guo; Yuansheng Yang (IEEE Access, 2018)

On the total signed domination number of Pm [square] Cn. - Hong Gao 002; Huiping Cao; Yuansheng Yang (Ars Comb., 2018)

The Feedback Number of Knodel graph W3, n. - Sijia Zhang; Xirong Xu; Chun Yin; Yazhen Huang; Yuansheng Yang (Ars Comb., 2018)

The crossing number of locally twisted cubes LTQn. - Zhao Lingqi; Xirong Xu; Bai Siqin; Huifeng Zhang; Yuansheng Yang (Discret. Appl. Math., 2018)

A feature selection method based on effective range and SVM-RFE. - Yifei Mao; Yuansheng Yang (Int. J. Wirel. Mob. Comput., 2018)

Bagging Approach for Italian Domination in $C_{n} square , P_{m}$. - Hong Gao 002; Tingting Xu; Yuansheng Yang (IEEE Access, 2019)

Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks THLNs. - Huifeng Zhang; Xirong Xu; Jing Guo; Yuansheng Yang (CoRR, 2019)

Fault-Tolerant Panconnectivity of Augmented Cubes AQn. - Xirong Xu; Huifeng Zhang; Sijia Zhang; Yuansheng Yang (Int. J. Found. Comput. Sci., 2019)

Italian domination in the Cartesian product of paths. - Hong Gao 002; Tingting Feng; Yuansheng Yang (J. Comb. Optim., 2021)

Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes. - Yuansheng Yang; Guoqing Wang; Haoli Wang; Yan Zhou (J. Graph Theory, 2022)

((d,1) )-Total Labelling of Generalized Petersen Graphs (P(n,k) ). - Chunling Tong; Senyuan Su; Yuansheng Yang (Ars Comb., 2024)

Rainbow Domination in Cartesian Product of Paths and Cycles. - Hong Gao 002; Yunlei Zhang; Yuqi Wang; Yuanyuan Guo; Xing Liu; Renbang Liu; Changqing Xi; Yuansheng Yang (Int. J. Found. Comput. Sci., 2024)