| Issue Date | Title | Author(s) | Type | scopus | WOS | Fulltext/Archive link |
|---|---|---|---|---|---|---|
| 2011 | A characterization of graphs with rank 4 | Chang, Gerard J.; GERARD JENNHWA CHANG ; Huang, Liang-Hao; Yeh, Hong-Gwa | journal article | 41 | 34 | |
| 2012 | A characterization of graphs with rank 5 | Chang, Gerard J.; GERARD JENNHWA CHANG ; Huang, Liang-Hao; Yeh, Hong-Gwa | journal article | 38 | 34 | |
| 1996 | A finiteness theorem for maximal independent sets | GERARD JENNHWA CHANG | journal article | |||
| 2013 | A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs | GERARD JENNHWA CHANG | journal article | 2 | 1 | |
| 2009 | A note on equitable colorings of forests | Chang, G. J.; GERARD JENNHWA CHANG | journal article | 12 | 8 | |
| 2002 | A note on the Gallai-Roy-Vitaver Theorem | GERARD JENNHWA CHANG | journal article | |||
| 2010 | A note on universally optimal matrices and field independence of the minimum rank of a graph | Huang, Liang-Hao; GERARD JENNHWA CHANG ; Chang, Gerard J.; Yeh, Hong-Gwa | journal article | 2 | 3 | |
| 2013 | A short proof for Chen's Alternative Kneser Coloring Lemma | GERARD JENNHWA CHANG | journal article | 8 | 9 | |
| 2008 | Adaptive group testing for consecutive positives | GERARD JENNHWA CHANG ; Juan, J.S.T.; Chang, G.J. | journal article | 3 | 3 |  |
| 2002 | Algorithmic aspect of k-tuple domination in graphs | GERARD JENNHWA CHANG | journal article | |||
| 2002 | Algorithmic aspects of counting independent sets | GERARD JENNHWA CHANG | journal article | |||
| 1999 | Algorithmic aspects of linear k-arboricity | GERARD JENNHWA CHANG | journal article | |||
| 1997 | Algorithmic aspects of majority domination | GERARD JENNHWA CHANG | journal article | |||
| 1996 | Algorithmic aspects of the generalized clique-transversal problem on chordal graphs | GERARD JENNHWA CHANG | journal article | 24 | 20 | |
| 2013 | Algorithmic aspects of the k-domination problem in graphs | GERARD JENNHWA CHANG | journal article | 15 | 9 | |
| 1990 | An upper bound for the transversal numbers of 4-uniform hypergraphs | GERARD JENNHWA CHANG | journal article | 34 | 32 | |
| 2013 | B-chromatic numbers of powers of paths and cycles | GERARD JENNHWA CHANG | journal article | 2 | 1 | |
| 2013 | B-coloring of tight bipartite graphs and the Erdös-Faber-Lovász conjecture | GERARD JENNHWA CHANG | journal article | 5 | 6 | |
| 2012 | Balanced k-decompositions of graphs | GERARD JENNHWA CHANG | journal article | 1 | 1 | |
| 2014 | Bandwidth sums of block graphs and cacti | GERARD JENNHWA CHANG | journal article | 0 | 0 |
