Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJou-Ming Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j119]Rong-Xia Hao
, Xiao-Wen Qin, Hui Zhang, Jou-Ming Chang:
Two-disjoint-cycle-cover pancyclicity of data center networks. Appl. Math. Comput. 475: 128716 (2024)- [j118]Shu-Li Zhao, Hengzhe Li, Jou-Ming Chang:
On the minimum size of graphs with given generalized connectivity. Discret. Appl. Math. 355: 88-95 (2024) - [j117]Min-Shu Jao, Hung-Lung Wang, Jou-Ming Chang, Chia-Wen Wu:
Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions. J. Inf. Sci. Eng. 40(2): 253-264 (2024) - [j116]Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Ximeng Liu:
Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model. J. Parallel Distributed Comput. 190: 104887 (2024) - [j115]Huimei Guo, Rong-Xia Hao, Jou-Ming Chang, Young Soo Kwon:
Hyper star structure connectivity of hierarchical folded cubic networks. J. Supercomput. 80(10): 14224-14241 (2024) - [j114]Mei-Mei Gu, Jinn-Shyong Yang, Jou-Ming Chang:
Assessing Network Reliability Through Perspectives of Neighbor Connectivity and Subversion. IEEE Trans. Netw. Sci. Eng. 11(5): 4384-4396 (2024) - 2023
- [j113]Mei-Mei Gu, Jou-Ming Chang:
Neighbor connectivity of pancake graphs and burnt pancake graphs. Discret. Appl. Math. 324: 46-57 (2023) - [j112]Shu-Li Zhao, Jou-Ming Chang, Hengzhe Li:
The generalized 4-connectivity of pancake graphs. Discret. Appl. Math. 327: 77-86 (2023) - [j111]Shu-Li Zhao, Jou-Ming Chang:
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes. Inf. Process. Lett. 182: 106377 (2023) - [j110]Mei-Mei Gu, Kung-Jui Pai, Jou-Ming Chang:
Subversion analyses of hierarchical networks based on (edge) neighbor connectivity. J. Parallel Distributed Comput. 171: 54-65 (2023) - [j109]Wanling Lin, Xiao-Yan Li, Jou-Ming Chang, Xiaohua Jia:
Constructing Multiple CISTs on BCube-Based Data Center Networks in the Occurrence of Switch Failures. IEEE Trans. Computers 72(7): 1971-1984 (2023) - [j108]Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Cheng-Kuan Lin, Ximeng Liu:
Embedding Hamiltonian Paths in $k$-Ary $n$-Cubes With Exponentially-Many Faulty Edges. IEEE Trans. Computers 72(11): 3245-3258 (2023) - [j107]Shu-Li Zhao, Jou-Ming Chang:
Reliability assessment of the divide-and-swap cube in terms of generalized connectivity. Theor. Comput. Sci. 943: 1-15 (2023) - [j106]Hongbin Zhuang, Wanling Lin, Xiao-Yan Li, Jou-Ming Chang:
Matroidal connectivity and conditional matroidal connectivity of star graphs. Theor. Comput. Sci. 977: 114173 (2023) - [j105]Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang:
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting. J. Supercomput. 79(4): 4126-4145 (2023) - [j104]Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Dajin Wang:
An Efficient Algorithm for Hamiltonian Path Embedding of $k$k-Ary $n$n-Cubes Under the Partitioned Edge Fault Model. IEEE Trans. Parallel Distributed Syst. 34(6): 1802-1815 (2023) - 2022
- [j103]Jinn-Shyong Yang, Xiao-Yan Li, Sheng-Lung Peng, Jou-Ming Chang:
Parallel construction of multiple independent spanning trees on highly scalable datacenter networks. Appl. Math. Comput. 413: 126617 (2022) - [j102]Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang:
Improved algorithms for ranking and unranking (k, m)-ary trees in B-order. J. Comb. Optim. 44(3): 1495-1510 (2022) - [j101]Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang:
Constructing tri-CISTs in shuffle-cubes. J. Comb. Optim. 44(5): 3194-3211 (2022) - [j100]Xiao-Yan Li, Wanling Lin, Wenzhong Guo, Jou-Ming Chang:
A secure data transmission scheme based on multi-protection routing in datacenter networks. J. Parallel Distributed Comput. 167: 222-231 (2022) - [j99]Kung-Jui Pai, Jinn-Shyong Yang, Guan-Yu Chen, Jou-Ming Chang:
Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks. IEEE Trans. Netw. Sci. Eng. 9(2): 932-946 (2022) - [j98]Xiao-Yan Li, Wanling Lin, Jou-Ming Chang, Xiaohua Jia:
Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks With Heterogeneous Edge-Core Servers. IEEE/ACM Trans. Netw. 30(4): 1689-1702 (2022) - [j97]Xiao-Yan Li, Wanling Lin, Ximeng Liu, Cheng-Kuan Lin, Kung-Jui Pai, Jou-Ming Chang:
Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing. IEEE Trans. Parallel Distributed Syst. 33(8): 1939-1952 (2022) - [c21]Ro-Yu Wu, Cheng-Chia Tseng, Ling-Ju Hung, Jou-Ming Chang:
Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms. ISCO 2022: 201-211 - 2021
- [j96]Yi-Cheng Yang, Shih-Shun Kao, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, Jou-Ming Chang:
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks. IEEE Access 9: 16679-16691 (2021) - [j95]Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao:
Strong Menger Connectedness of Augmented k-ary n-cubes. Comput. J. 64(5): 812-825 (2021) - [j94]Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang:
Reliability Analysis of Alternating Group Graphs and Split-Stars. Comput. J. 64(9): 1425-1436 (2021) - [j93]Chao Wei, Rong-Xia Hao, Jou-Ming Chang:
The reliability analysis based on the generalized connectivity in balanced hypercubes. Discret. Appl. Math. 292: 19-32 (2021) - [j92]Mei-Mei Gu, Jou-Ming Chang:
A Note on Super Connectivity of the Bouwer Graph. J. Interconnect. Networks 21(4): 2142009:1-2142009:8 (2021) - [j91]Chao Wei, Rong-Xia Hao, Jou-Ming Chang:
Packing internally disjoint Steiner trees to compute the κ3-connectivity in augmented cubes. J. Parallel Distributed Comput. 154: 42-53 (2021) - [j90]Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang:
A loopless algorithm for generating (k, m)-ary trees in Gray code order. Optim. Lett. 15(4): 1133-1154 (2021) - [j89]Yu-Huei Chang, Kung-Jui Pai, Chiun-Chieh Hsu, Jinn-Shyong Yang, Jou-Ming Chang:
Constructing dual-CISTs of folded divide-and-swap cubes. Theor. Comput. Sci. 856: 75-87 (2021) - [j88]Yu-Han Chen, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang:
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes. Theor. Comput. Sci. 878-879: 102-112 (2021) - [j87]Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang:
Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks. J. Supercomput. 77(1): 990-1014 (2021) - [c20]Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang:
Constructing Tri-CISTs in Shuffle-Cubes. COCOON 2021: 330-342 - [c19]Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang:
Three Edge-Disjoint Hamiltonian Cycles in Crossed Cubes with Applications to Fault-Tolerant Data Broadcasting. HPCC/DSS/SmartCity/DependSys 2021: 377-383 - [i4]Xiao-Yan Li, Wanling Lin, Jou-Ming Chang, Xiaohua Jia:
Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks with Heterogeneous Edge-Core Servers. CoRR abs/2105.11491 (2021) - 2020
- [j86]Chao Wei, Rong-Xia Hao, Jou-Ming Chang:
Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes. Appl. Math. Comput. 381: 125305 (2020) - [j85]Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao:
On Computing Component (Edge) Connectivities of Balanced Hypercubes. Comput. J. 63(9): 1311-1320 (2020) - [j84]Mei-Mei Gu, Rong-Xia Hao, Shyue-Ming Tang, Jou-Ming Chang:
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs. Discret. Appl. Math. 279: 80-91 (2020) - [j83]Xiao-Wen Qin, Rong-Xia Hao, Kung-Jui Pai, Jou-Ming Chang:
Comments on "A Hamilton sufficient condition for completely independent spanning tree". Discret. Appl. Math. 283: 730-733 (2020) - [j82]Shu-Li Zhao, Jou-Ming Chang, Rong-Xia Hao:
Reliability assessment of the Cayley graph generated by trees. Discret. Appl. Math. 287: 10-14 (2020) - [j81]Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao:
On Component Connectivity of Hierarchical Star Networks. Int. J. Found. Comput. Sci. 31(3): 313-326 (2020) - [j80]Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang:
A well-equalized 3-CIST partition of alternating group graphs. Inf. Process. Lett. 155 (2020) - [j79]Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang:
Three completely independent spanning trees of crossed cubes with application to secure-protection routing. Inf. Sci. 541: 516-530 (2020) - [j78]Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang:
A protection routing with secure mechanism in Möbius cubes. J. Parallel Distributed Comput. 140: 1-12 (2020) - [j77]Rong-Xia Hao, Mei-Mei Gu, Jou-Ming Chang:
Relationship between extra edge connectivity and component edge connectivity for regular graphs. Theor. Comput. Sci. 833: 41-55 (2020) - [j76]Xiao-Wen Qin, Rong-Xia Hao, Jou-Ming Chang:
The Existence of Completely Independent Spanning Trees for Some Compound Graphs. IEEE Trans. Parallel Distributed Syst. 31(1): 201-210 (2020) - [c18]Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang:
A Loopless Algorithm for Generating (k, m)-ary Trees in Gray-Code Order. FAW 2020: 121-132 - [c17]Shun-Yu Li, Jou-Ming Chang, Kung-Jui Pai:
A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Locally Twisted Cubes. ICS 2020: 116-119
2010 – 2019
- 2019
- [j75]Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang:
Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity. IEEE Access 7: 97745-97759 (2019) - [j74]Xiao-Wen Qin, Jou-Ming Chang, Rong-Xia Hao:
Constructing dual-CISTs of DCell data center networks. Appl. Math. Comput. 362 (2019) - [j73]Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu, Shun-Chieh Chang:
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. Discret. Appl. Math. 268: 223-236 (2019) - [j72]Yi-Xian Yang, Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang:
Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes. IEICE Trans. Inf. Syst. 102-D(12): 2409-2412 (2019) - [j71]Kung-Jui Pai, Jou-Ming Chang:
Improving the diameters of completely independent spanning trees in locally twisted cubes. Inf. Process. Lett. 141: 22-24 (2019) - [j70]Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang:
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J. Comb. Optim. 38(3): 972-986 (2019) - [j69]Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang:
The 4-component connectivity of alternating group networks. Theor. Comput. Sci. 766: 38-45 (2019) - [j68]Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang:
A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theor. Comput. Sci. 784: 65-74 (2019) - [j67]Kung-Jui Pai, Jou-Ming Chang:
Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks. IEEE/ACM Trans. Netw. 27(3): 1112-1123 (2019) - [c16]Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang:
Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees. AAIM 2019: 16-28 - [c15]Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Ro-Yu Wu:
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes. FAW 2019: 88-99 - [c14]Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang:
Three Completely Independent Spanning Trees of Crossed Cubes with Application to Secure-Protection Routing. HPCC/SmartCity/DSS 2019: 1358-1365 - [i3]Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao:
Strong Menger connectedness of augmented k-ary n-cubes. CoRR abs/1910.00852 (2019) - 2018
- [j66]Jou-Ming Chang, Jinn-Shyong Yang, Shyue-Ming Tang, Kung-Jui Pai:
The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars. Comput. J. 61(1): 121-128 (2018) - [j65]Shyue-Ming Tang, Yue-Li Wang, Chien-Yi Li, Jou-Ming Chang:
Cycle Embedding in Generalized Recursive Circulant Graphs. IEICE Trans. Inf. Syst. 101-D(12): 2916-2921 (2018) - [j64]Yu-Liang Liu, Jou-Ming Chang:
Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks. Int. J. Found. Comput. Sci. 29(6): 1003-1021 (2018) - [c13]Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu:
Constructing Independent Spanning Trees on Bubble-Sort Networks. COCOON 2018: 1-13 - [c12]Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu:
Two Kinds of Generalized 3-Connectivities of Alternating Group Networks. FAW 2018: 3-14 - [i2]Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang:
The 4-Component Connectivity of Alternating Group Networks. CoRR abs/1808.06160 (2018) - [i1]Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang:
The Component Connectivity of Alternating Group Graphs and Split-Stars. CoRR abs/1812.00617 (2018) - 2017
- [j63]Jou-Ming Chang, Ting-Jyun Yang, Jinn-Shyong Yang:
A parallel algorithm for constructing independent spanning trees in twisted cubes. Discret. Appl. Math. 219: 74-82 (2017) - [j62]Jou-Ming Chang, Hung-Yi Chang, Hung-Lung Wang, Kung-Jui Pai, Jinn-Shyong Yang:
Completely Independent Spanning Trees on 4-Regular Chordal Rings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1932-1935 (2017) - [j61]Yu-Huei Chang, Jinn-Shyong Yang, Sun-Yuan Hsieh, Jou-Ming Chang, Yue-Li Wang:
Construction independent spanning trees on locally twisted cubes in parallel. J. Comb. Optim. 33(3): 956-967 (2017) - [c11]Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Shyue-Ming Tang, Ro-Yu Wu:
A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks. COCOA (1) 2017: 41-55 - [c10]Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu:
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order. FAW 2017: 221-232 - 2016
- [j60]Ro-Yu Wu, Jou-Ming Chang, Sheng-Lung Peng, Chun-Liang Liu:
Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1067-1074 (2016) - [j59]Jou-Ming Chang, Xiang-Rui Chen, Jinn-Shyong Yang, Ro-Yu Wu:
Locally exchanged twisted cubes: Connectivity and super connectivity. Inf. Process. Lett. 116(7): 460-466 (2016) - [j58]Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang:
Vertex-transitivity on folded crossed cubes. Inf. Process. Lett. 116(11): 689-693 (2016) - [j57]Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu:
Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65]. Theor. Comput. Sci. 651: 87-88 (2016) - [j56]Kung-Jui Pai, Jou-Ming Chang:
Constructing two completely independent spanning trees in hypercube-variant networks. Theor. Comput. Sci. 652: 28-37 (2016) - [c9]Kung-Jui Pai, Ro-Yu Wu, Jou-Ming Chang, Shun-Chieh Chang:
Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order. COCOA 2016: 505-518 - 2015
- [j55]Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang:
A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes. Appl. Math. Comput. 268: 489-495 (2015) - [j54]Jinn-Shyong Yang, Sih-Syuan Luo, Jou-Ming Chang:
Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars. Comput. J. 58(11): 2972-2981 (2015) - [j53]Hung-Lung Wang, Chun-Yu Tseng, Jou-Ming Chang:
On the Structure of Locally Outerplanar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1212-1215 (2015) - [j52]Hung-Yi Chang, Hung-Lung Wang, Jinn-Shyong Yang, Jou-Ming Chang:
A Note on the Degree Condition of Completely Independent Spanning Trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(10): 2191-2193 (2015) - [j51]Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang:
A fully parallelized scheme of constructing independent spanning trees on Möbius cubes. J. Supercomput. 71(3): 952-965 (2015) - [j50]Jinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan:
Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes. IEEE Trans. Parallel Distributed Syst. 26(11): 3090-3098 (2015) - [c8]Jou-Ming Chang, Ton Kloks, Hung-Lung Wang:
Gray Codes for AT-Free Orders via Antimatroids. IWOCA 2015: 77-87 - [c7]Sheng-Lung Peng, Yan-Hao Chen, Ruay-Shiung Chang, Jou-Ming Chang:
An Energy-Aware Random Multi-path Routing Protocol for MANETs. SmartCity 2015: 1092-1097 - 2014
- [j49]Jinn-Shyong Yang, Jou-Ming Chang:
Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs. Comput. J. 57(1): 93-99 (2014) - [j48]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang, Ro-Yu Wu:
Queue Layouts of Toroidal Grids. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1180-1186 (2014) - [j47]Wen-Yin Huang, Jia Jie Liu, Jou-Ming Chang, Ro-Yu Wu:
Longest Fault-Free Cycles in Folded Hypercubes with Conditional Faulty Elements. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1187-1191 (2014) - [j46]Kung-Jui Pai, Jinn-Shyong Yang, Sing-Chen Yao, Shyue-Ming Tang, Jou-Ming Chang:
Completely Independent Spanning Trees on Some Interconnection Networks. IEICE Trans. Inf. Syst. 97-D(9): 2514-2517 (2014) - [j45]Jou-Ming Chang, Jhen-Ding Wang, Jinn-Shyong Yang, Kung-Jui Pai:
A comment on "Independent spanning trees in crossed cubes". Inf. Process. Lett. 114(12): 734-739 (2014) - [j44]Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai:
A loopless algorithm for generating multiple binary tree sequences simultaneously. Theor. Comput. Sci. 556: 25-33 (2014) - [j43]Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu:
Incidence coloring on hypercubes. Theor. Comput. Sci. 557: 59-65 (2014) - [c6]Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang:
Parallel Construction of Independent Spanning Trees on Parity Cubes. CSE 2014: 1150-1154 - [c5]Kun-Fu Ding, Kung-Jui Pai, Jou-Ming Chang, Rueiher Tsaur:
Some Results of Incidence Coloring on Generalized Petersen Graphs. ICS 2014: 85-91 - 2013
- [j42]Ro-Yu Wu, Jou-Ming Chang, An-Hang Chen, Chun-Liang Liu:
Ranking and Unranking t-ary Trees in a Gray-Code Order. Comput. J. 56(11): 1388-1395 (2013) - [j41]Ro-Yu Wu, Jou-Ming Chang, An-Hang Chen, Ming-Tat Ko:
Ranking and Unranking of Non-regular Trees in Gray-Code Order. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1059-1065 (2013) - [j40]Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, Shuo-Hong Xu, Justie Su-tzu Juan:
Power Domination in Honeycomb Meshes. J. Inf. Sci. Eng. 29(6): 1249-1263 (2013) - [c4]Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai:
A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously. COCOA 2013: 340-350 - 2011
- [j39]Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, Justie Su-tzu Juan:
A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs. Algorithmica 61(2): 402-418 (2011) - [j38]Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang:
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. Discret. Appl. Math. 159(12): 1254-1263 (2011) - [j37]Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang:
Ranking and Unranking of t-Ary Trees Using RD-Sequences. IEICE Trans. Inf. Syst. 94-D(2): 226-232 (2011) - [j36]Ro-Yu Wu, Jou-Ming Chang, Chir-Ho Chang:
Ranking and unranking of non-regular trees with a prescribed branching sequence. Math. Comput. Model. 53(5-6): 1331-1335 (2011) - [j35]Ro-Yu Wu, Jou-Ming Chang, Kung-Jui Pai, Yue-Li Wang:
Amortized efficiency of generating planar paths in convex position. Theor. Comput. Sci. 412(35): 4504-4512 (2011) - 2010
- [j34]Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang:
Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence. Comput. J. 53(6): 661-666 (2010) - [j33]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
Restricted power domination and fault-tolerant power domination on grids. Discret. Appl. Math. 158(10): 1079-1089 (2010) - [j32]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
A new upper bound on the queuenumber of hypercubes. Discret. Math. 310(4): 935-939 (2010) - [j31]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
Erratum to "A new upper bound on the queuenumber of hypercubes" [Discrete Mathematics 310 (2010) 935-939]. Discret. Math. 310(13-14): 2059 (2010) - [j30]Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang:
Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2). Int. J. Found. Comput. Sci. 21(1): 73-90 (2010) - [j29]Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang:
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes. Inf. Process. Lett. 110(10): 414-419 (2010) - [j28]