公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2002 | A note on Gallai-Roy-Vitaver Theorem | Chang, Gerard J.; Tong, L. D.; Yan, J. H.; Yeh, H. G. | Disc. Math. (accepted) | | | |
2001 | A survey on circular chromatic numbers of graphs | Chang, Gerard J. | AMS/IP Studies in Advanced Math. 20, 497-502. (NSC88-2115-M009-009) | | | |
2002 | Algorithmic aspect of k-domination in graphs | Chang, Gerard J.; Liao, C.-S. | Taiwanese J. Math. 6, 415-420. (NSC89-2115-M009-037 and Lee Center) | | | |
2002 | Algorithmic aspects of counting independent sets | Chang, Gerard J.; Jou, M. J. | Ars Combinatoria 65, 265-277. (NSC86-2115-M009-002) | | | |
2003 | Centers and medians of distance-hereditary graphs | Yeh, Hong-Gwa; Chang, Gerard J. | Discrete Mathematics 265 | | | |
2001 | Channel graphs of bit permutation networks | Chang, Gerard J.; Tong, L. D.; Hwang, F. K. | Theore. Comput. Sci. 263, 139-143. (NSC86-2115-M009-002) | | | |
1998 | Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs | Chang, Gerard J.; Huang, Ling-Ling; Zhu, Xu-Ding | Europ. J. Combinatorics 19 | | | |
2000 | Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples | Huang, Ling-Ling; Chang, Gerard J. | Europ. J. Combinatorics 21 | | | |
1999 | Circular chromatic numbers of Mycielski's graphs | Chang, Gerard J.; Huang, Ling-Ling; Zhu, Xu-Ding | Discrete mathematics 205 | | | |
2002 | Corrigendum for `The path-partition problem in block graphs | Chang, Gerard J. | Inform. Process. Letters 83, 293. (NSC89-2115-M009-037) | | | |
2005 | Diagnosabilities of Regular Networks | Chang, Guey Yun; Chang, Gerard J.; Chen, Gen Huey | IEEE Transactions on Parallel and Distributed Systems | | | |
2005 | Diagnosabilities of Regular Networks. | Chang, Guey-Yun; Chang, Gerard J.; GEN-HUEY CHEN ; GERARD JENNHWA CHANG | IEEE Trans. Parallel Distrib. Syst. | 99 | 89 | |
2007 | Distance-two labelings of digraphs | GERARD JENNHWA CHANG ; Chang, Gerard J.; Chen, Jer-Jeong; Kuo, David; Liaw, Sheng-Chyang | Discrete Applied Mathematics | 13 | 12 | |
2003 | Distance-two labelings of graphs | Chang, Gerard J.; Lu, C. | European J. Combin. 24, 53-58. (NSC89-2115-M009-037) | | | |
2002 | Domination on distance-hereditary graphs | Chang, Gerard J.; M. S. Chang, S. C. Wu; Yeh, H. G. | Disc. Applied Math. 116, 103-113. (NSC85-2121-M009-024) | | | |
2008 | Finding cycles in hierarchical hypercube networks | Wu, Ruei-Yu; Fu, Jung-Sheng; Chang, Gerard J.; GERARD JENNHWA CHANG ; Chen, Gen-Huey | Information Processing Letters | 8 | 7 | |
2002 | Group testing in bipartite graphs | Chang, Gerard J.; Juan, S. T. | Taiwanese Journal of Mathematics | | | |
2003 | Isometric path numbers of graphs | Chang, Gerard J.; Pan, J.-J. | (NSC92-2115-M002-015) [#139] [arXiv:math.CO/0310332] | | | |
2003 | k-Domination in graphs | Chang, Gerard J.; Liao, C.-S. | Information Processing Letters | | | |
2001 | Minimum span of no-hole (r+1)-distance colorings | Chang, Gerard J. | SIAM J. Discrete Math. 14, 370-380. (NSC87-2115-M009-007 and Lee Center) | | | |