Jou–Ming Chang

2.4k total citations
137 papers, 1.5k citations indexed

About

Jou–Ming Chang is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Jou–Ming Chang has authored 137 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 113 papers in Computer Networks and Communications, 57 papers in Computational Theory and Mathematics and 49 papers in Electrical and Electronic Engineering. Recurrent topics in Jou–Ming Chang's work include Interconnection Networks and Systems (102 papers), Advanced Graph Theory Research (52 papers) and Advanced Optical Network Technologies (28 papers). Jou–Ming Chang is often cited by papers focused on Interconnection Networks and Systems (102 papers), Advanced Graph Theory Research (52 papers) and Advanced Optical Network Technologies (28 papers). Jou–Ming Chang collaborates with scholars based in Taiwan, China and United States. Jou–Ming Chang's co-authors include Jinn‐Shyong Yang, Kung-Jui Pai, Yue-Li Wang, Rong‐Xia Hao, Shyue-Ming Tang, Mei-Mei Gu, Ruay-Shiung Chang, Xiaoyan Li, Chiun‐Chieh Hsu and Shu-Li Zhao and has published in prestigious journals such as European Journal of Operational Research, IEEE Access and Information Sciences.

In The Last Decade

Jou–Ming Chang

124 papers receiving 1.5k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Jou–Ming Chang Taiwan 22 1.3k 731 574 139 110 137 1.5k
Rong‐Xia Hao China 20 1.1k 0.8× 537 0.7× 495 0.9× 278 2.0× 192 1.7× 125 1.3k
Khaled Day Oman 16 988 0.7× 521 0.7× 349 0.6× 94 0.7× 182 1.7× 90 1.2k
Cheng‐Kuan Lin Taiwan 24 1.9k 1.4× 881 1.2× 542 0.9× 312 2.2× 412 3.7× 139 2.1k
Weihua Yang China 21 1.1k 0.8× 511 0.7× 409 0.7× 286 2.1× 186 1.7× 104 1.3k
Shiying Wang China 22 1.3k 1.0× 565 0.8× 483 0.8× 285 2.1× 295 2.7× 134 1.5k
Behrooz Parhami United States 18 833 0.6× 471 0.6× 275 0.5× 70 0.5× 268 2.4× 125 1.3k
László Lipták United States 23 1.2k 0.9× 411 0.6× 529 0.9× 258 1.9× 168 1.5× 56 1.3k
Jun‐Ming Xu China 29 2.0k 1.5× 1.0k 1.4× 1.0k 1.8× 413 3.0× 345 3.1× 158 2.3k
Eddie Cheng United States 28 2.1k 1.6× 772 1.1× 962 1.7× 457 3.3× 294 2.7× 176 2.4k
Shuming Zhou China 23 1.3k 1.0× 610 0.8× 229 0.4× 335 2.4× 368 3.3× 111 1.5k

Countries citing papers authored by Jou–Ming Chang

Since Specialization
Citations

This map shows the geographic impact of Jou–Ming Chang's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jou–Ming Chang with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jou–Ming Chang more than expected).

Fields of papers citing papers by Jou–Ming Chang

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jou–Ming Chang. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jou–Ming Chang. The network helps show where Jou–Ming Chang may publish in the future.

Co-authorship network of co-authors of Jou–Ming Chang

This figure shows the co-authorship network connecting the top 25 collaborators of Jou–Ming Chang. A scholar is included among the top collaborators of Jou–Ming Chang based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jou–Ming Chang. Jou–Ming Chang is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Chang, Jou–Ming, et al.. (2026). Optimal Fault-Tolerant Path and Cycle Embedding of Hypercube Networks Under the PEF Model. IEEE Transactions on Computers. 75(4). 1565–1578. 1 indexed citations
2.
Li, Xiaoyan, et al.. (2025). Link/Switch Fault-Tolerant Hamiltonian Path Embedding in BCube Networks for Deadlock-Free Routing. IEEE Transactions on Dependable and Secure Computing. 22(5). 4829–4846. 1 indexed citations
3.
Chang, Jou–Ming, et al.. (2025). Non-inclusive g-extra diagnosability of regular networks under the MM* model. Journal of Applied Mathematics and Computing. 71(4). 5531–5553.
4.
Hao, Rong‐Xia, et al.. (2024). Packing internally disjoint Steiner paths of data center networks. The Journal of Supercomputing. 81(1).
5.
Gu, Mei-Mei, Jinn‐Shyong Yang, & Jou–Ming Chang. (2024). Assessing Network Reliability Through Perspectives of Neighbor Connectivity and Subversion. IEEE Transactions on Network Science and Engineering. 11(5). 4384–4396. 4 indexed citations
6.
Li, Xiaoyan, et al.. (2024). Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model. Journal of Parallel and Distributed Computing. 190. 104887–104887. 4 indexed citations
7.
Li, Xiaoyan, et al.. (2023). Matroidal connectivity and conditional matroidal connectivity of star graphs. Theoretical Computer Science. 977. 114173–114173. 2 indexed citations
8.
Zhao, Shu-Li & Jou–Ming Chang. (2023). Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes. Information Processing Letters. 182. 106377–106377. 4 indexed citations
9.
Li, Xiaoyan, et al.. (2023). Embedding Hamiltonian Paths in $k$-Ary $n$-Cubes With Exponentially-Many Faulty Edges. IEEE Transactions on Computers. 72(11). 3245–3258. 7 indexed citations
10.
Chang, Jou–Ming, et al.. (2023). All-to-All Broadcast Algorithm in Galaxyfly Networks. Mathematics. 11(11). 2459–2459. 1 indexed citations
11.
Li, Xiaoyan, et al.. (2023). An Efficient Algorithm for Hamiltonian Path Embedding of $k$-Ary $n$-Cubes under the Partitioned Edge Fault Model. IEEE Transactions on Parallel and Distributed Systems. 1–14. 10 indexed citations
12.
Tang, Shyue-Ming, et al.. (2023). A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks. International Journal of Foundations of Computer Science. 35(5). 535–550. 2 indexed citations
13.
Pai, Kung-Jui, Jinn‐Shyong Yang, Guanyu Chen, & Jou–Ming Chang. (2022). Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks. IEEE Transactions on Network Science and Engineering. 9(2). 932–946. 6 indexed citations
14.
Li, Xiaoyan, et al.. (2021). Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing. IEEE Transactions on Parallel and Distributed Systems. 33(8). 1939–1952. 38 indexed citations
15.
Pai, Kung-Jui, Ruay-Shiung Chang, & Jou–Ming Chang. (2020). A protection routing with secure mechanism in Möbius cubes. Journal of Parallel and Distributed Computing. 140. 1–12. 21 indexed citations
16.
Pai, Kung-Jui & Jou–Ming Chang. (2019). Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks. IEEE/ACM Transactions on Networking. 27(3). 1112–1123. 26 indexed citations
17.
Pai, Kung-Jui & Jou–Ming Chang. (2018). Improving the diameters of completely independent spanning trees in locally twisted cubes. Information Processing Letters. 141. 22–24. 12 indexed citations
18.
Chang, Jou–Ming, et al.. (2018). The 4-component connectivity of alternating group networks. Theoretical Computer Science. 766. 38–45. 36 indexed citations
19.
Pai, Kung-Jui, et al.. (2018). Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. Discrete Applied Mathematics. 268. 223–236. 5 indexed citations
20.
Pai, Kung-Jui & Jou–Ming Chang. (2016). Constructing two completely independent spanning trees in hypercube-variant networks. Theoretical Computer Science. 652. 28–37. 31 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Rong‐Xia Hao Breakdown of academic impact, for papers by Khaled Day Breakdown of academic impact, for papers by Cheng‐Kuan Lin Breakdown of academic impact, for papers by Weihua Yang Breakdown of academic impact, for papers by Shiying Wang Breakdown of academic impact, for papers by Behrooz Parhami Breakdown of academic impact, for papers by László Lipták Breakdown of academic impact, for papers by Jun‐Ming Xu Breakdown of academic impact, for papers by Eddie Cheng Breakdown of academic impact, for papers by Shuming Zhou
Rankless by CCL
2026