{"id":6,"date":"2017-10-27T22:54:59","date_gmt":"2017-10-27T14:54:59","guid":{"rendered":"http:\/\/ms.ntub.edu.tw\/~shyong\/?p=6"},"modified":"2024-09-02T11:58:11","modified_gmt":"2024-09-02T03:58:11","slug":"publication-list","status":"publish","type":"post","link":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/2017\/10\/27\/publication-list\/","title":{"rendered":"Publication List"},"content":{"rendered":"<p>(A) Journal Papers:<\/p>\n<ol>\n<li>\n<p>Mei-Mei Gu, <u>Jinn-Shyong Yang<\/u>,  Jou-Ming Chang, <a title=\"https:\/\/dx.doi.org\/10.1109\/TNSE.2024.3418460\" href=\"https:\/\/dx.doi.org\/10.1109\/TNSE.2024.3418460\"> Assessing Network Reliability Through Perspectives of Neighbor Connectivity and Subversion <\/a>,\u00a0<span class=\"style15\"><em>IEEE Transactions on Network Science and Engineering<\/em>, Vol. 11, No. 5, (2024) pp. 4384-4396.  Sept.-Oct. 2024(SCIE, IF:5.033)(9\/108, MATHEMATICS, INTERDISCIPLINARY APPLICATIONS) Q1<\/span><\/p>\n<\/li>\n<li>\n<p>Kung-Jui Pai, <u>Jinn-Shyong Yang<\/u>, Guan-Yu Chen, Jou-Ming Chang, <a title=\"https:\/\/doi.org\/10.1109\/TNSE.2022.3140329\" href=\"https:\/\/doi.org\/10.1109\/TNSE.2022.3140329\"> Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks <\/a>,\u00a0<span class=\"style15\"><em>IEEE Transactions on Network Science and Engineering<\/em>, Vol. 9, no.  2, pp. 932-946, 1 March-April 2022. (SCIE, IF:5.033)(9\/108, MATHEMATICS, INTERDISCIPLINARY APPLICATIONS) Q1<\/span><\/p>\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Xiao-Yan Li, Sheng-Lung Peng, Jou-Ming Chang, <a title=\"https:\/\/doi.org\/10.1016\/j.amc.2021.126617\" href=\"https:\/\/doi.org\/10.1016\/j.amc.2021.126617\"> Parallel Construction of Multiple Independent Spanning Trees on Highly Scalable Datacenter Networks<\/a>,\u00a0<span class=\"style15\"><em>Applied Mathematics and Computation, <\/em> Vol. 413, (2022) Article 126617. (SCIE, IF:4.397)(7\/267, MATHEMATICS, APPLIED) Q1<\/span><\/p>\n<\/li>\n<li>\n<p>Yu-Huei Chang, Kung-Jui Pai, Chiun-Chieh Hsu,<u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, <a title=\"https:\/\/doi.org\/10.1016\/j.tcs.2020.12.023\" href=\"https:\/\/doi.org\/10.1016\/j.tcs.2020.12.023\"> Constructing Dual-CISTs of Folded Divide-and-Swap Cubes <\/a>,\u00a0<span class=\"style15\"><em>Theoretical Computer Science<\/em>, Vol. 856, (2021) pp. 75-87. (SCIE, IF:1.002)(83\/110, COMPUTER SCIENCE, THEORY & METHODS) Q3<\/span><\/p>\n<\/li>\n<li>\n<p>Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, <u>Jinn-Shyong Yang<\/u>, <a title=\"https:\/\/doi.org\/10.1016\/j.tcs.2018.09.018\" href=\"https:\/\/doi.org\/10.1016\/j.tcs.2018.09.018\">The 4-Component Connectivity of Alternating Group Networks<\/a>,\u00a0<span class=\"style15\"><em>Theoretical Computer Science<\/em>, Vol. 766, (2019\/4) pp. 38-45.(SCIE, IF:1.002)(83\/110, COMPUTER SCIENCE, THEORY & METHODS) Q3<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 77\/103 -->\n<\/li>\n<li>\n<p>Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, Shyue-Ming Tang, Kung-Jui Pai, <a title=\"http:\/\/dx.doi.org\/10.1093\/comjnl\/bxx053\" href=\"http:\/\/dx.doi.org\/10.1093\/comjnl\/bxx053\"> The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars<\/a>,\u00a0<span class=\"style15\"><em>The Computer Journal<\/em>, Vol. 61, No. 1, (2018\/1) pp. 121-128.(SCIE, IF:1.762) (41\/54, COMPUTER SCIENCE, HARDWARE & ARCHITECTURE)(70\/111, COMPUTER SCIENCE, THEORY & METHODS) Q3<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 75\/103 -->\n<\/li>\n<li>\n<p>Jou-Ming Chang, Hung-Yi Chang, Hung-Lung Wang, Kung-Jui Pai, <u>Jinn-Shyong Yang<\/u>,<a title=\"http:\/\/dx.doi.org\/10.1007\/s10878-016-0018-8\" href=\"https:\/\/doi.org\/10.1587\/transfun.E100.A.1932\"> Completely Independent Spanning Trees on 4-Regular Chordal Rings<\/a>,\u00a0<span class=\"style15\"><em>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences<\/em>, Vol. E100-A, No. 9, (2017\/9) pp. 1932-1935.(SCIE, IF:0.423)(269\/276, ENGINEERING, ELECTRICAL & ELECTRONIC) Q4<\/span><\/p>\n<p><!-- ENGINEERING, ELECTRICAL & ELECTRONIC 249\/260 -->\n<\/li>\n<li>\n<p>Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, Sun-Yuan Hsieh, Yu-Huei Chang, Yue-Li Wang, <a title=\"http:\/\/dx.doi.org\/10.1007\/s10878-016-0018-8\" href=\"http:\/\/dx.doi.org\/10.1007\/s10878-016-0018-8\"> Construction Independent Spanning Trees on Locally Twisted Cubes in Parallel <\/a>,\u00a0<span class=\"style15\"><em>Journal of Combinatorial Optimization<\/em>, Vol. 33, No. 3, (2017\/4) pp. 956-967. (SCIE, IF:1.254)(160\/267, MATHEMATICS, APPLIED) Q3<\/span><\/p>\n<p><!-- MATHEMATICS, APPLIED 139\/252--><br \/>\n<!-- COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS 92\/105-->\n<\/li>\n<li>\n<p>Jou-Ming Chang, Ting-Jyun Yang, <u>Jinn-Shyong Yang<\/u>, <a title=\"http:\/\/dx.doi.org\/10.1016\/j.dam.2016.11.017\" href=\"http:\/\/dx.doi.org\/10.1016\/j.dam.2016.11.017\"> A Parallel Algorithm for Constructing Independent Spanning Trees in Twisted Cubes <\/a>,\u00a0<span class=\"style15\"><em>Discrete Applied Mathematics<\/em>, Vol. 219, (2017\/3) pp. 74-82. (SCIE, IF:1.254)(160\/267, MATHEMATICS, APPLIED) Q3<\/span><\/p>\n<p><!-- MATHEMATICS, APPLIED 136\/252 -->\n<\/li>\n<li>\n<p>Kung-Jui Pai, Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, <a title=\"http:\/\/dx.doi.org\/10.1016\/j.ipl.2016.06.001\" href=\"http:\/\/dx.doi.org\/10.1016\/j.ipl.2016.06.001\"> Vertex-transitivity on Folded Crossed Cubes<\/a>,\u00a0<span class=\"style15\"><em>Information Processing Letters<\/em>, Vol. 116, No. 11, (2016\/11) pp. 689\u2013693. (SCIE, IF:0.851)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, INFORMATION SYSTEMS 155\/164 -->\n<\/li>\n<li>\n<p>Kung-Jui Pai, Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, Ro-Yu Wu, <a title=\"http:\/\/dx.doi.org\/10.1016\/j.tcs.2016.08.001\" href=\"http:\/\/dx.doi.org\/10.1016\/j.tcs.2016.08.001\"> Corrigendum to &quot;Incidence Coloring on Hypercubes&quot; [Theoret. Comput. Sci. 557 (2014) 59--65] <\/a>,<span class=\"style15\"><em>Theoretical Computer Science<\/em>, Vol. 651, (2016\/10) pp. 87-88. (SCIE, IF:0.747)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 77\/103 -->\n<\/li>\n<li>\n<p>Jou-Ming Chang, Xiang-Rui Chen, <u>Jinn-Shyong Yang<\/u>, Ro-Yu Wu, <a title=\"http:\/\/dx.doi.org\/10.1016\/j.ipl.2016.03.003\" href=\"http:\/\/dx.doi.org\/10.1016\/j.ipl.2016.03.003\"> Locally Exchanged Twisted Cubes: Connectivity and Super Connectivity <\/a>,\u00a0<span class=\"style15\"><em>Information Processing Letters<\/em>, Vol. 116, No. 7, (2016\/7) pp. 460-466. (SCIE, IF:0.677)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, INFORMATION SYSTEMS 129\/148 -->\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Sih-Syuan Luo, Jou-Ming Chang, <a title=\"http:\/\/dx.doi.org\/10.1093\/comjnl\/bxv029\" href=\"http:\/\/dx.doi.org\/10.1093\/comjnl\/bxv029\"> Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars <\/a>,\u00a0<span class=\"style15\"><em>The Computer Journal<\/em>, Vol. 58, No. 11, (2015\/11) pp. 2972-2981. (SCIE, IF:1.077)<\/span><\/p>\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan, <a title=\"http:\/\/dx.doi.org\/10.1109\/TPDS.2014.2367498\" href=\"http:\/\/dx.doi.org\/10.1109\/TPDS.2014.2367498\"> Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes <\/a>,\u00a0<span class=\"style15\"><em>IEEE Transactions on Parallel and Distributed Systems<\/em>, Vol. 26, No. 11, (2015\/11) pp. 3090-3098. (SCIE, IF:2.600)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 8\/103 --><br \/>\n<!-- ENGINEERING, ELECTRICAL & ELECTRONIC 16\/260 -->\n<\/li>\n<li>\n<p>Hung-Yi Chang, Hung-Lung Wang, <u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, <a title=\"http:\/\/dx.doi.org\/10.1587\/transfun.E98.A.2191\" href=\"http:\/\/dx.doi.org\/10.1587\/transfun.E98.A.2191\"> A Note on the Degree Condition of Completely Independent Spanning Trees <\/a>,<br \/>\n<span class=\"style15\"><em>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences<\/em>, Vol. E98-A, No. 10, (2015\/10) pp. 2191-2193. (SCIE, IF:0.470)<\/span><\/p>\n<p><!-- ENGINEERING, ELECTRICAL & ELECTRONIC 249\/260 -->\n<\/li>\n<li>\n<p>Yu-Huei Chang, <u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, Yue-Li Wang, <a title=\"http:\/\/dx.doi.org\/10.1016\/j.amc.2015.06.081\" href=\"http:\/\/dx.doi.org\/10.1016\/j.amc.2015.06.081\"> A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes <\/a>,\u00a0<span class=\"style15\"><em>Applied Mathematics and Computation<\/em>, Vol. 268, (2015\/10) pp. 489-495. (SCIE, IF: 3.472)<\/span><\/p>\n<p><!-- MATHEMATICS, APPLIED 21\/252 -->\n<\/li>\n<li>\n<p>Jou-Ming Chang, Kung-Jui Pai, <u>Jinn-Shyong Yang<\/u>, Hung-Chang Chan, <a title=\"http:\/\/jit.niu.edu.tw\/jitcontent2.php?getserial=1192&Vol2=16&No2=3\" href=\"http:\/\/jit.niu.edu.tw\/jitcontent2.php?getserial=1192&Vol2=16&No2=3\"> Embedding a Family of Two Disjoint Multi-Dimensional Meshes into Locally Twisted Cubes <\/a>,\u00a0<span class=\"style15\"><em>Journal of Internet Technology<\/em>, Vol. 16 No. 3, (2015\/5) pp. 541-546. (SCIE, IF:0.786)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, INFORMATION SYSTEMS 97\/148 --><br \/>\n<!-- TELECOMMUNICATIONS 66\/87 -->\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang, <a title=\"http:\/\/dx.doi.org\/10.1007\/s11227-014-1346-z\" href=\"http:\/\/dx.doi.org\/10.1007\/s11227-014-1346-z\"> A Fully Parallelized Scheme of Constructing Independent Spanning Trees on Mobius Cubes <\/a>,\u00a0<span class=\"style15\"><em>The Journal of Supercomputing<\/em>, Vol. 71, (2015\/3) pp. 894-908. (SCIE, IF:2.469)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 44\/103 --><br \/>\n<!-- COMPUTER SCIENCE, HARDWARE & ARCHITECTURE 25\/52 --><br \/>\n<!-- ENGINEERING, ELECTRICAL & ELECTRONIC 153\/260 -->\n<\/li>\n<li>\n<p>Jou-Ming Chang, Jhen-Ding Wang, <u>Jinn-Shyong Yang<\/u>, Kung-Jui Pai, <a title=\"http:\/\/dx.doi.org\/10.1016\/j.ipl.2014.06.015\" href=\"http:\/\/dx.doi.org\/10.1016\/j.ipl.2014.06.015\"> A Comment on &quot;Independent Spanning Trees in Crossed Cubes&quot; <\/a>,\u00a0<span class=\"style15\"><em>Information Processing Letters<\/em>, Vol. 114, No. 12, (2014\/12) pp. 734-739. (SCIE IF: 0.677) <\/span><\/p>\n<p><!-- COMPUTER SCIENCE, INFORMATION SYSTEMS 129\/148 -->\n<\/li>\n<li>\n<p>Kung-Jui Pai, Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, Ro-Yu Wu, <a title=\"http:\/\/dx.doi.org\/10.1016\/j.tcs.2014.08.017\" href=\"http:\/\/dx.doi.org\/10.1016\/j.tcs.2014.08.017\"> Incidence Coloring on Hypercubes <\/a>,\u00a0<span class=\"style15\"><em>Theoretical Computer Science<\/em>, Vol. 557, (2014\/11) pp. 59-65. (SCIE, IF:0.747)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 77\/103 -->\n<\/li>\n<li>\n<p>Kung-Jui Pai, <u>Jinn-Shyong Yang<\/u>, Sing-Chen Yao, Shyue-Ming Tang, Jou-Ming Chang, <a title=\"http:\/\/search.ieice.org\/bin\/summary.php?id=e97-d_9_2514\" href=\"http:\/\/search.ieice.org\/bin\/summary.php?id=e97-d_9_2514\"> Completely Independent Spanning Trees on Some Interconnection Networks<\/a>,\u00a0<span class=\"style15\"><em>IEICE Transactions on Information and Systems<\/em>, Vol. E97-D, No.9, (2014\/9) pp. 2514-2517. (SCIE, IF:0.718)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, SOFTWARE ENGINEERING 97\/104 --><br \/>\n<!-- COMPUTER SCIENCE, INFORMATION SYSTEMS 139\/148 --><br \/>\n<!-- Hung-Yi Chang, Hung-Lung Wang, Jinn-Shyong Yang, Jou-Ming Chang, A note on the degree condition of completely independent spanning trees, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E98-A (2015) 2191-2193. (*) -->\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, <a title=\"http:\/\/dx.doi.org\/10.1093\/comjnl\/bxs157\" href=\"http:\/\/dx.doi.org\/10.1093\/comjnl\/bxs157\"> Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs<\/a>,\u00a0<span class=\"style15\"><em>The Computer Journal<\/em>, Vol. 57, No. 1, (2014\/1) pp. 93-99. (SCIE, IF:1.077)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 75\/103 --><br \/>\n<!-- Jou-Ming Chang, Jhen-Ding Wang, Jinn-Shyong Yang, Kung-Jui Pai, A comment on \"Independent spanning trees in crossed cubes\", Information Processing Letters 114 (2014) 734-739. (*) Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang, A fully parallelized scheme of constructing independent spanning trees on M\u00f6bius cubes, Journal of Supercomputing71 (2015) 894-908. (*) Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang, A fast parallel algorithm for constructing independent spanning trees on parity cubes, Applied Mathematics and Computation 268 (2015) 489-495. (*) Jinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan, Parallel construction of independent spanning trees on enhanced hypercubes, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 3090-3098. (*) -->\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Hung-Chang Chan, Jou-Ming Chang, <a title=\"http:\/\/dx.doi.org\/10.1016\/j.dam.2011.04.014\" href=\"http:\/\/dx.doi.org\/10.1016\/j.dam.2011.04.014\"> Broadcasting Secure Messages via Optimal Independent Spanning Trees in Folded Hypercubes<\/a>,\u00a0<span class=\"style15\"><em>Discrete Applied Mathematics<\/em>, Vol. 159, No. 12, (2011\/7) pp. 1254-1263. (SCIE, IF:1.041)<\/span><\/p>\n<p><!-- MATHEMATICS, APPLIED 136\/252 --><br \/>\n<!-- Yan Wang, Jianxi Fan, Xiaohua Jia, He Huang, An algorithm to construct independent spanning trees on parity cubes, Theoretical Computer Science 465 (2012) 61-72. (*) Shyue-Ming Tang, Construct independent spanning trees on chordal rings with multiple chords, Smart Innovation, Systems and Technologies 20 (2013) 481-490. Xie-Bin Chen, Construction of optimal independent spanning trees on folded hypercubes, Information Sciences 253 (2013) 147-156. (*) Jinn-Shyong Yang, Jou-Ming Chang, Optimal independent spanning trees on Cartesian product of hybrid graphs, The Computer Journal 57 (2014) 93-99. (*) Che-Nan Kuo, Chia-Wei Lee, Nai-Wen Chang, Kuang-Husn Shih Extended fault-tolerant bipanconnectivity and panconnectivity of folded hypercubes, International Journal of Mobile Communications 12 (2014) 397-410. (*) Jou-Ming Chang, Jhen-Ding Wang, Jinn-Shyong Yang, Kung-Jui Pai, A comment on \"Independent spanning trees in crossed cubes\", Information Processing Letters 114 (2014) 734-739. (*) Cheng-Nan Lai, An efficient construction of one-to-many node-disjoint paths in folded hypercubes, Journal of Parallel and Distributed Computing 74 (2014) 2310-2316. Che-Nan Kuo, Chia-Wei Lee, Nai-Wen Chang, Kuang-Husn Shih, Extended fault-tolerant bipanconnectivity and panconnectivity of folded hypercubes, International Journal of Mobile Communications 12 (2014) 397-410. Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang, A fully parallelized scheme of constructing independent spanning trees on M\u00f6bius cubes, Journal of Supercomputing71 (2015) 894-908. (*) Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang, A fast parallel algorithm for constructing independent spanning trees on parity cubes, Applied Mathematics and Computation 268 (2015) 489-495. (*) Jinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan, Parallel construction of independent spanning trees on enhanced hypercubes, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 3090-3098. (*) Times cited: 8 (from Web of Science) -->\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, <a title=\"http:\/\/dx.doi.org\/10.1002\/net.20389\" href=\"http:\/\/dx.doi.org\/10.1002\/net.20389\"> Independent Spanning Trees on Folded Hyper-Stars<\/a>,\u00a0<span class=\"style15\"><em>Networks<\/em>, Vol. 56, No. 4, (2010\/6) pp. 272-281. (SCIE, IF:2.602)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, HARDWARE & ARCHITECTURE 35\/52 --><br \/>\n<!-- OPERATIONS RESEARCH & MANAGEMENT SCIENCE 59\/84 --><br \/>\n<!-- Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Discrete Applied Mathematics 159 (2011) 1254-1263. (*) Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Independent spanning trees in crossed cubes, Information Sciences 233 (2013) 276-289. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Bangrui Chen, Constructive algorithm of independent spanning trees on M\u00f6bius cubes, The Computer Journal 56 (2013) 1347-1362. (*) Xie-Bin Chen, Construction of optimal independent spanning trees on folded hypercubes, Information Sciences 253 (2013) 147-156. (*) Jinn-Shyong Yang, Jou-Ming Chang, Optimal independent spanning trees on Cartesian product of hybrid graphs, The Computer Journal 57 (2014) 93-99. (*) F. Zhang, K. Qiu, J. S. Kim, Hyper-star graphs: some topological properties and an optimal neighbourhood broadcasting algorithm, Proceedings of 14th International Conference of Algorithms and Architectures for Parallel Processing (ICA3PP 2014) Part I, Dalian, China, August 24-27, 2014, LNCS 8630, pp. 526-534. (*) Baolei Cheng, Jianxi Fan, Xiaohua Jia, Dimensional-permutation-based independent spanning trees in bijective connection networks, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 45-53. Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang, A fully parallelized scheme of constructing independent spanning trees on M\u00f6bius cubes, Journal of Supercomputing 71 (2015) 894-908. (*) F. Zhang, K. Qiu, J. S. Kim, Hyper-star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm, Concurrency and Computation: Practice and Experience 27 (2015) 4186-4193. (*) Times cited: 7 (from Web of Science) -->\n<\/li>\n<li>\n<p>Jia-Cian Lin, <u>Jinn-Shyong Yang<\/u>, Chiun-Chieh Hsu, Jou-Ming Chang, <a title=\"http:\/\/dx.doi.org\/10.1016\/j.ipl.2010.03.012\" href=\"http:\/\/dx.doi.org\/10.1016\/j.ipl.2010.03.012\"> Independent Spanning Trees vs. Edge-disjoint Spanning Trees in Locally Twisted Cubes <\/a>,\u00a0<span class=\"style15\"><em>Information Processing Letters<\/em>, Vol. 110, No. 10, (2010\/4) pp. 414-419. (SCIE IF: 0.677) <\/span><\/p>\n<p><!-- Xie-Bin Chen, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Information Processing Letters 111 (2011) 235-238. (*) Xirong Xu, Wenhua Zhai, Jun-Ming Xu, Aihua Deng, Yuansheng Yang, Fault-tolerant edge-pancyclicity of locally twisted cubes, Information Sciences 181 (2011) 2268-2277. (*) Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Discrete Applied Mathematics 159 (2011) 1254-1263. (*) Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Independent spanning trees on even networks, Information Sciences 181 (2011) 2892-2905. (*) Ruo-Wei Hung, Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes, Theoretical Computer Science 412 (2011) 4747-4753. (*) Yan Wang, Jianxi Fan, Guodong Zhou, Xiaohua Jia, Independent spanning trees on twisted cubes, Journal of Parallel and Distributed Computing 72 (2012) 58-69. (*) Xiaofan Yang, Lei Wang, Luxing Yang, Optimal broadcasting for locally twisted cubes, Information Processing Letters 112 (2012) 129-134. (*) Yan Wang, Jianxi Fan, Xiaohua Jia, He Huang, An algorithm to construct independent spanning trees on parity cubes, Theoretical Computer Science 465 (2012) 61-72. (*) S. Femmam, JM. F. Zerarka, M. I. Benakila, New approach construction for wireless ZigBee sensor based on embedding pancake graphs, Network and Communication Technologies 1 (2012) 7-25. Yan-Hong Zhang, Wei Hao, Tao Xiang, Independent spanning trees in crossed cubes, Information Processing Letters 113 (2013) 653-658. (*) Yuejuan Han, Jianxi Fan, Shukui Zhang Changing the diameter of the locally twisted cube, International Journal of Computer Mathematics 90 (2013) 497-510. Xie-Bin Chen, Construction of optimal independent spanning trees on folded hypercubes, Information Sciences 253 (2013) 147-156. (*) Jinn-Shyong Yang, Jou-Ming Chang, Optimal independent spanning trees on Cartesian product of hybrid graphs, The Computer Journal 57 (2014) 93-99. (*) Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Hung-Chang Chan, Embedding two disjoint multi-dimensional meshes into locally twisted cubes, Journal of Internet Technology. (*) Times cited: 12 (from Web of Science) -->\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang,<a title=\"http:\/\/dx.doi.org\/10.1142\/S0129054110007143\" href=\"http:\/\/dx.doi.org\/10.1142\/S0129054110007143\"> Constructing Multiple Independent Spanning Trees on Recursive Circulant Graphs G(2^m, 2)<\/a>,\u00a0<span class=\"style15\"><em>International Journal of Foundations of Computer Science<\/em>, Vol. 21, No. 1, (2010\/2) pp.73-90. (SCIE, IF: 0.523)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 100\/103 --><br \/>\n<!-- Jinn-Shyong Yang, Jou-Ming Chang, Hung-Chang Chan, Independent spanning trees on folded hypercubess, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 601-605. Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Information Processing Letters 109 (2009) 1197-1201. (*) Jinn-Shyong Yang, Jou-Ming Chang, Independent spanning trees on folded hyper-Stars, Networks 56 (2010) 272-281. (*) Xie-Bin Chen, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Information Processing Letters 111 (2011) 235-238. (*) Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Discrete Applied Mathematics 159 (2011) 1254-1263. (*) Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Optimal independent spanning trees on odd graphs, The Journal of Supercomputing 56 (2011) 212-225. Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Independent spanning trees on even networks, Information Sciences 181 (2011) 2892-2905. (*) Shyue-Ming Tang, Yue-Li Wang, and Chien-Yi Li, Generalized recursive circulant graphs, IEEE Transactions on Computers 23 (2012) 87-93. (*) Shyue-Ming Tang, Construct independent spanning trees on chordal rings with multiple chords, Smart Innovation, Systems and Technologies 20 (2013) 481-490. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Bangrui Chen, Constructive algorithm of independent spanning trees on M\u00f6bius cubes, The Computer Journal 56 (2013) 1347-1362. (*) Xie-Bin Chen, Construction of optimal independent spanning trees on folded hypercubes, Information Sciences 253 (2013) 147-156. (*) Jinn-Shyong Yang, Jou-Ming Chang, Optimal independent spanning trees on Cartesian product of hybrid graphs, The Computer Journal 57 (2014) 93-99. (*) Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang, A fully parallelized scheme of constructing independent spanning trees on M\u00f6bius cubes, Journal of Supercomputing71 (2015) 894-908. (*) Times cited: 10 (from Web of Science) -->\n<\/li>\n<li>\n<p>Shyue-Ming Tang, <u>Jinn-Shyong Yang<\/u>, Yue-Li Wang, Jou-Ming Chang,<a title=\"http:\/\/dx.doi.org\/10.1109\/TC.2009.98\" href=\"http:\/\/dx.doi.org\/10.1109\/TC.2009.98\"> Independent Spanning Trees on Multidimensional Torus Networks<\/a>,\u00a0<span class=\"style15\"><em>IEEE Transactions on Computers<\/em>, Vol. 59, No. 1, (2010\/1) pp. 93-102. (SCIE, IF: 2.711)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, HARDWARE & ARCHITECTURE 8\/52 --><br \/>\n<!-- Sun-Yuan Hsieh, Chang-Jen Tu, Constructing edge-disjoint spanning trees in locally twisted cubes, Theoretical Computer Science 410 (2009) 926-932. Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, Constructing multiple independent spanning trees on recursive circulant graphs, International Journal of Foundations of Computer Science 21 (2010) 73-90. Jinn-Shyong Yang, Jou-Ming Chang, Hung-Chang Chan, Independent spanning trees on folded hypercubess, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 601-605. Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Information Processing Letters 109 (2009) 1197-1201. (*) Ming-Chien Yang, Constructing edge-disjoint spanning trees in twisted cubes, Information Sciences 180 (2010) 4075-4083. (*) Jinn-Shyong Yang, Jou-Ming Chang, Independent spanning trees on folded hyper-Stars, Networks 56 (2010) 272-281. (*) Xie-Bin Chen, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Information Processing Letters 111 (2011) 235-238. (*) Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Discrete Applied Mathematics 159 (2011) 1254-1263. (*) Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Optimal independent spanning trees on odd graphs, The Journal of Supercomputing 56 (2011) 212-225. Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Independent spanning trees on even networks, Information Sciences 181 (2011) 2892-2905. (*) Chuanxiong Guo, Guohan Lu, Yongqiang Xiong, Jiaxin Cao, Yibo Zhu, Chen Chen, Yongguang Zhang, Datacast: a scalable and efficient group data delivery service for data centers, Report from Microsoft Research Asia Toru Hasunuma, Chie Morisaka, Completely independent spanning trees in torus networks, Networks 60 (2012) 59-69. (*) Yan Wang, Jianxi Fan, Xiaohua Jia, He Huang, An algorithm to construct independent spanning trees on parity cubes, Theoretical Computer Science 465 (2012) 61-72. (*) Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Independent spanning trees in crossed cubes, Information Sciences 233 (2013) 276-289. (*) Yan-Hong Zhang, Wei Hao, Tao Xiang, Independent spanning trees in crossed cubes, Information Processing Letters 113 (2013) 653-658. (*) Shyue-Ming Tang, Construct independent spanning trees on chordal rings with multiple chords, Smart Innovation, Systems and Technologies 20 (2013) 481-490. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Bangrui Chen, Constructive algorithm of independent spanning trees on M\u00f6bius cubes, The Computer Journal 56 (2013) 1347-1362. (*) Xie-Bin Chen, Construction of optimal independent spanning trees on folded hypercubes, Information Sciences 253 (2013) 147-156. (*) Jinn-Shyong Yang, Jou-Ming Chang, Optimal independent spanning trees on Cartesian product of hybrid graphs, The Computer Journal 57 (2014) 93-99. (*) Hee-Chul Kim, Hyeong-Seok Lim, Jung-Heum Park An approach to conditional diagnosability analysis underthePMC model and its application to torus networks, Theoretical Computer Science 548 (2012) 98-116. (*) Xie-Bin Chen, Panconnectivity and edge-pancyclicity of multidimensional torus networks, Discrete Applied Mathematics 178 (2014) 33-45. (*) Eduardo Sant'Ana da Silv\u00e1, Andre Luiz Pires Guedes, Eduardo Todt, Independent spanning trees on systems-on-chip hypercubes routing, International Scholarly and Scientific Research & Innovation 7(3) (2013) 494-497. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Dimensional-permutation-based independent spanning trees in bijective connection networks, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 45-53. (*) Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang, A fully parallelized scheme of constructing independent spanning trees on M\u00f6bius cubes, Journal of Supercomputing71 (2015) 894-908. (*) Times cited: 17 (from Web of Science) -->\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang,<a title=\"http:\/\/dx.doi.org\/10.1016\/j.tcs.2008.12.042\" href=\"http:\/\/dx.doi.org\/10.1016\/j.tcs.2008.12.042\"> On the Independent Spanning Trees of Recursive Circulant Graphs G(cd^m,d) with d > 2<\/a>,\u00a0<span class=\"style15\"><em>Theoretical Computer Science<\/em>, Vol. 410, No. 21-23 (2009\/5), pp. 2001-2010. (SCIE, IF:0.747)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 77\/103 --><br \/>\n<!-- Shyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang, Independent Spanning Trees on Multidimensional Torus Networks, IEEE Transactions on Computers 59 (2010) 93-102. (*) Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, Constructing multiple independent spanning trees on recursive circulant graphs G(2^m,2), International Journal of Foundations of Computer Science 21 (2010) 73-90. (*) Jinn-Shyong Yang, Jou-Ming Chang, Hung-Chang Chan, Independent spanning trees on folded hypercubess, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 601-605. Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Information Processing Letters 109 (2009) 1197-1201. (*) Ming-Chien Yang, Constructing edge-disjoint spanning trees in twisted cubes, Information Sciences 180 (2010) 4075-4083. (*) Jinn-Shyong Yang, Jou-Ming Chang, Independent spanning trees on folded hyper-Stars, Networks 56 (2010) 272-281. (*) Xie-Bin Chen, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Information Processing Letters 111 (2011) 235-238. (*) Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Optimal independent spanning trees on odd graphs, The Journal of Supercomputing 56 (2011) 212-225. (*) Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Discrete Applied Mathematics 159 (2011) 1254-1263. (*) Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Independent spanning trees on even networks, Information Sciences 181 (2011) 2892-2905. (*) Sook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park, Disjoint path covers in recursive circulants G(2^m, 4) with faulty elements, Theoretical Computer Science 412 (2011) 4636-4649. (*) Shyue-Ming Tang, Yue-Li Wang, and Chien-Yi Li, Generalized recursive circulant graphs, IEEE Transactions on Computers 23 (2012) 87-93. (*) Toru Hasunuma, Chie Morisaka, Completely independent spanning trees in torus networks, Networks 60 (2012) 59-69. (*) Ming-Chien Yang, Conditional diagnosability of matching composition networks under the MM* model, Information Sciences 233 (2013) 230-243. (*) Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Independent spanning trees in crossed cubes, Information Sciences 233 (2013) 276-289. (*) Shyue-Ming Tang, Construct independent spanning trees on chordal rings with multiple chords, Smart Innovation, Systems and Technologies 20 (2013) 481-490. Sook-Yeon Kim, Jung-Heum Park, Paired many-to-many disjoint path covers in recursive circulants G(2^m,4), IEEE Transactions on Computers 62 (2013) 2468-2475. (*) Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Bangrui Chen, Constructive algorithm of independent spanning trees on M\u00f6bius cubes, The Computer Journal 56 (2013) 1347-1362. (*) Xie-Bin Chen, Construction of optimal independent spanning trees on folded hypercubes, Information Sciences 253 (2013) 147-156. (*) Jinn-Shyong Yang, Jou-Ming Chang, Optimal independent spanning trees on Cartesian product of hybrid graphs, The Computer Journal 57 (2014) 93-99. (*) Eduardo Sant'Ana da Silv\u00e1, Andre Luiz Pires Guedes, Eduardo Todt, Independent spanning trees on systems-on-chip hypercubes routing, International Scholarly and Scientific Research & Innovation 7(3) (2013) 494-497. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Dimensional-permutation-based independent spanning trees in bijective connection networks, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 45-53. (*) Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang, A fully parallelized scheme of constructing independent spanning trees on M\u00f6bius cubes, Journal of Supercomputing71 (2015) 894-908. (*) Times cited: 20 (from Web of Science) -->\n<\/li>\n<li>\n<p>Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, <a title=\"http:\/\/dx.doi.org\/10.1016\/j.amc.2007.08.010\" href=\"http:\/\/dx.doi.org\/10.1016\/j.amc.2007.08.010\"> Fault-Tolerant Cycle-Embedding in Alternating Group Graphs<\/a>,\u00a0<span class=\"style15\"><em>Applied Mathematics and Computation<\/em>, Vol. 197, No. 2, (2008\/6) pp. 760-767. (SCIE, IF:3.472)<\/span><\/p>\n<p><!-- MATHEMATICS, APPLIED 21\/252 --><br \/>\n<!-- Habib Rostami, Jafar Habibi, Minimum linear arrangement of chord graphs, Applied Mathematics and Computation 203 (2008) 358-367. (*) Yuan-Kang Shih, Yi-Chien Wu, Shin-Shin Kao, Jimmy J.M. Tan, Vertex-bipancyclicity of the generalized honeycomb tori, Computers & Mathematics with Applications 56 (2008) 2848-2860. (*) Ping-Ying Tsai, Jung-Sheng Fu, Gen-Heuy Chen, Embedding hamiltonian cycles in alternating group graphs under conditional fault model, Information Sciences 179 (2009) 851-857. (*) Hung-Chang Chan, Jou-Ming Chang, Yue-Li Wang, Shi-Jinn Horng, Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented Cubes, Applied Mathematics and Computation 207 (2009) 333-339. (*) Jung-Sheng Fu, Fault-free vertex-pancyclicity in faulty augmented cubes, Proceedings of the 26th Workshop on Combinatorial Mathematics and Computation Theory, Chaiyi, Taiwan, April 24-25, 2009, pp. 59-63. Jun-Ming Xu, Meijie Ma, Survey on path and cycle embedding in some networks, Frontiers of Mathematics in China 4 (2009) 217-252. (*) Tsong-Jie Lin, Embedding cycles and paths into k-ary n-cubes, Ph.D. Dissertation, National Cheng Kung University, Tainan, Taiwan, 2009. Zhan-Jun Xue, San-Yang Liu, An optimal result on fault-tolerant cycle-embedding in alternating group graphs, Information Processing Letters 109 (2009) 1197-1201. (*) Yuejuan Han, Jianxi Fan, Jiwen Yang, Peide Qian, Path embedding in faulty locally twisted cubes, Proceedings of the 2nd IEEE International Conference on Computer Science and Information Technology, (ICCSIT 2009), Beijing, China, Aug 8-11, 2009, pp. 214-218. Jung-Sheng Fu, Edge-fault-tolerant vertex-pancyclicity of augmented cubes, Information Processing Letters 110 (2010) 439\u2013443. (*) Yi-Ching Chen, Dyi-Rong Duh, Two-node-Hamiltonicity of enhanced pyramid networks, Information Sciences 180 (2010) 2588-2595. (*) Jung-Sheng Fu, Fault-free vertex-pancyclicity in twisted cubes with faulty edges, Proceedings of the International Multiconference of Engineers and Computer Scientists (IMECS 2010), Hong Kong, March 17-19, 2010, pp. 430-435. Yuejuan Han, Jianxi Fan, Shukui Zhang, Jiwen Yang, Peide Qian, Embedding meshes into locally twisted cubes, Information Sciences 180 (2010) 3794-3805. (*) Ping-Ying Tsai, Cycle embedding in alternating group graphs with faulty vertices and faulty edges, 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010), University of Cologne, Germany, 25-27 May 2010, pp. 169-172. Andrzej Szepietowski, Fault-tolerant edge and vertex pancyclicity in alternating group graphs, Applied Mathematics and Computation 217 (2010) 2827-2832. (*) Jin-Xin Zhou The automorphism group of the alternating group graph, Applied Mathematics Letters 24 (2011) 229-231. (*) Ping-Ying Tsai A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphsh, Information Processing Letters 111 (2011) 375-378. (*) Andrzej Szepietowski, Fault tolerance of vertex pancyclicity in alternating group graphs, Applied Mathematics and Computation 217 (2011) 6785-6791. (*) Jung-Sheng Fu, Optimal edge-fault-tolerant vertex-pancyclicity of augmented cubes, Proceedings of the International MultiConference of Engineers and Computer Scientists, Vol. 1, (IMECS 2011), Hong Kong, March 16-18, 2011, pp. 217-222. Xi Wang, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Jia Yu, Embedding meshes into twisted-cubes, Information Sciences 181 (2011) 3085\u20133099. (*) Jung-Sheng Fu, Vertex-pancyclicity of twisted cubes with maximal faulty edges, International Journal of Computer Mathematics 89 (2012) 728-740. (*) Shiying Wang, Kai Feng, Shurong Zhang, Jing Li, Embedding long cycles in faulty k-ary 2-cubes, Applied Mathematics and Computation 218 (2012) 5409\u20135413. (*) Andrzej Szepietowski, Fault tolerance of edge pancyclicity in alternating group graphs, Applied Mathematics and Computation 218 (2012) 9875\u20139881. (*) Rong-Xia Hao, Yan-Quan Feng, Jin-Xin Zhou, Conditional diagnosability of alternating group graphs, IEEE Transactions on Computers 62 (2013) 827-831. (*) Jung-Sheng Fu, Vertex-pancyclicity of augmented cubes with maximal faulty edges, Information Sciences 275 (2014) 257-266. (*) Rong-Xia Hao, Ru Zhang, Yan-Quan Feng, Jin-Xin Zhou, Hamiltonian cycle embedding for fault tolerance in balanced hypercubes, Applied Mathematics and Computation 244 (2014) 447\u2013456. (*) Lantao You, Yuejuan Han, An algorithm to embed a family of node-disjoint 3D meshes into locally twisted cubes, Proceedings of 14th International Conference of Algorithms and Architectures for Parallel Processing (ICA3PP 2014) Part II, Dalian, China, August 24-27, 2014, LNCS 8631, pp. 214-218. (*) Lantao You, Jianxi Fan, Yuejuan Han, Xiaohua Jia, One-to-one disjoint path covers on alternating group graphs, Theoretical Computer Science 562 (2015) 146-164. (*) Chang-Hsiung Tsai, The pessimistic diagnosability of alternating group graphs under the PMC model, Information Sciences 115 (2015) 151-154. (*) Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Hung-Chang Chan, Embedding two disjoint multi-dimensional meshes into locally twisted cubes, Journal of Internet Technology. (*) Chia-Wen Cheng, Sun-Yuan Hsieh, Fault-tolerant cycle embedding in Cartesian product graphs: edge-pancyclicity and edge-bipancyclicity with faulty edges, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 2997-3011. (*) Limei Lin, Shuming Zhou, Li Xu, Dajin Wang, The extra connectivity and conditional diagnosability of alternating group networks, IEEE Transactions on Parallel and Distributed Systems. (*) Times cited: 26 (from Web of Science) -->\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang,<a title=\"http:\/\/dx.doi.org\/10.1109\/TPDS.2007.351709\" href=\"http:\/\/dx.doi.org\/10.1109\/TPDS.2007.351709\"> Reducing the Height of Independent Spanning Trees in Chordal Rings<\/a>,\u00a0<span class=\"style15\"><em>IEEE Transaction on Parallel and Distributed Systems<\/em>, Vol. 18, No. 5, (2007\/5) pp. 644-657. (SCIE, IF:2.600)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 8\/103 --><br \/>\n<!-- ENGINEERING, ELECTRICAL & ELECTRONIC 36\/262 --><br \/>\n<!-- Jinn-Shyong Yang, Shyue-Ming Tang, Jou-Ming Chang, Yue-Li Wang, Parallel construction of optimal independent spanning trees on hypercubes, Parallel Computing 33 (2007) 73-79. Sun-Yuan Hsieh, Chang-Jen Tu, Constructing edge-disjoint spanning trees in locally twisted cubes, Theoretical Computer Science 410 (2009) 926-932. Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, On the independent spanning trees of recursive circulant graphs G(cd^m, d) with d > 2, Theoretical Computer Science 410 (2009) 2001-2010. (*)\nShyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang, Independent Spanning Trees on Multidimensional Torus Networks, IEEE Transactions on Computers 59 (2010) 93-102. (*)\nJinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, Constructing multiple independent spanning trees on recursive circulant graphs G(2^m,2), International Journal of Foundations of Computer Science 21 (2010) 73-90. (*)\nYi-Jiun Liu, Well Y. Chou, James K. Lan, Chiuyuan Chen, Constructing independent spanning trees for hypercubes and locally twisted cubes, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 17-22. (*)\nJinn-Shyong Yang, Jou-Ming Chang, Hung-Chang Chan, Independent spanning trees on folded hypercubess, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 601-605. (*)\nJia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Information Processing Letters 109 (2009) 1197-1201. (*)\nMing-Chien Yang, Constructing edge-disjoint spanning trees in twisted cubes, Information Sciences 180 (2010) 4075-4083.\nJinn-Shyong Yang, Jou-Ming Chang, Independent spanning trees on folded hyper-Stars, Networks 56 (2010) 272-281. (*)\nXie-Bin Chen, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Information Processing Letters 111 (2011) 235-238. (*)\nJong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Optimal independent spanning trees on odd graphs, The Journal of Supercomputing 56 (2011) 212-225. (*)\nYi-Jiun Liu, James K. Lan, Well Y. Chou, Chiuyuan Chen, Constructing independent spanning trees for locally twisted cubes, Theoretical Computer Science 412 (2011) 2237-2252. (*)\nJinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Discrete Applied Mathematics 159 (2011) 1254-1263. (*)\nJong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Independent spanning trees on even networks, Information Sciences 181 (2011) 2892-2905. (*)\nR. Seethalakshml, K. S. Ravichandran, Reliability analysis of ring, agent and cluster based distributed systems, Journal of Theoretical and Applied Information Technology 30 (2011) 42-47.\nYan Wang, Jianxi Fan, Yuejuan Han, Construction of independent spanning trees on twisted-cubes, Proceedings of 2011 IEEE International Conference on Computer Science and Automation Engineering (CSAE), Shanghai, China, 10-12 June 2011, pp. 250-254.\nYan Wang, Jianxi Fan, Yuejuan Han, An algorithm to find optimal independent spanning trees on twisted-cubes, Proceedings of 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP), Suzhou, China, 9-11 Dec. 2011, pp. 52-56.\nJeeraporn Werapun, Sarun Intakosum, Veera Boonjing, An efficient parallel construction of optimal independent spanning trees on hypercubes, Journal of Parallel and Distributed Computing 72 (2012) 1713-1724. (*)\nBaolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Independent spanning trees in crossed cubes, Information Sciences 233 (2013) 276-289. (*)\nShyue-Ming Tang, Construct independent spanning trees on chordal rings with multiple chords, Smart Innovation, Systems and Technologies 20 (2013) 481-490.\nYan-Hong Zhang, Wei Hao, Tao Xiang, Independent spanning trees in crossed cubes, Information Processing Letters 113 (2013) 653-658. (*)\nBaolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Bangrui Chen, Constructive algorithm of independent spanning trees on M\u00f6bius cubes, The Computer Journal 56 (2013) 1347-1362. (*)\nXie-Bin Chen, Construction of optimal independent spanning trees on folded hypercubes, Information Sciences 253 (2013) 147-156. (*)\nJinn-Shyong Yang, Jou-Ming Chang, Optimal independent spanning trees on Cartesian product of hybrid graphs, The Computer Journal 57 (2014) 93-99. (*)\nBaolei Cheng, Jianxi Fan, Jiwen Yang, Xi Wang, Circular dimensional-permutations and reliable broadcasting for hypercubes and M\u00f6bius Cubes, 10th IFIP International Conference on Network and Parallel Computing (NPC 2013), Lecture Notes in Computer Science Volume 8147, 2013, pp 232-244. (*)\nWan Tang, Ximin Yang, Jingcong Li, Zilong Ye, Dynamical Multicast Light-Tree Construction in Intra-Datacenter Networks with Fast Optical Switching, Journal of Internet Technology 15 (2014) 679-684. (*)\nAlexandre Salles da Cunha, Fernanda Sumika Hojo de Souza, Finding totally independent spanning trees with linear integer programming, Third International Symposium on Combinatorial Optimization, (ISCO 2014) Lisbon, Portugal, March 5-7, 2014, Lecture Notes in Computer Science Vol. 8596, pp. 149-160.\nEduardo Sant'Ana da Silv\u00e1, Andre Luiz Pires Guedes, Eduardo Todt, Independent spanning trees on systems-on-chip hypercubes routing, International Scholarly and Scientific Research & Innovation 7(3) (2013) 494-497.\nBaolei Cheng, Jianxi Fan, Xiaohua Jia, Dimensional-permutation-based independent spanning trees in bijective connection networks, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 45-53. (*)\nJinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang, A fully parallelized scheme of constructing independent spanning trees on M\u00f6bius cubes, Journal of Supercomputing71 (2015) 894-908. (*)\nYu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang, A fast parallel algorithm for constructing independent spanning trees on parity cubes, Applied Mathematics and Computation 268 (2015) 489-495. (*)\nJinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan, Parallel construction of independent spanning trees on enhanced hypercubes, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 3090-3098. (*)\nTimes cited: 29 (from Web of Science)\n-->\n<\/li>\n<li>\n<p><u>Jinn-Shyong Yang<\/u>, Shyue-Ming Tang, Jou-Ming Chang, Yue-Li Wang,<a title=\"http:\/\/dx.doi.org\/10.1016\/j.parco.2006.12.001\" href=\"http:\/\/dx.doi.org\/10.1016\/j.parco.2006.12.001\"> Parallel Construction of Optimal Independent Spanning Trees on Hypercubes<\/a>,\u00a0<span class=\"style15\"><em>Parallel Computing<\/em>, Vol. 33, No. 1, (2007\/2) pp. 73-79. (SCIE, IF:1.119)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, THEORY & METHODS 63\/103 --><br \/>\n<!-- Sun-Yuan Hsieh, Chang-Jen Tu, Constructing edge-disjoint spanning trees in locally twisted cubes, Theoretical Computer Science 410 (2009) 926-932. (*) Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, On the independent spanning trees of recursive circulant graphs G(cd^m, d) with d > 2, Theoretical Computer Science 410 (2009) 2001-2010. (*)\nShyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang, Independent Spanning Trees on Multidimensional Torus Networks, IEEE Transactions on Computers 59 (2010) 93-102. (*)\nJinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, Constructing multiple independent spanning trees on recursive circulant graphs G(2^m,2), International Journal of Foundations of Computer Science 21 (2010) 73-90. (*)\nYi-Jiun Liu, Well Y. Chou, James K. Lan, Chiuyuan Chen, Constructing independent spanning trees for hypercubes and locally twisted cubes, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 17-22. (*)\nJinn-Shyong Yang, Jou-Ming Chang, Hung-Chang Chan, Independent spanning trees on folded hypercubess, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 601-605. (*)\nJia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Information Processing Letters 109 (2009) 1197-1201. (*)\nMing-Chien Yang, Constructing edge-disjoint spanning trees in twisted cubes, Information Sciences 180 (2010) 4075-4083. (*)\nJinn-Shyong Yang, Jou-Ming Chang, Independent spanning trees on folded hyper-Stars, Networks 56 (2010) 272-281. (*)\nXie-Bin Chen, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Information Processing Letters 111 (2011) 235-238. (*)\nJong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Optimal independent spanning trees on odd graphs, The Journal of Supercomputing 56 (2011) 212-225. (*)\nYi-Jiun Liu, James K. Lan, Well Y. Chou, Chiuyuan Chen, Constructing independent spanning trees for locally twisted cubes, Theoretical Computer Science 412 (2011) 2237-2252. (*)\nJinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Discrete Applied Mathematics 159 (2011) 1254-1263. (*)\nJong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L\u00e1szl\u00f3 Lipt\u00e1k, Independent spanning trees on even networks, Information Sciences 181 (2011) 2892-2905. (*)\nCheng-Nan Lai, An optimal construction of node-disjoint shortest paths in hypercubes, Proceedings of the 28th Workshop on Combinatorial Mathematics and Computation Theory, Penghu,, Taiwan, May 27-28, 2011, pp. 245-253.\nR. K. Dash, C.R. Tripathy, Comparative analysis on reliability of hypercube and torus topologies under link failure model, International Journal of Advancements in Computer Science and Information Technology 1 (2011) 1-9.\nChuanxiong Guo, Guohan Lu, Yongqiang Xiong, Jiaxin Cao, Yibo Zhu, Chen Chen, Yongguang Zhang, Datacast: a scalable and efficient group data delivery service for data centers, Report MSR-TR-2011-76 from Microsoft Research Asia (2011).\nYan Wang, Jianxi Fan, Guodong Zhou, Xiaohua Jia, Independent spanning trees on twisted cubes, Journal of Parallel and Distributed Computing 72 (2012) 58-69. (*)\nToru Hasunuma, Chie Morisaka, Completely independent spanning trees in torus networks, Networks 60 (2012) 59-69. (*)\nJeeraporn Werapun, Sarun Intakosum, Veera Boonjing, An efficient parallel construction of optimal independent spanning trees on hypercubes, Journal of Parallel and Distributed Computing 72 (2012) 1713-1724. (*)\nBaolei Cheng, Jianxi Fan, Xiaohua Jia, Jin Wang, Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes, Journal of Parallel and Distributed Computing 73 (2013) 641-652. (*)\nShyue-Ming Tang, Construct independent spanning trees on chordal rings with multiple chords, Smart Innovation, Systems and Technologies 20 (2013) 481-490.\nYan-Hong Zhang, Wei Hao, Tao Xiang, Independent spanning trees in crossed cubes, Information Processing Letters 113 (2013) 653-658. (*)\nBaolei Cheng, Jianxi Fan, Xiaohua Jia, Juncheng Jia, Parallel construction of independent spanning trees and an application in diagnosis on M\u00f6bius cubes, Journal of Supercomputing 65 (2013) 1279-1301. (*)\nBaolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Bangrui Chen, Constructive algorithm of independent spanning trees on M\u00f6bius cubes, The Computer Journal 56 (2013) 1347-1362. (*)\nXie-Bin Chen, Construction of optimal independent spanning trees on folded hypercubes, Information Sciences 253 (2013) 147-156. (*)\nJinn-Shyong Yang, Jou-Ming Chang, Optimal independent spanning trees on Cartesian product of hybrid graphs, The Computer Journal 57 (2014) 93-99. (*)\nBaolei Cheng, Jianxi Fan, Jiwen Yang, Xi Wang, Circular dimensional-permutations and reliable broadcasting for hypercubes and M\u00f6bius Cubes, 10th IFIP International Conference on Network and Parallel Computing (NPC 2013), Lecture Notes in Computer Science Volume 8147, 2013, pp 232-244. (*)\nWan Tang, Ximin Yang, Jingcong Li, Zilong Ye, Dynamical Multicast Light-Tree Construction in Intra-Datacenter Networks with Fast Optical Switching, Journal of Internet Technology 15 (2014) 679-684. (*)\nAlexandre Salles da Cunha, Fernanda Sumika Hojo de Souza, Finding totally independent spanning trees with linear integer programming, Third International Symposium on Combinatorial Optimization, (ISCO 2014) Lisbon, Portugal, March 5-7, 2014, Lecture Notes in Computer Science Vol. 8596, pp. 149-160.\nEduardo Sant'Ana da Silv\u00e1, Andre Luiz Pires Guedes, Eduardo Todt, Independent spanning trees on systems-on-chip hypercubes routing, International Scholarly and Scientific Research & Innovation 7(3) (2013) 494-497.\nBaolei Cheng, Jianxi Fan, Xiaohua Jia, Dimensional-permutation-based independent spanning trees in bijective connection networks, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 45-53. (*)\nJinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang, A fully parallelized scheme of constructing independent spanning trees on M\u00f6bius cubes, Journal of Supercomputing71 (2015) 894-908. (*)\nYu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang, A fast parallel algorithm for constructing independent spanning trees on parity cubes, Applied Mathematics and Computation 268 (2015) 489-495. (*)\nJinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan, Parallel construction of independent spanning trees on enhanced hypercubes, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 3090-3098. (*)\nTimes cited: 29 (from Web of Science)\n-->\n<\/li>\n<li>\n<p>Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, Yue-Li Wang, Yuwen Cheng,<a title=\"http:\/\/dx.doi.org\/10.1002\/net.20039\" href=\"http:\/\/dx.doi.org\/10.1002\/net.20039\"> Panconnectivity, Fault-tolerant Hamiltonicity and Hamiltonian-connectivity in Alternating Group Graphs<\/a>,\u00a0<span class=\"style15\"><em>Networks<\/em>, Vol. 44, No. 4, (2004\/12) pp. 302-310. (SCIE, IF:2.602)<\/span><\/p>\n<p><!-- COMPUTER SCIENCE, HARDWARE & ARCHITECTURE 35\/52 --><br \/>\n<!-- OPERATIONS RESEARCH & MANAGEMENT SCIENCE 59\/84 -->\n<\/li>\n<\/ol>\n<p>(B) Conference papers:<\/p>\n<ol>\n<li>Xiang-Rui Chen, Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, Connectivity of Locally Exchanged Twisted Cubes, <em>Proceeding of the 32th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2015), <span class=\"style15\">May. 1-2, Taichung, Taiwan, (2015) pp. 118-123.<\/span><\/li>\n<li>Hung-Yi Chang, Hung-Lung Wang, <u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, A Note on the Degree Condition of Completely Independent Spanning Trees, <em>Proceeding of the 32th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2015), <span class=\"style15\">May. 1-2, Taichung, Taiwan, (2015) pp. 47-50<\/span><\/li>\n<li>Shyue-Ming Tang, <u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, Yue-Li Wang, A one-to-many parallel routing algorithm on a generalized recursive circulant graph, <em>Proceeding of the 31th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2014), <span class=\"style15\">Apr. 25-26, Taipei, Taiwan, (2014) pp. 29-36.<\/span><\/li>\n<li>Jhen-Ding Wang, Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, Kun-Fu Ding, Independent spanning trees on crossed cubes, <em>Proceeding of the 31th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2014), <span class=\"style15\">Apr. 25-26, Taipei, Taiwan, (2014) pp. 66-72.<\/span><\/li>\n<li>Zih-Syuan Syu, <u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, On the incidence ranking of paths, cycles and grids, <em>Proceeding of the 31th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2014), <span class=\"style15\">Apr. 25-26, Taipei, Taiwan, (2014) pp. 148-155.<\/span><\/li>\n<li>Meng-Ru Wu, <u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, An-Hang Chen, A fully parallelized scheme of constructing independent spanning trees on Mobius cubes, <em>Proceeding of the 31th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2014), <span class=\"style15\">Apr. 25-26, Taipei, Taiwan, (2014) pp. 275-281.<\/span><\/li>\n<li>Kung-Jui Pai, Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, Ro-Yu Wu, Some Results on the Incidence Coloring Number of Hypercubes,<br \/>\n<em>Proceedings of National Computer Symposium<\/em> (NCS 2013),<span class=\"style15\"> Taichung, Taiwan (2013), Dec. 13-14, pp. PDCC_100-PDCC_103.<\/span><\/li>\n<li>Sing-Chen Yao, <u>Jinn-Shyong Yang<\/u>, Shyue-Ming Tang, Jou-Ming Chang, A Preliminary Result of Completely Independent Spanning Trees on Chordal Rings, <em>Proceeding of the 30th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2013), <span class=\"style15\">Apr. 26-27, Hualien, Taiwan, (2013) pp. 180-185.<\/span><\/li>\n<li>Kung-Jui Pai, Shyue-Ming Tang, Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u> <a title=\"http:\/\/dx.doi.org\/10.1007\/978-3-642-35452-6_13\" href=\"http:\/\/dx.doi.org\/10.1007\/978-3-642-35452-6_13\">Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs<\/a>, <em>Proceedings of the International Computer Symposium <\/em> (ICS 2012), <span class=\"style15\">Dec. 12-14, Hualien, Taiwan, (2012) pp. 107-113. <\/span><\/li>\n<li><u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, Independent Spanning Trees on Cartesian Product of Hybrid Graphs, <em>Proceeding of the 29th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2012), <span class=\"style15\">Apr. 27-28, Taipei, Taiwan, (2012) pp. 82-88.<\/span><\/li>\n<li>Li-Cheng Yu, <u>Jinn-Shyong Yang<\/u>, An-Hang Chen, Jou-Ming Chang, Domination number of directed tori C_8 x C_n, <em>Proceeding of the 28th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2011), <span class=\"style15\">May. 27-28, Penghu, Taiwan, (2011) pp. 345-349.<\/span><\/li>\n<li>Li-Cheng Yu, <u>Jinn-Shyong Yang<\/u>, An-Hang Chen, Jou-Ming Chang, Domination number of Cartesian products of directed cycles C_7 x C_n, <em>Proceedings of 4th Annual Meeting of Asian Association for Algorithms and Computation<\/em> (AAAC 2011), <span class=\"style15\">Apr. 16-17, Hsinchu, Taiwan, (2011).<\/span><\/li>\n<li>Cheng-Yi Lin, Jou-Ming Chang, <u>Jinn-Shyong Yang<\/u>, Hung-Chang Chan, Embedding a family of two disjoint multi-dimensional meshes into locally twisted cubes, <em>Proceeding of the 27th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2010), <span class=\"style15\">Apr. 30-May 1, Taichung, Taiwan, (2010) pp. 112-117.<\/span><\/li>\n<li><u>Jinn-Shyong Yang<\/u>, Hung-Chang Chan, Jou-Ming Chang, Independent spanning trees on folded hypercubes, <em>Proceedings of 10th International Symposium on Pervasive Systems, Algorithms, and Networks<\/em> (I-SPAN 2009), <span class=\"style15\">Dec. 14-16, Kaoshiung, Taiwan, (2009) pp. 601-605.<\/span><\/li>\n<li><u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, On the independent spanning trees of recursive circulant graphs G(cd^m,d) with d>=3, <em>Proceeding of the 25th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2008), <span class=\"style15\">Apr. 25-26, Hsinchu, Taiwan, (2008) pp. 34-43.<\/span><\/li>\n<li>Shyue-Ming Tang, <u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, Yue-Li Wang, Parallel construction of independent spanning trees on multidimensional tori,\u00a0<em>Proceeding of the 24th Workshop on Combinatorial Mathematics and Computation Theory<\/em> (CMCT 2007), <span class=\"style15\">Apr. 27-28, Nantou, Taiwan, (2007) pp. 85-93.<\/span><\/li>\n<li><u>Jinn-Shyong Yang<\/u>, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, On the independent spanning trees problem in a hypercube,\u00a0<em>Proceedings of International Computer Symposium<\/em> (ICS 2006),<span class=\"style15\"> Taipei, Taiwan, (2006) pp. 734-737.<\/span><\/li>\n<li><u>Jinn-Shyong Yang<\/u>, Shyue-Ming Tang, Yue-Li Wang, Reducing the height of independent spanning trees in chordal rings,\u00a0<em>Proceedings of International Computer Symposium<\/em> (ICS 2004),<span class=\"style15\"> Taipei, Taiwan, (2004) pp. 344-349.<\/span><\/li>\n<li>Shyue-Ming Tang, <u>Jinn-Shyong Yang<\/u>, Yue-Li Wang, M. Y. Lin, Independent Spanning Trees on Recursive Circulant Graphs,\u00a0<em>Proceedings of National Computer Symposium<\/em> (NCS 2003),<span class=\"style15\"> Taichung, Taiwan, (2003) pp.1442-1449.<\/span><\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>(A) Journal Papers: Mei-Mei Gu, Jinn-Shy &hellip; <a href=\"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/2017\/10\/27\/publication-list\/\">\u95b1\u8b80\u5168\u6587 <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"aside","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-6","post","type-post","status-publish","format-aside","hentry","category-uncategorized","post_format-post-format-aside"],"_links":{"self":[{"href":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/wp-json\/wp\/v2\/posts\/6"}],"collection":[{"href":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/wp-json\/wp\/v2\/comments?post=6"}],"version-history":[{"count":35,"href":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/wp-json\/wp\/v2\/posts\/6\/revisions"}],"predecessor-version":[{"id":134,"href":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/wp-json\/wp\/v2\/posts\/6\/revisions\/134"}],"wp:attachment":[{"href":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/wp-json\/wp\/v2\/media?parent=6"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/wp-json\/wp\/v2\/categories?post=6"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ms.ntub.edu.tw\/~shyong\/index.php\/wp-json\/wp\/v2\/tags?post=6"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}