2008 | ||
---|---|---|
87 | EE | Bo-Jr Li, Gerard J. Chang: Clique coverings and partitions of line graphs. Discrete Mathematics 308(11): 2075-2079 (2008) |
86 | EE | Justie Su-tzu Juan, Gerard J. Chang: Adaptive group testing for consecutive positives. Discrete Mathematics 308(7): 1124-1129 (2008) |
85 | EE | Gerard J. Chang: The upper bound on k-tuple domination numbers of graphs. Eur. J. Comb. 29(5): 1333-1336 (2008) |
84 | EE | Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih: On fully orientability of 2-degenerate graphs. Inf. Process. Lett. 105(5): 177-181 (2008) |
83 | EE | Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang: Finding cycles in hierarchical hypercube networks. Inf. Process. Lett. 109(2): 112-115 (2008) |
2007 | ||
82 | Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang: Bipancyclicity of Hierarchical Hypercube Networks. PDPTA 2007: 180-184 | |
81 | EE | Gerard J. Chang, Jer-Jeong Chen, David Kuo, Sheng-Chyang Liaw: Distance-two labelings of digraphs. Discrete Applied Mathematics 155(8): 1007-1013 (2007) |
80 | EE | Gerard J. Chang, Changhong Lu, Sanming Zhou: No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups. Discrete Mathematics 307(14): 1808-1817 (2007) |
79 | EE | Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen: Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs. Discrete Mathematics 307(2): 208-215 (2007) |
78 | EE | Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang: (t, k) - Diagnosis for Matching Composition Networks under the MM* Model. IEEE Trans. Computers 56(1): 73-79 (2007) |
77 | EE | Ruei-Yu Wu, Gen-Huey Chen, Yu-Liang Kuo, Gerard J. Chang: Node-disjoint paths in hierarchical hypercube networks. Inf. Sci. 177(19): 4200-4207 (2007) |
76 | EE | Gerard J. Chang, Hung-Lin Fu, Xuding Zhu: Editorial note. J. Comb. Optim. 14(2-3): 111-112 (2007) |
75 | EE | Justie Su-tzu Juan, Gerard J. Chang: Group testing in graphs. J. Comb. Optim. 14(2-3): 113-119 (2007) |
74 | EE | Yu-Ping Tsao, Gerard J. Chang: Profile minimization on compositions of graphs. J. Comb. Optim. 14(2-3): 177-190 (2007) |
73 | EE | Jer-Jeong Chen, Gerard J. Chang: Distance graphs on R n with 1-norm. J. Comb. Optim. 14(2-3): 267-274 (2007) |
72 | EE | Jun-Jie Pan, Gerard J. Chang: Induced-path partition on graphs with special blocks. Theor. Comput. Sci. 370(1-3): 121-130 (2007) |
71 | EE | Gerard J. Chang, Sen-Peng Eu, Chung-Heng Yeh: On the (n, t)-antipodal Gray codes. Theor. Comput. Sci. 374(1-3): 82-90 (2007) |
2006 | ||
70 | EE | Min Zhao, Liying Kang, Gerard J. Chang: Power domination in graphs. Discrete Mathematics 306(15): 1812-1816 (2006) |
69 | EE | Jun-Jie Pan, Gerard J. Chang: Isometric path numbers of graphs. Discrete Mathematics 306(17): 2091-2096 (2006) |
68 | EE | Yu-Ping Tsao, Gerard J. Chang: Profile minimization on products of graphs. Discrete Mathematics 306(8-9): 792-800 (2006) |
67 | EE | Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang: (t, k)-Diagnosis for Matching Composition Networks. IEEE Trans. Computers 55(1): 88-92 (2006) |
2005 | ||
66 | EE | Jun-Jie Pan, Gerard J. Chang: Path partition for graphs with special blocks. Discrete Applied Mathematics 145(3): 429-436 (2005) |
65 | EE | Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen: Diagnosabilities of Regular Networks. IEEE Trans. Parallel Distrib. Syst. 16(4): 314-323 (2005) |
64 | EE | Jun-Jie Pan, Gerard J. Chang: Isometric-path numbers of block graphs. Inf. Process. Lett. 93(2): 99-102 (2005) |
2004 | ||
63 | EE | Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen: Locally connected spanning trees on graphs CoRR cs.DS/0409013: (2004) |
62 | EE | Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen: Diagnosabilities of regular networks CoRR cs.NI/0408022: (2004) |
61 | EE | Gerard J. Chang: The weighted independent domination problem is NP-complete for chordal graphs. Discrete Applied Mathematics 143(1-3): 351-352 (2004) |
60 | EE | Mingjang Chen, Gerard J. Chang, Douglas B. West: Interval numbers of powers of block graph. Discrete Mathematics 275(1-3): 87-96 (2004) |
59 | EE | Gerard J. Chang, Li-Da Tong, Hong-Tsu Wang: Geodetic spectra of graphs. Eur. J. Comb. 25(3): 383-391 (2004) |
58 | EE | Yung-Ling Lai, Gerard J. Chang: On the profile of the corona of two graphs. Inf. Process. Lett. 89(6): 287-292 (2004) |
57 | EE | Gerard J. Chang, Chiuyuan Chen, Yaping Chen: Vertex and Tree Arboricities of Graphs. J. Comb. Optim. 8(3): 295-306 (2004) |
2003 | ||
56 | Gerard J. Chang, Sheng-Chyang Liaw: The L(2, 1)-labeling problem on ditrees. Ars Comb. 66: (2003) | |
55 | EE | Hong-Gwa Yeh, Gerard J. Chang: Centers and medians of distance-hereditary graphs. Discrete Mathematics 265(1-3): 279-310 (2003) |
54 | EE | Gerard J. Chang, Changhong Lu: Distance-two labelings of graphs. Eur. J. Comb. 24(1): 53-58 (2003) |
53 | EE | Chung-Shou Liao, Gerard J. Chang: k-tuple domination in graphs. Inf. Process. Lett. 87(1): 45-50 (2003) |
2002 | ||
52 | Min-Jen Jou, Gerard J. Chang: Algorithmic aspects of counting independent sets. Ars Comb. 65: (2002) | |
51 | Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh: Domination in distance-hereditary graphs. Discrete Applied Mathematics 116(1-2): 103-113 (2002) | |
50 | Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh: k-Subdomination in graphs. Discrete Applied Mathematics 120(1-3): 55-60 (2002) | |
49 | Mingjang Chen, Gerard J. Chang: Total interval numbers of complete r-partite graphs. Discrete Applied Mathematics 122(1-3): 83-92 (2002) | |
48 | EE | Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh: A note on the Gallai-Roy-Vitaver Theorem. Discrete Mathematics 256(1-2): 441-444 (2002) |
47 | EE | Gerard J. Chang: Corrigendum to "The path-partition problem in block graphs". Inf. Process. Lett. 83(5): 293 (2002) |
2001 | ||
46 | Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu: No-hole 2-distant colorings for unit interval graphs. Ars Comb. 61: (2001) | |
45 | EE | Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong: The Kr-Packing Problem. Computing 66(1): 79-89 (2001) |
44 | EE | Mingjang Chen, Gerard J. Chang: Families of Graphs Closed Under Taking Powers. Graphs and Combinatorics 17(2): 207-212 (2001) |
43 | EE | Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu: Minimum Span of No-Hole (r+1)-Distant Colorings. SIAM J. Discrete Math. 14(3): 370-380 (2001) |
42 | EE | Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert: Preface. Theor. Comput. Sci. 263(1-2): 1 (2001) |
41 | EE | Li-Da Tong, Frank K. Hwang, Gerard J. Chang: Channel graphs of bit permutation networks. Theor. Comput. Sci. 263(1-2): 139-143 (2001) |
40 | EE | Hong-Gwa Yeh, Gerard J. Chang: Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs. Theor. Comput. Sci. 263(1-2): 3-8 (2001) |
2000 | ||
39 | Gerard J. Chang, Xuding Zhu: Pseudo-Hamiltonian-connected graphs. Discrete Applied Mathematics 100(3): 145-153 (2000) | |
38 | Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang: Linear k-arboricities on trees. Discrete Applied Mathematics 103(1-3): 281-287 (2000) | |
37 | EE | Gerard J. Chang, Wen-Tsai Ke, David Kuo, Daphne Der-Fen Liu, Roger K. Yeh: On L(d, 1)-labelings of graphs. Discrete Mathematics 220(1-3): 57-66 (2000) |
36 | EE | Lingling Huang, Gerard J. Chang: Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples. Eur. J. Comb. 21(2): 241-248 (2000) |
1999 | ||
35 | Sheng-Chyang Liaw, David Kuo, Gerard J. Chang: Integral Sum Numbers of Graphs. Ars Comb. 54: (1999) | |
34 | EE | Sheng-Chyang Liaw, Gerard J. Chang: Rabin numbers of Butterfly networks. Discrete Mathematics 196(1-3): 219-227 (1999) |
33 | EE | Gerard J. Chang, Min-Jen Jou: The number of maximal independent sets in connected triangle-free graphs. Discrete Mathematics 197-198: 169-178 (1999) |
32 | EE | Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley: Characterizations of bipartite Steinhaus graphs. Discrete Mathematics 199(1-3): 11-25 (1999) |
31 | EE | Gerard J. Chang, Lingling Huang, Xuding Zhu: Circular chromatic numbers of Mycielski's graphs. Discrete Mathematics 205(1-3): 23-37 (1999) |
30 | EE | Gerard J. Chang, Daphne Der-Fen Liu, Xuding Zhu: Distance Graphs and T-Coloring. J. Comb. Theory, Ser. B 75(2): 259-269 (1999) |
29 | EE | Gerard J. Chang, Frank K. Hwang, Li-Da Tong: Characterizing bit permutation networks. Networks 33(4): 261-267 (1999) |
1998 | ||
28 | Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong: The Vertex-Disjoint Triangles Problem. WG 1998: 26-37 | |
27 | EE | Hong-Gwa Yeh, Gerard J. Chang: Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs. Discrete Applied Mathematics 87(1-3): 245-253 (1998) |
26 | EE | Frank K. Hwang, Gerard J. Chang: Enumerating Consecutive and Nested Partitions for Graphs. Eur. J. Comb. 19(1): 63-70 (1998) |
25 | EE | Gerard J. Chang, Lingling Huang, Xuding Zhu: Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs. Eur. J. Comb. 19(4): 423-431 (1998) |
24 | Sheng-Chyang Liaw, Gerard J. Chang: Generalized Diameters and Rabin Numbers of Networks. J. Comb. Optim. 2(4): 371-384 (1998) | |
23 | Gerard J. Chang, Fu-Loong Chen, Lingling Huang, Frank K. Hwang, Su-Tzu Nuan, Uriel G. Rothblum, I-Fan Sun, Jan-Wen Wang, Hong-Gwa Yeh: Sortabilities of Partition Properties. J. Comb. Optim. 2(4): 413-427 (1998) | |
22 | Gerard J. Chang, Frank K. Hwang, Y. C. Yao: Localizing Combinatorial Properties for Partitions on Block Graphs. J. Comb. Optim. 2(4): 429-441 (1998) | |
21 | EE | Shiow-Fen Hwang, Gerard J. Chang: k-Neighborhood-Covering and -Independence Problems for Chordal Graphs. SIAM J. Discrete Math. 11(4): 633-643 (1998) |
1997 | ||
20 | EE | Gerard J. Chang, Pei-Hsin Ho: The ß-assignment problem in general graphs. Computers & OR 24(8): 757-765 (1997) |
19 | EE | Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi: k-Path Partitions in Trees. Discrete Applied Mathematics 78(1-3): 227-233 (1997) |
18 | EE | Min-Jen Jou, Gerard J. Chang: Maximal Independent Sets in Graphs with at Most One Cycle. Discrete Applied Mathematics 79(1-3): 67-73 (1997) |
17 | EE | Yuh-Jiuan Tsay, Gerard J. Chang: The exact gossiping problem. Discrete Mathematics 163(1-3): 165-172 (1997) |
16 | EE | David Kuo, Gerard J. Chang, Y. H. Harris Kwong: Cordial labeling of mKn. Discrete Mathematics 169(1-3): 121-131 (1997) |
15 | EE | Chiuyuan Chen, Chin-Chen Chang, Gerard J. Chang: Proper interval graphs and the guard problem. Discrete Mathematics 170(1-3): 223-230 (1997) |
14 | EE | Gerard J. Chang, Frank K. Hwang: Optimality of consecutive and nested tree partitions. Networks 30(2): 75-80 (1997) |
1996 | ||
13 | EE | Maw-Shang Chang, Yi-Hua Chen, Gerard J. Chang, Jing-Ho Yan: Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs. Discrete Applied Mathematics 66(3): 189-203 (1996) |
12 | EE | Jing-Ho Yan, Jer-Jeong Chen, Gerard J. Chang: Quasi-threshold Graphs. Discrete Applied Mathematics 69(3): 247-255 (1996) |
11 | EE | Gerard J. Chang, Yuh-Jiuan Tsay: The partial gossiping problem. Discrete Mathematics 148(1-3): 9-14 (1996) |
10 | EE | Gerard J. Chang, David Kuo: The L(2, 1)-Labeling Problem on Graphs. SIAM J. Discrete Math. 9(2): 309-316 (1996) |
1995 | ||
9 | Hong-Gwa Yeh, Gerard J. Chang: Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs. Combinatorics and Computer Science 1995: 48-52 | |
8 | EE | Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg: Weighted Independent Perfect Domination on Cocomparability Graphs. Discrete Applied Mathematics 63(3): 215-222 (1995) |
1994 | ||
7 | Jing-Ho Yan, Gerard J. Chang: The Path-Partition Problem in Block Graphs. Inf. Process. Lett. 52(6): 317-322 (1994) | |
6 | David Kuo, Gerard J. Chang: The Profile Minimization Problem in Trees. SIAM J. Comput. 23(1): 71-81 (1994) | |
1993 | ||
5 | Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg: Weighted Independent Perfect Domination on Cocomparability Graphs. ISAAC 1993: 506-514 | |
1992 | ||
4 | Hsun-Ming Lee, Gerard J. Chang: Set to Set Broadcasting in Communication Networks. Discrete Applied Mathematics 40(4): 411-421 (1992) | |
1990 | ||
3 | EE | Feng-Chu Lai, Gerard J. Chang: An upper bound for the transversal numbers of 4-uniform hypergraphs. J. Comb. Theory, Ser. B 50(1): 129-133 (1990) |
2 | Tung-Lin Lu, Pei-Hsin Ho, Gerard J. Chang: The Domatic Number Problem in Interval Graphs. SIAM J. Discrete Math. 3(4): 531-536 (1990) | |
1988 | ||
1 | EE | Gerard J. Chang: Labeling algorithms for domination problems in sun-free chordal graphs. Discrete Applied Mathematics 22(1): 21-34 (1988) |