Gerard J. Chang

4.8k total citations
195 papers, 3.1k citations indexed

About

Gerard J. Chang is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Gerard J. Chang has authored 195 papers receiving a total of 3.1k indexed citations (citations by other indexed papers that have themselves been cited), including 154 papers in Computational Theory and Mathematics, 50 papers in Computer Networks and Communications and 48 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Gerard J. Chang's work include Advanced Graph Theory Research (136 papers), Graph Labeling and Dimension Problems (81 papers) and Limits and Structures in Graph Theory (45 papers). Gerard J. Chang is often cited by papers focused on Advanced Graph Theory Research (136 papers), Graph Labeling and Dimension Problems (81 papers) and Limits and Structures in Graph Theory (45 papers). Gerard J. Chang collaborates with scholars based in Taiwan, United States and China. Gerard J. Chang's co-authors include David Kuo, Frank K. Hwang, Chung-Shou Liao, Gen-Huey Chen, Lirong Cui, George L. Nemhauser, Xuding Zhu, Changhong Lü, Jiaojiao Wu and F. K. Hwang and has published in prestigious journals such as European Journal of Operational Research, Information Sciences and IEEE Transactions on Computers.

In The Last Decade

Gerard J. Chang

185 papers receiving 2.8k citations

Peers

Gerard J. Chang
J. Scott Provan United States
F Boesch United States
Lowell W. Beineke United States
H. J. Ryser United States
Komei Fukuda Switzerland
Źsolt Tuza Hungary
Colin McDiarmid United Kingdom
Monique Laurent Netherlands
Patric R. J. Östergård Finland
N. S. Mendelsohn Canada
J. Scott Provan United States
Gerard J. Chang
Citations per year, relative to Gerard J. Chang Gerard J. Chang (= 1×) peers J. Scott Provan

Countries citing papers authored by Gerard J. Chang

Since Specialization
Citations

This map shows the geographic impact of Gerard J. 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 Gerard J. Chang with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gerard J. Chang more than expected).

Fields of papers citing papers by Gerard J. Chang

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gerard J. 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 Gerard J. Chang. The network helps show where Gerard J. Chang may publish in the future.

Co-authorship network of co-authors of Gerard J. Chang

This figure shows the co-authorship network connecting the top 25 collaborators of Gerard J. Chang. A scholar is included among the top collaborators of Gerard J. 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 Gerard J. Chang. Gerard J. 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, Gerard J., et al.. (2013). b-chromatic numbers of powers of paths and cycles. Discrete Applied Mathematics. 161(16-17). 2532–2536. 2 indexed citations
2.
Chang, Gerard J., Paul Dorbec, Mickaël Montassier, & André Raspaud. (2012). Generalized power domination of graphs. Discrete Applied Mathematics. 160(12). 1691–1698. 29 indexed citations
3.
Chang, Gerard J., et al.. (2011). Equitable colorings of Cartesian products of graphs. Discrete Applied Mathematics. 160(3). 239–247. 8 indexed citations
4.
Zhao, Yongqiang & Gerard J. Chang. (2010). Multicompetition numbers of some multigraphs.. Ars Combinatoria. 97. 2 indexed citations
5.
Chen, Gen-Huey, et al.. (2007). (t, k) - Diagnosis for Matching Composition Networks under the MM* Model. IEEE Transactions on Computers. 56(1). 73–79. 30 indexed citations
6.
Chang, Gerard J., et al.. (2007). A Study on Development of Liquid Cooled Plate for Cooling of a Communication Electronic Device with High Heat Generation. Power System Engineering. 11(2). 26–31. 2 indexed citations
7.
Chang, Gerard J., et al.. (2006). Node-disjoint paths in hierarchical hypercube networks. International Parallel and Distributed Processing Symposium. 312–312. 4 indexed citations
8.
Chang, Gerard J., et al.. (2003). The L(2, 1)-labeling problem on ditrees. Ars Combinatoria. 66. 23–31. 14 indexed citations
9.
Chang, Gerard J., et al.. (2003). k-Domination in graphs. Information Processing Letters. 87(2003).
10.
Chang, Gerard J., et al.. (2003). Geodetic spectra of graphs. European Journal of Combinatorics. 25(3). 383–391. 4 indexed citations
11.
Chang, Gerard J., et al.. (2002). GROUP TESTING IN BIPARTITE GRAPHS. Taiwanese Journal of Mathematics. 6(1). 67–73.
12.
Chang, Gerard J., et al.. (2002). Algorithmic aspects of counting independent sets. Ars Combinatoria. 65. 265–277. 7 indexed citations
13.
Liao, Chung-Shou & Gerard J. Chang. (2002). ALGORITHMIC ASPECT OF k-TUPLE DOMINATION IN GRAPHS. Taiwanese Journal of Mathematics. 6(3). 415–420. 39 indexed citations
14.
Chang, Gerard J., et al.. (2001). No-hole 2-distant colorings for unit interval graphs. Ars Combinatoria. 61. 233–244. 4 indexed citations
15.
Chang, Gerard J.. (1999). ALGORITHMIC ASPECTS OF LINEAR k-ARBORICITY. Taiwanese Journal of Mathematics. 3(1). 71–81. 13 indexed citations
16.
Kuo, David, et al.. (1999). Integral Sum Numbers of Graphs. Ars Combinatoria. 54. 259–268. 7 indexed citations
17.
Chang, Gerard J., et al.. (1999). Distance Graphs andT-Coloring. Journal of Combinatorial Theory Series B. 75(2). 259–269. 29 indexed citations
18.
Chang, Gerard J., et al.. (1997). MEDIANS OF GRAPHS AND KINGS OF TOURNAMENTS. Taiwanese Journal of Mathematics. 1(1). 103–110. 3 indexed citations
19.
Chang, Gerard J., et al.. (1997). k-Path partitions in trees. Discrete Applied Mathematics. 78(1-3). 227–233. 19 indexed citations
20.
Chang, Maw‐Shang, et al.. (1996). Algorithmic aspects of the generalized clique-transversal problem on chordal graphs. Discrete Applied Mathematics. 66(3). 189–203. 26 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 J. Scott Provan Breakdown of academic impact, for papers by F Boesch Breakdown of academic impact, for papers by Lowell W. Beineke Breakdown of academic impact, for papers by H. J. Ryser Breakdown of academic impact, for papers by Komei Fukuda Breakdown of academic impact, for papers by Źsolt Tuza Breakdown of academic impact, for papers by Colin McDiarmid Breakdown of academic impact, for papers by Monique Laurent Breakdown of academic impact, for papers by Patric R. J. Östergård Breakdown of academic impact, for papers by N. S. Mendelsohn
Rankless by CCL
2026