Publication List (March 17, 2004)

(Papers with NSC numbers at end are results of projects supported by the National Science Council.)

• J.-J. Pan and G. J. Chang, "Isometric path numbers of graphs," submitted. (NSC92-2115-M002-015)   [#139] [arXiv:math.CO/0310332]
• ---------------------------------------------------------------------------------------------------------------------
• G. J. Chang, ``The weighted independent domination problem is NP-complete for chordal graphs," Disc. Appl. Math. (accepted).  (NSC91-2115-M002-011) 
• G. J. Chang, L.-D. Tong and H.-T. Wang, ``Geodetic spectra of graphs," European J. Combin. (accepted).  (NSC90-2115-M002-024) [#123] [pdf file]
• Y.-L. Lai and G. J. Chang (2004), ``On the profile of the corona of two graphs," Inform. Process. Letters 89, 287-292.  (NSC92-2115-M002-015)  [#122]  [pdf file]
• M. J. Chen,  G. J. Chang and D. B. West (2004), ``Interval numbers of powers of block graphs," Disc. Math. 275, 87-96. (NSC85-2121-M009-037)  [#76]  [pdf file]
• C. Y. Chen, Y. P. Wang and G. J. Chang, ``Vertex and tree arboricities of graphs,'' J. Combin. Optimization (accepted).  (NSC89-2115-M009-037)  [#71]
• ---------------------------------------------------------------------------------------------------------------------
• G. J. Chang and C. Lu (2003), ``Distance-two labelings of graphs,'' European J. Combin. 24, 53-58. (NSC89-2115-M009-037)  [#126]  [pdf file]
• C.-S. Liao and G. J. Chang, ``k-Domination in graphs,"  Inform. Process. Letters. (NSC89-2115-M009-037)   [#121]  [pdf file]
• G. J. Chang and S.-C. Liaw (2003), ``The L(2,1)-labeling problem on ditrees,'' Ars Combin. 66, 23-31. (NSC89-2115-M009-037 and Lee Center)  [#118]
• H. G. Yeh and G. J. Chang (2003), ``Centers and medians of distance-hereditary graphs,'' Disc. Math. 265, 310. (NSC87-2115-M009-007) [#98]  [pdf file]
• -----------------------------------------------------------------------------------------------------------------------
• C.-S. Liao and G. J. Chang (2002), ``Algorithmic aspect of k-domination in graphs," Taiwanese J. Math. 6, 415-420. (NSC89-2115-M009-037 and Lee Center)  [#120]  [pdf file]
• G. J. Chang (2002), ``Corrigendum for `The path-partition problem in block graphs','' Inform. Process. Letters 83, 293. (NSC89-2115-M009-037)  [#117] [pdf file]
• S. T. Juan and G. J. Chang (2002), ``Group testing in bipartite graphs,'' Taiwanese J. Math. 6, 67-73. (NSC89-2115-M009-007)  [#115]  [pdf file]
• G. J. Chang, L. D. Tong, J. H. Yan, and H. G. Yeh, ``A note on Gallai-Roy-Vitaver Theorem,'' Disc. Math. (accepted). (NSC88-2115-M009-009) [#111] [pdf file]
• G. J. Chang, S. C. Liaw and H. G. Yeh (2002), ``k-Subdomination in graphs,'' Disc. Math. 120, 55-60. (NSC88-2115-M009-009 and Lee Center)  [#110] [pdf file]
• M. J. Chen and G. J. Chang (2002), ``Total interval numbers of complete r-partite graphs," Disc. Appl. Math. 122, 83-92. (NSC88-2115-M009-009 and Lee Center)  [#106] [pdf] file]
• M. J. Jou and G. J. Chang (2002), ``Algorithmic aspects of counting independent sets,'' Ars Combinatoria 65, 265-277.  (NSC86-2115-M009-002)  [#91]
• M. S. Chang, S. C. Wu, G. J. Chang, and H. G. Yeh (2002), ``Domination on distance-hereditary graphs,'' Disc. Applied Math. 116, 103-113. (NSC85-2121-M009-024)  [#69] [pdf file]
• -----------------------------------------------------------------------------------------------------------------------
• G. J. Chang (2001), ``A survey on circular chromatic numbers of graphs,'' AMS/IP Studies in Advanced Math. 20, 497-502. (NSC88-2115-M009-009)  [#114]  [doc file]
• Venkatesan Guruswami, C. Pandu Rangan, M. S. Chang, G. J. Chang and C. K. Wong (2001), ``The K_r-packing problem,'' Computing 66, 79-89. Conference version ``The vertex-disjoint triangle problem,'' Lecture Notes Comput. Sci. 1517 (1998), 26-37. (NSC88-2115-M009-009 and Lee Center)  [#113]
• G. J. Chang, S. T. Juan, and D. D.-L. Liu (2001), ``No-hole 2-distance colorings for unit interval graphs,'' Ars Comb. 61, 233-144. (NSC88-2115-M009-009)  [#101]
• M. J. Chen and G. J. Chang (2001), ``Families of graphs closed under taking power,'' Graph and Combinatorics 17, 207-212. (NSC87-2115-M009-007)  [#95]  [pdf file]
• L. D. Tong, F. K. Hwang and G. J. Chang (2001), ``Channel graphs of bit permutation networks,'' Theore. Comput. Sci. 263, 139-143. (NSC86-2115-M009-002)  [#93]  [pdf file]
• G. J. Chang, S. T. Juan and D. D.-F. Liu (2001), ``Minimum span of no-hole (r+1)-distance colorings,'' SIAM J. Discrete Math. 14, 370-380. (NSC87-2115-M009-007 and Lee Center)        [#83]  [pdf file]
• H. G. Yeh and G. J. Chang (2001), ``Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs,'' Theorect. Comput. Sci.  263, 3-8. (NSC87-2121-M009-007)   [#68]  [pdf file]
• ------------------------------------------------------------------------------------------------------------------------
• L. Huang and G. J. Chang (2000), ``Circular chromatic numbers of distance graphs with distance sets missing multiples,'' European J. Combinatorics 21, 241-248. (NSC87-2115-M009-007)    [#104]  [pdf file]
• G. J. Chang and X. Zhu (2000), ``Pseudo Hamiltonian-connected graphs,'' Disc. Applied Math. 100, 145-153. (NSC87-2115-M009-007)  [#103]  [pdf file]
• G. J. Chang, B. L. Chen, K. C. Huang, and H. L. Fu (2000), ``Linear k-arboricities of trees,'' Disc. Appl. Math. 103, 281-287. (NSC87-2115-M009-007)  [#97]  [pdf file]
• G. J. Chang, W. T. Ke, D. Kuo, D. D.-F. Liu, and R. K. Yeh (2000), ``On L(d,1)-labelings of graphs,'' Disc. Math. 220, 57-66. (NSC87-2115-M009-007)  [#96]  [pdf file]
• M. J. Jou and G. J. Chang (2000), ``The number of maximum independent sets in graphs,'' Taiwanese J. Math. 4, 685-695. (NSC86-2115-M009-002)  [#94]  [pdf file]
• S. C. Liaw, D. Kuo, and G. J. Chang (2000), ``Integral sum numbers of graphs,'' Ars Combinatoria 54, 259-268. (NSC84-2121-M009-023)  [#61]
• G. J. Chang, L. Cui and F. K. Hwang (2000), Reliabilities of Consecutive-k Systems, Kluwer Academic Publishers, Netherlands.  [B1]
• ------------------------------------------------------------------------------------------------------------------------
• G. J. Chang, L. Cui and F. Hwang (1999), ``New comparisons in Birnhaum importance for the consecutive-k-out-of-n systems,'' Prob. Eng. Inform. Sci. 13, 187-192. ``Corrigenda'' in the same journal 14 (2000), 405. (NSC87-2115-M009-001)  [#108] [pdf file]
• G. J. Chang, L. Cui and F. Hwang (1999), ``Reliabilities for (n,f,k) systems,'' Stat. Prob. Letters 43, 237-242. (NSC87-2115-M009-001)  [#107]  [pdf file]
• X. Lu, D. W. Wang, G. J. Chang, I. J. Lin, and C. K. Wong (1999), ``On k-ary spanning trees of tournaments,'' J. Graph Theory 30, 167-176. (NSC87-2115-M009-007)  [#102]  [pdf file]
• L. Huang and G. J. Chang (1999), ``The circular chromatic number of the Myceilkian of G^d_k,''J. Graph Theory 32, 63-71. (NSC87-2115-M009-007)  [#100]  [pdf file]
• Y. S. Lee and G. J. Chang (1999), ``Bipartite Steinhaus graphs,'' Taiwanese J. Math. 3, 303-310. (NSC83-0208-M009-050)  [#99]  [pdf file]
• S. C. Liaw and G. J. Chang (1999), ``Rabin numbers of butterfly networks,'' Disc. Math. 196, 219-227. (NSC86-2115-M009-002)  [#90]  [pdf file]
• G. J. Chang (1999), ``Algorithmic aspects of linear k-arboricity,'' Taiwanese J. Math. 3, 73-81. (NSC86-2115-M009-002)  [#89]  [pdf file]
• G. J. Chang, F. K. Hwang, and L. D. Tong (1999), ``Characterizing bit permutation networks,'' Networks 33, 261-267. (NSC86-2115-M009-002)  [#88] [pdf file]
• S. C. Liaw and G. J. Chang (1999), ``Wide diameters of butterfly networks,'' Taiwanese J. Math. 3, 83-88. (NSC86-2115-M009-002)  [#87]  [pdf file]
• G. J. Chang, F. K. Hwang, and L. D. Tong (1999), ``The consecutive-4 digraphs are hamiltonian,'' J. Graph Theory 31, 1-6. (NSC86-2115-M009-002)  [#85]  [pdf file]
• G. J. Chang, D. D.-F. Liu, and X. Zhu (1999), ``Distance graphs and T-coloring,'' J. Comb. Theory, Series B 75, 259-269. (NSC86-2115-M009-002)  [#84]  [pdf file]
• S. C. Liaw and G. J. Chang (1999), ``Generalized diameters and Rabin numbers of networks,'' J. Comb. Optimization 2, 371-384 . (NSC86-2115-M009-002)  [#82]
• G. J. Chang, F. L. Chen, L. Huang, F. K. Hwang, S. T. Juan, U. G. Rothblum, I. F. Sun, J. W. Wang, and H. G. Yeh (1999), ``Sortability of partition properties,'' J. Comb. Optimization 2, 413-427 . (NSC86-2115-M009-002)  [#81]
• G. J. Chang, L. L. Hung and X. D. Zhu (1999), ``Circular chromatic numbers of Myceilski's graphs,'' Disc. Math. 205, 23-37. (NSC85-2121-M009-024)  [#73]  [pdf file]
• S. J. Hu, S. T. Juan, and G. J. Chang (1999), ``T-Colorings and T-edge spans of graphs,'' Graphs and Combinatorics 15, 295-301. (NSC85-2121-M009-024)  [#66]  [pdf file]
• G. J. Chang and M. J. Jou (1999), ``The number of maximal independent sets in connected triangle-free graphs,'' Disc. Math. 197/198, 169-178. (NSC84-2121-M009-023)  [#65]  [pdf file]
• H. Y. Lee and G. J. Chang (1999), ``Linear algorithms for finding w-median of graphs,'' JCMCC 31, 183-192. (NSC84-2121-M009-023)  [#58]
• G. J. Chang, B. DasGupta, W. M. Dy\'a\v cek, M. F\"urer, M. Koerlin, Y.-S. Lee, T. Whaley (1999), ``Characterizations of bipartite Steinhaus graphs,'' Disc. Math. 199, 11-25. (NSC83-0208-M009-050)  [#56]  [pdf file]
• G. J. Chang, F. K. Hwang, and Y. C. Yao (1999), ``Localizing combinatorial properties for partitions on block graphs,'' J. Comb. Optimization 2, 429-441. (NSC82-0208-M009-050)  [#48]
• ----------------------------------------------------------------------------------------------------------------------
• G. J. Chang (1998), ``Algorithmic aspects of domination in graphs,'' in Handbook of Combinatorial Optimization (D.-Z. Du and P. M. Pardalos eds.), Vol. 3, 339-405. (NSC87-2115-M009-007)     [#109]
• G. J. Chang, L. L. Huang, and X. D. Zhu (1998), ``Circular chromatic numbers and fractional chromatic numbers of distance graphs,'' European J. Combinatorics 19, 423-431. (NSC86-2115-M009-002)  [#86]  [pdf file]
• S. C. Liaw, H. G. Yeh, F. K. Hwang, and G. J. Chang (1998), ``A simple and direct derivation for the number of noncrossing partitions,'' Proc. AMS 126, 1579-1581. (NSC86-2115-M009-002)    [#80]  [pdf file]
• H. G. Yeh, S. C. Liaw, F. K. Hwang, and G. J. Chang (1998), ``Enumerating partitions with given part-sizes,'' Bull. Inst. Math., Academia Sinica 26, 33-38. (NSC86-2115-M009-002)  [#79]
• S. C. Liaw, G. J. Chang, F. Cao, and D. F. Hsu (1998), ``Fault-tolerant routing in circulant networks and cycle prefix networks,'' Annals of Combin. 2, 165-172. (NSC86-2115-M009-002)  [#78]
• H. G. Yeh and G. J. Chang (1998), ``The path-partition problem in bipartite distance-hereditary graphs,'' Taiwanese J. Math. 2, 353-360. (NSC84-2121-M009-023)  [#62]  [pdf file]
• H. G. Yeh and G. J. Chang (1998), ``Weighted connected domination and Steiner trees in distance-hereditary graphs,'' Disc. Applied Math. 87, 245-253; extended abstract in Lecture Note in Computer Science 1120 (1996) 48-52. (NSC84-2121-M009-023)  [#59]
• F. K. Hwang and G. J. Chang (1998), ``Enumerating consecutive and nested partitions for graphs,'' European J. Combin. 19, 63-70. (NSC82-0208-M009-050)  [#45]  [pdf file]
• G. J. Chang and P. H. Ho (1998), ``The β-assignment problems,'' European J. Oper. Research 104, 593-600. (NSC77-0208-M009-21)  [#36]
• G. J. Chang and F. H. Hao (1998), ``The ratio of degree sums on graph decompositions,'' Bull. Inst. Math. Academia Sinica 26, 247-255.  [#35]
• S. F. Hwang and G. J. Chang (1998), ``k-Neighborhood-covering and -independence problems for chordal graphs,'' SIAM J. Disc. Math. 11, 633-643. (NSC81-0208-M009-26)  [#32]  [pdf file]
• -----------------------------------------------------------------------------------------------------------------------
• H. G. Yeh and G. J. Chang (1997), ``Algorithmic aspects of majority domination,'' Taiwanese J. Math. 1, 343-350. (NSC85-2121-M009-024)  [#77]  [pdf file]
• G. J. Chang, F. K. Hwang, and L. D. Tong (1997), ``The Hamiltonian properties of consecutive-3 digraphs,'' Math. Computer Modeling 25, 83-88. (NSC86-2115-M009-002)  [#75]  [pdf file]
• J. H. Yan, K. W. Lih, D. Kuo, and G. J. Chang (1997), ``Signed degree sequences of signed graphs,'' J. Graph Theory 26, 111-117. (NSC85-2121-M009-024)  [#70]  [pdf file]
• C. Y. Chen, C. C. Chang, and G. J. Chang (1997), ``Proper interval graphs and the guard problem,'' Disc. Math. 170, 223-230. (NSC84-2121-M009-023)  [#67]
• H. Y. Lee and G. J. Chang (1997), ``Medians of graphs and kings of tournaments,'' Taiwanese J. Math. 1, 103-110. (NSC84-2121-M009-023)  [#64]  [pdf file]
• M. J. Jou and G. J. Chang (1997), ``Maximal independent sets in graphs with at most one cycle,'' Disc. Appl. Math. 79, 67-73. (NSC84-2121-M009-023)  [#63]  [pdf file]
• Y. J. Tsay and G. J. Chang (1997), ``The exact gossiping problem,'' Disc. Math. 163, 165-172. (NSC84-2121-M009-023)  [#60]
• J. H. Yan, G. J. Chang, S. M. Hedetniemi, and S. T. Hedetniemi (1997), ``k-Path partitions in trees,'' Disc. Appl. Math. 78, 227-233. (NSC84-2121-M008-023)  [#57]  [pdf file]
• D. Kuo, G. J. Chang, and Y. H. H. Kwong (1997), ``Cordial labeling of m K_n,'' Disc. Math. 169, 121-131. (NSC83-0208-M009-050)  [#53]  [pdf file]
• J. J. Chen, G. J. Chang, and K. C. Huang (1997), ``Integral distance graphs,'' J. Graph Theory 25, 287-294. (NSC83-0208-M009-050)  [#51]  [pdf file]
• G. J. Chang and F. K. Hwang (1997), ``Optimality of consecutive and nested tree partitions," Networks 30, 75-80. (NSC82-0208-M009-050)  [#47]  [pdf file]
• G. J. Chang and P. H. Ho (1997), ``The β-assignment problem in general graphs,'' Computers and Oper. Research 24, 757-765. (NSC77-0208-M009-21)  [#31]  [pdf file]
• -------------------------------------------------------------------------------------------------------------------
• M. J. Jou, G. J. Chang, C. Lin, and T. H. Ma (1996), ``A finiteness theorem for maximal independent sets,'' Graphs and Combinatorics 12, 321-326. (NSC83-0208-M009-050)  [#55]
• G. J. Chang (1996), ``Corrigendum,'' J. Comb. Theory (Series A) 73, 190-192. (NSC83-0208-M009-050)  [#54]  [pdf file]
• G. J. Chang and Y. J. Tsay (1996), ``The partial gossiping problem,'' Disc. Math. 148, 9-14. (NSC83-0208-M009-050)  [#50]
• M. S. Chang, Y. H. Chen, G. J. Chang, and J. H. Yan (1996), ``Algorithmic aspects of the generalized clique-transversal problem on chordal graphs,'' Disc. Appl. Math. 66, 189-203. (NSC82-0208-M009-050)  [#49]
• G. J. Chang and D. Kuo (1996), ``The L(2,1)-labeling problem on graphs,'' SIAM J. Disc. Math. 9, 309-316. (NSC82-0208-M009-050)  [#44]
• J. H. Yan, J. J. Chen, and G. J. Chang (1996), ``Quasi-threshold graphs,'' Disc. Appl. Math. 69, 247-255. (NSC81-0208-M009-26)  [#42]
• --------------------------------------------------------------------------------------------------------------------
• M. J. Jou and G. J. Chang (1995), ``Survey on counting maximal independent sets,'' Proceedings of the Second Asian Mathematical Conference, S. Tangmance and E. Schulz eds., World Scientific, page 265-275. (NSC84-2121-M009-023)  [#92]
• G. J. Chang, F. K. Hwang, P. E. Wright, and G. J. Griggs (1995), ``A unique arithmetic labeling of macrohexagons,'' J. Comb. Designs 3, 169-177. (NSC82-0208-M009-050)  [#46]
• G. J. Chang, C. Pandu Rangan, and Satyan R. Coorg (1995), ``Weighted independent perfect domination on cocomparability graphs,'' Disc. Appl. Math. 63, 215-222. (NSC82-0208-M009-050)  [#43]
• S. F. Hwang and G. J. Chang (1995) ``The edge domination problem,'' Discussiones Math.--Graph Theory 15, 51-57. (NSC79-0208-M009-31)  [#30]
• --------------------------------------------------------------------------------------------------------------------
• J. H. Yan and G. J. Chang (1994), ``The path-partition problem in block graphs,'' Inform. Proc. Letters 52, 317-322. (NSC83-0208-M009-050)  [#52]
• H. Y. Lee and G. J. Chang (1994), ``The w-median of a connected strongly chordal graph,'' J. Graph Theory 18, 673-680. (NSC81-0208-M009-26)  [#41]
• G. J. Chang (1994), ``The domatic number problem,'' Disc. Math. 125, 115-122. (NSC80-0208-M009-26)  [#40]
• S. F. Hwang and G. J. Chang (1994), ``Edge domatic numbers of complete n-partite graphs,'' Graphs and Combinatorics 10, 241-248. (NSC79-0208-M009-31)  [#39]
• D. Kuo and G. J. Chang (1994), ``The profile minimization problem,'' SIAM J. Comput. 23, 71-81. (NSC79-0208-M009-31)  [#37]
• ---------------------------------------------------------------------------------------------------------------------
• G. J. Chang (1993), ``Strong sum graphs,'' Bulletin of ICA 7, 47-52. (NSC79-0208-M009-26)     [#33]
• G. J. Chang, M. Farber, and Z. Tuza (1993), ``Algorithmic aspects of neighborhood numbers,'' SIAM J. Disc. Math. 6, 24-29. (NSC79-0208-M009-31)  [#29]
• ---------------------------------------------------------------------------------------------------------------------
• H. Y. Lee, H. M. Lee, and G. J. Chang (1992), ``Cordial labelings of graphs,'' Chinese J. Math.20, 263-273. (NSC79-0208-M009-04)  [#34]
• H. M. Lee and G. J. Chang (1992), ``Set to set broadcasting in communication networks,'' Disc. Appl. Math. 40, 411-421.  [#28]
• ---------------------------------------------------------------------------------------------------------------------
• C. Chang and G. J. Chang (1991), ``An existence theorem for abstract stable sets,'' J. Austrail. Math. Soc. (Series A) 51, 468-472.  [#27]
• G. J. Chang (1991), ``Centers of chordal graphs,'' Graphs and Combinatorics 7, 305-313. (NSC77-0208-M008-05)  [#26]
• S. F. Hwang and G. J. Chang (1991), ``The k-neighbor domination problem in block graphs,'' European J. Oper. Research 52, 373-377. (NSC77-0208-M009-21)  [#25]
• ---------------------------------------------------------------------------------------------------------------------
• T. L. Lu, P. H. Ho, and G. J. Chang (1990), ``The domatic number problem in interval graphs,'' SIAM J. Disc. Math. 3, 531-536. (NSC77-0208-M009-21)  [#24]
• F. C. Lai and G. J. Chang (1990), ``An upper bound for the transversal numbers of 4-uniform hypergraphs,'' J. Comb. Theory (Series B) 50, 129-133. (NSC77-0208-M008-05)  [#23]
• ---------------------------------------------------------------------------------------------------------------------
• G. J. Chang (1989), ``Total domination in block graphs,'' Operations Research Letters 8, 53-57.     [#22]
• G. J. Chang (1989), ``On the number of SDR of a (t,n)-family,'' European J. Combinatorics 10, 231-234. (NSC74-0201-M008d-02)  [#21]
• G. J. Chang (1988/89), ``Labeling algorithms for domination problems in sun-free chordal graphs,'' Disc. Appl. Math. 22, 21-34.  [#20]
• ---------------------------------------------------------------------------------------------------------------------
• G. J. Chang (1988), ``The k-path and the k-covering problems,'' Ars Combinatoria 25A, 11-20.     [#19]
• G. J. Chang (1988), ``Bases theorems of general matroids,'' Tamkang J. Math. 19, 59-63.  [#18]
• G. J. Chang and F. K. Hwang (1988), ``Optimal consecutive-k-out-of-n system under fixed budges,'' Prob. in Eng. and Inform. Sci. 2, 63-73.  [#17]
• ---------------------------------------------------------------------------------------------------------------------
• Y. C. Lin and G. J. Chang (1987), ``On the abstraction of linear duality,'' Chinese J. Math. 15, 207-213. (NSC74-0201-M008d-02)  [#16]
• G. J. Chang and F. H. Hao (1987), ``The minimum of the antichains in the factor poset,'' Order 3, 355-357. (NSC74-0201-M008d-02)  [#15]
• --------------------------------------------------------------------------------------------------------------------
• G. J. Chang (1986), ``Existence and non-existence of association schemes,'' Bull. Inst. Math., Academia Sinica 14, 257-270. (NSC73-0208-M008-08)  [#14]
• ---------------------------------------------------------------------------------------------------------------------
• G. J. Chang and J. Edmonds (1985), ``The poset scheduling problem,'' Order 2, 113-118. (NSC73-0208-M008-08)  [#13]
• G. J. Chang and G. L. Nemhauser (1985), ``Covering, packing and generalized perfection,'' SIAM J. Alg. Disc. Meth. 6, 109-132. [#12]
• G. J. Chang and F. K. Hwang (1985), ``Diagonal and pandiagonal tournament Latin squares,'' European J. Combinatorics 6, 149-155.  [#11]
• ---------------------------------------------------------------------------------------------------------------------
• G. J. Chang and G. L. Nemhauser (1984), ``The k-domination and k-stability problems on sun-free chordal graphs,'' SIAM J. Alg. Disc. Meth. 5, 332-345.  [#10]
• ---------------------------------------------------------------------------------------------------------------------
• G. J. Chang (1983), ``Binary triangles,'' Bull. Inst. Math., Academia Sinica 11, 209-225.  [#9]
• ---------------------------------------------------------------------------------------------------------------------
• G. J. Chang and G. L. Nemhauser (1982), ``R-Domination on block graphs,'' Operations Research Letters 1, 214-218.  [#8]
• G. J. Chang, F. K. Hwang, and S. Lin (1982), ``Group testing with two defectives,'' Disc. Appl. Math. 4, 97-102.  [#7]
• ---------------------------------------------------------------------------------------------------------------------
• G. J. Chang, D. F. Hsu, and D. G. Rogers (1981), ``Additive variations on a graceful theme: some results on harmonious and other related graphs,'' Congressus Numerantium 32, 181-197.  [#6]
• G. J. Chang and F. K. Hwang (1981), ``A group testing problem on two disjoint sets," SIAM J. Alg. Disc. Meth. 2, 35-38.  [#5]
• -----------------------------------------------------------------------------------------------------------------------
• G. J. Chang and F. K. Hwang (1980), ``A group testing problem,'' SIAM J. Alg. Disc. Meth. 1, 21-24.  [#4]
• -----------------------------------------------------------------------------------------------------------------------
• G. J. Chang (1978), ``Complete diagonal of Latin squares,'' Canad. Math. Bull. 22, 477-481.  [#3]
• -----------------------------------------------------------------------------------------------------------------------
• G. J. Chang and K. W. Lih (1977), ``Polynomial representation of primes,'' Tamkang J. Math. 8, 197-198.  [#2]
• G. J. Chang, M. C. Hu, K. W. Lih, and T. C. Sheih (1977), ``Exact difference triangles,'' Bull. Inst.    Math., Academia Sinica 5, 191-197.  [#1]