公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2001 | Channel graphs of bit permutation networks | Tong, L. D.; Hwang, F. K.; Chang, G. J. | Theoretical Computer Science | | | |
2009 | The competition number of a graph with exactly h holes, all of which are independent | Li, B.-J.; Chang, G. J. | Discrete Applied Mathematics | | | |
2005 | Diagnosability of regular networks | Chang, G.-Y.; Chang, G. J.; Chen, G.-H. | IEEE Transations on Parallel and Distributed Systems | | | |
2007 | Distance graphs on R-n supercript stop with 1-norm | Chen, J. J.; Chang, G. J. | Journal of Combinatorial Optimization | | | |
2007 | Distance graphs on R^n with 1-norm | Chen, J.-J.; Chang, G. J. | Journal of Combinatorial Optimization | | | |
2003 | Distance-two labelings of graphs | Chang, G. J.; Lu, C. | European Journal of Combinatorics | | | |
2009 | Distance-two labellings of Hamming graphs | Chang, G. J.; GERARD JENNHWA CHANG ; Lu, C.; Zhou, S. | Discrete Applied Mathematics | 8 | 8 | |
2007 | Group testing in graphs | Juan, J. S. T.; Chang, G. J. | C. Y. Chen, Y. P. Wang and G. J. Chang | | | |
2009 | Independent arcs of acyclic orientations of complete r-partite graphs | Chang, G. J.; Lin, C.-Y.; Tong, L.-D. | Discrete Mathematics | | | |
2007 | Induced-path partition on graphs with special blocks | GERARD JENNHWA CHANG ; Pan, J. J.; Chang, G. J. | Theoretical Computer Science | 3 | 3 | |
2004 | Interval numbers of powers of block graphs | Chen,? M. J.; Chang, G. J. | Discrete Mathematics | | | |
2005 | Isometric-path numbers of block graphs | GERARD JENNHWA CHANG ; Pan, J. J.; Chang, G. J. | Information Processing Letters | 7 | 4 | |
2003 | k-Domination in graphs | Liao, C.-S.; Chang, G. J. | Information Processing Letters | | | |
2001 | The K_r-packing problem | Guruswami, Venkatesan; Rangan, C. Pandu; Chang, M. S.; Chang, G. J.; Wong, C. K. | Computing | | | |
2009 | L(h, k)-labelings of Hamming graphs | Huang, L. H.; Chang, G. J. | Discrete Mathematics | | | |
2009 | L(h,k)-labelings of Hamming graphs | Huang, L.-H.; Chang, G. J. | Discrete Mathematics | | | |
2001 | Minimum span of no-hole (r+1)-distant colorings | Chang, G. J.; Juan S. T. ; Liu, D. D.-F. | SIAM Journal on Discrete Mathematics | | | |
2007 | No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups | GERARD JENNHWA CHANG ; Chang, G. J.; Lu, C. H.; Zhou, S. M. | Discrete Mathematics | 8 | 7 | |
2009 | Note on the m-step competition numbers of paths and cycles | Zhao, Y.; GERARD JENNHWA CHANG ; Zhao, Y. Q.; Chang, G. J. | Discrete Applied Mathematics | 10 | 9 | |
2007 | On the (n,t)-antipodal Gray codes | Chang, G. J.; Eu, S. P.; Yeh, C. H. | Theoretical Computer Science | | | |