第 1 到 161 筆結果,共 161 筆。
公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 | |
---|---|---|---|---|---|---|---|
1 | 2015 | From edge-coloring to strong edge-coloring | GERARD JENNHWA CHANG | Electronic Journal of Combinatorics | |||
2 | 2015 | On the k-power domination of hypergraphs | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 9 | 7 | |
3 | 2015 | Max-Coloring of Vertex-Weighted Graphs | GERARD JENNHWA CHANG | Graphs and Combinatorics | 2 | 2 | |
4 | 2015 | The number of steps and the final configuration of relaxation procedures on graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 0 | 0 | |
5 | 2015 | Strong edge-coloring for jellyfish graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 4 | 4 | |
6 | 2014 | Strong chromatic index of planar graphs with large girth | GERARD JENNHWA CHANG | Discussiones Mathematicae - Graph Theory | 10 | 12 | |
7 | 2014 | The linear guessing number of undirected graphs | GERARD JENNHWA CHANG | Linear Algebra and Its Applications | 2 | 2 | |
8 | 2014 | Bandwidth sums of block graphs and cacti | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 0 | 0 | |
9 | 2014 | On the algorithmic complexity of k-tuple total domination | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 6 | 6 | |
10 | 2014 | Dot product dimensions of graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 5 | 2 | |
11 | 2014 | Graphs with small balanced decomposition numbers | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 0 | 0 | |
12 | 2014 | Counterexamples to an edge spread question for zero forcing number | GERARD JENNHWA CHANG | Linear Algebra and Its Applications | 0 | 0 | |
13 | 2013 | A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs. | Lin, Ching-Chi; Chen, Gen-Huey; GERARD JENNHWA CHANG | Algorithmica | 2 | 1 | |
14 | 2013 | Rainbow domination and related problems on strongly chordal graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 7 | 5 | |
15 | 2013 | On the mixed domination problem in graphs | GERARD JENNHWA CHANG | Theoretical Computer Science | 24 | 22 | |
16 | 2013 | A short proof for Chen's Alternative Kneser Coloring Lemma | GERARD JENNHWA CHANG | Journal of Combinatorial Theory. Series A | 9 | 11 | |
17 | 2013 | Algorithmic aspects of the k-domination problem in graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 23 | 15 | |
18 | 2013 | Strong chromatic index of 2-degenerate graphs | GERARD JENNHWA CHANG | Journal of Graph Theory | 27 | 24 | |
19 | 2013 | Roman domination on strongly chordal graphs | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 84 | 74 | |
20 | 2013 | B-coloring of tight bipartite graphs and the Erdös-Faber-Lovász conjecture | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 8 | 9 | |
21 | 2013 | B-chromatic numbers of powers of paths and cycles | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 3 | 2 | |
22 | 2013 | On a conjecture on the balanced decomposition number | GERARD JENNHWA CHANG | Discrete Mathematics | 1 | 1 | |
23 | 2012 | Strong edge-coloring for cubic Halin graphs | Chang, Gerard Jennhwa ; GERARD JENNHWA CHANG ; Liu, Daphne Der-Fen | Discrete Mathematics | 13 | 11 | |
24 | 2012 | Parity and strong parity edge-colorings of graphs | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 0 | 0 | |
25 | 2012 | The competition number of a graph with exactly two holes | Li, Bo-Jr; GERARD JENNHWA CHANG ; Chang, Gerard J. | Journal of Combinatorial Optimization | 6 | 5 | |
26 | 2012 | (Δ + 1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles | GERARD JENNHWA CHANG | Discrete Mathematics | 1 | 1 | |
27 | 2012 | First-fit chromatic numbers of d-degenerate graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 4 | 4 | |
28 | 2012 | Generalized power domination of graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 44 | 33 | |
29 | 2012 | Balanced k-decompositions of graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 1 | 1 | |
30 | 2012 | Roman domination on 2-connected graphs | Liu, Chun-Hung; GERARD JENNHWA CHANG ; Chang, Gerard J. | SIAM Journal on Discrete Mathematics | 33 | 29 | |
31 | 2012 | Competition numbers of complete r-partite graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 8 | 7 | |
32 | 2012 | Equitable colorings of Cartesian products of graphs | Lin, Wu-Hsiung; GERARD JENNHWA CHANG ; Chang, Gerard J. | Discrete Applied Mathematics | 16 | 15 | |
33 | 2012 | Complexity of distance paired-domination problem in graphs | GERARD JENNHWA CHANG | Theoretical Computer Science | 6 | 5 | |
34 | 2012 | Hamiltonian numbers of Möbius double loop networks | Chang, Gerard J.; Yang, Tzu-Hsiang; GERARD JENNHWA CHANG ; Chang, Ting-Pang; Sun, Yeali S.; Lai, Feipei; Tong, Li-Da | Journal of Combinatorial Optimization | 4 | 4 | |
35 | 2012 | Upper bounds on Roman domination numbers of graphs | Liu, Chun-Hung; GERARD JENNHWA CHANG ; Chang, Gerard Jennhwa | Discrete Mathematics | 44 | 33 | |
36 | 2012 | Upper k-tuple domination in graphs | GERARD JENNHWA CHANG | Discrete Mathematics and Theoretical Computer Science | |||
37 | 2012 | A characterization of graphs with rank 5 | Chang, Gerard J.; GERARD JENNHWA CHANG ; Huang, Liang-Hao; Yeh, Hong-Gwa | Linear Algebra and Its Applications | 63 | 59 | |
38 | 2011 | Note on two-φ-tolerance competition graphs | GERARD JENNHWA CHANG | Proceedings - 2010 1st ACIS International Symposium on Cryptography, and Network Security, Data Mining and Knowledge Discovery, E-Commerce and Its Applications, and Embedded Systems, CDEE 2010 | 0 | 0 | |
39 | 2011 | On the number of subsequences with a given sum in a finite abelian group | Chang, Gerard Jennhwa ; GERARD JENNHWA CHANG ; Chen, Sheng-Hua; Qu, Yongke; Wang, Guoqing; Zhang, Haiyan | Electronic Journal of Combinatorics | |||
40 | 2011 | Local condition for planar graphs of maximum degree 7 to be 8-totally colorable | GERARD JENNHWA CHANG ; Chang, Gerard Jennhwa ; Hou, Jianfeng; Roussel, Nicolas | Discrete Applied Mathematics | 19 | 19 | |
41 | 2011 | Vertex-coloring edge-weightings of graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
42 | 2011 | Near-automorphisms of paths | GERARD JENNHWA CHANG ; Chang, Gerard J. | Journal of Graph Theory | 1 | 1 | |
43 | 2011 | The L(2, 1)-F-labeling problem of graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
44 | 2011 | A characterization of graphs with rank 4 | Chang, Gerard J.; GERARD JENNHWA CHANG ; Huang, Liang-Hao; Yeh, Hong-Gwa | Linear Algebra and Its Applications | 69 | 60 | |
45 | 2011 | Consecutive edge-colorings of generalized θ-graphs | GERARD JENNHWA CHANG | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 1 | 0 | |
46 | 2010 | On the total choosability of planar graphs and of sparse graphs | Chang, Gerard Jennhwa ; GERARD JENNHWA CHANG ; Hou, Jianfeng; Roussel, Nicolas | Information Processing Letters | 10 | 10 | |
47 | 2010 | Equitable colorings of Kronecker products of graphs | GERARD JENNHWA CHANG ; Lin, Wu-Hsiung; Chang, Chia-Chieh; Chang, Gerard J. | Discrete Applied Mathematics | 11 | 9 | |
48 | 2010 | Rainbow domination on trees | GERARD JENNHWA CHANG ; Chang, Gerard J.; Wu, Jiaojiao; Zhu, Xuding | Discrete Applied Mathematics | 85 | 68 | |
49 | 2010 | On competition polysemy and m-competition polysemy | GERARD JENNHWA CHANG | Ars Combinatoria | |||
50 | 2010 | Multicompetition numbers of some multigraphs | GERARD JENNHWA CHANG | Ars Combinatoria | |||
51 | 2010 | The degree-preserving spanning tree problem in strongly chordal and directed path graphs | Lin, Ching-Chi; Chang, Gerard J.; Chen, Gen-Huey ; GERARD JENNHWA CHANG | Networks | 2 | 2 | |
52 | 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 | Linear Algebra and Its Applications | 3 | 3 | |
53 | 2010 | On minimum rank and zero forcing sets of a graph | Huang, Liang-Hao; GERARD JENNHWA CHANG ; Chang, Gerard J.; Yeh, Hong-Gwa | Linear Algebra and Its Applications | 40 | 33 | |
54 | 2009 | Independent arcs of acyclic orientations of complete r-partite graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 6 | 4 | |
55 | 2009 | A note on equitable colorings of forests | Chang, G. J.; GERARD JENNHWA CHANG | European Journal of Combinatorics | 13 | 8 | |
56 | 2009 | The competition number of a graph with exactly h holes, all of which are independent | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 14 | 13 | |
57 | 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 | |
58 | 2009 | L (h, k)-labelings of Hamming graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 5 | 6 | |
59 | 2009 | Distance-two labellings of Hamming graphs | Chang, G. J.; GERARD JENNHWA CHANG ; Lu, C.; Zhou, S. | Discrete Applied Mathematics | 8 | 8 | |
60 | 2008 | 圖論中的廣意著色問題 (新制多年期第1年) | 張鎮華 | ||||
61 | 2008 | 圖論中控制問題的演算法 (新制多年期第1年) | 張鎮華 | ||||
62 | 2008 | The upper bound on k-tuple domination numbers of graphs | GERARD JENNHWA CHANG | European Journal of Combinatorics | 15 | 13 | |
63 | 2008 | Preface | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
64 | 2007 | 圖論中控制問題的演算法 (新制多年期第2年) | 張鎮華 | ||||
65 | 2007 | 北部地區數學期刊圖書服務計畫(3/3) | 張鎮華 | ||||
66 | 2007 | 圖論中的廣意著色問題 (新制多年期第2年) | 張鎮華 | ||||
67 | 2007 | 國家理論科學研究中心子計畫一(4/5) | 張鎮華 | ||||
68 | 2007 | Group testing in graphs | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 2 | 1 | |
69 | 2007 | Journal of Combinatorial Optimization: Editorial note | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 0 | 0 | |
70 | 2007 | On the (n, t)-antipodal Gray codes | GERARD JENNHWA CHANG | Theoretical Computer Science | 4 | 2 | |
71 | 2006 | Power domination in graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 78 | 69 | |
72 | 2006 | Isometric path numbers of graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 11 | 9 | |
73 | 2006 | (t, k)-Diagnosis for Matching Composition Networks. | Chang, Guey-Yun; Chen, Gen-Huey; GEN-HUEY CHEN ; GERARD JENNHWA CHANG | IEEE Trans. Computers | 43 | 37 | |
74 | 2006 | Profile minimization on products of graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 2 | 1 | |
75 | 2005 | The PIGs full monty - A floor show of minimal separators | GERARD JENNHWA CHANG | Lecture Notes in Computer Science | |||
76 | 2005 | Diagnosabilities of Regular Networks. | Chang, Guey-Yun; Chang, Gerard J.; GEN-HUEY CHEN ; GERARD JENNHWA CHANG | IEEE Trans. Parallel Distrib. Syst. | 99 | 89 | |
77 | 2005 | Path partition for graphs with special blocks | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 2 | 1 | |
78 | 2004 | Geodetic spectra of graphs | GERARD JENNHWA CHANG | European Journal of Combinatorics | 4 | 8 | |
79 | 2004 | Vertex and tree arboricities of graphs | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 15 | 15 | |
80 | 2004 | The weighted independent domination problem is NP-complete for chordal graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 23 | 19 | |
81 | 2004 | Interval numbers of powers of block graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 2 | 1 | |
82 | 2003 | Centers and medians of distance-hereditary graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 15 | 15 | |
83 | 2003 | Distance-two labelings of graphs | GERARD JENNHWA CHANG | European Journal of Combinatorics | 37 | 30 | |
84 | 2003 | k-tuple domination in graphs | GERARD JENNHWA CHANG | Information Processing Letters | 85 | 71 | |
85 | 2003 | The L(2, 1)-labeling problem on ditrees | GERARD JENNHWA CHANG | Ars Combinatoria | |||
86 | 2002 | 通信網路中的信息傳送問題(1/2) | 張鎮華 | ||||
87 | 2002 | K-Subdomination in graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 10 | 6 | |
88 | 2002 | Total interval numbers of complete r-partite graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 2 | 2 | |
89 | 2002 | Algorithmic aspect of k-tuple domination in graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
90 | 2002 | Erratum: The path-partition problem in block graphs (Information Processing Letters (1994) 52 (317-322)) | GERARD JENNHWA CHANG | Information Processing Letters | 1 | 3 | |
91 | 2002 | Group testing in bipartite graphs | Juan, S.T.; GERARD JENNHWA CHANG ; 張鎮華 ; Juan, S.T.; Chang, G.J. | Taiwanese Journal of Mathematics | |||
92 | 2002 | Domination in distance-hereditary graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 17 | 12 | |
93 | 2002 | A note on the Gallai-Roy-Vitaver Theorem | GERARD JENNHWA CHANG | Discrete Mathematics | |||
94 | 2002 | Algorithmic aspects of counting independent sets | GERARD JENNHWA CHANG | Ars Combinatoria | |||
95 | 2001 | Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs | GERARD JENNHWA CHANG | Theoretical Computer Science | 12 | 9 | |
96 | 2001 | No-hole 2-distant colorings for unit interval graphs | GERARD JENNHWA CHANG | Ars Combinatoria | |||
97 | 2001 | Minimum span of no-hole (r + 1)-distant colorings | GERARD JENNHWA CHANG | SIAM Journal on Discrete Mathematics | 4 | 4 | |
98 | 2001 | A survey on circular chromatic numbers of graphs | 張鎮華 ; Chang, G.J. | AMS/IP Studies in Advanced Mathematics 20: | |||
99 | 2001 | Channel graphs of bit permutation networks | GERARD JENNHWA CHANG | Theoretical Computer Science | 3 | 3 | |
100 | 2001 | Families of graphs closed under taking powers | GERARD JENNHWA CHANG | Graphs and Combinatorics | |||
101 | 2001 | The Kr-packing problem | Venkatesan; Rangan, C. Pandu; Chang, M.S.; 張鎮華 ; Wong, C.K.; Chang, G.J. | Computing | |||
102 | 2000 | Pseudo-Hamiltonian-connected graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
103 | 2000 | Reliabilities of Consecutive-k Systems | 張鎮華 ; L. Cui; F.K. Hwang; Chang, G.J. | ||||
104 | 2000 | Integral Sum Numbers of Graphs | GERARD JENNHWA CHANG | Ars Combinatoria | |||
105 | 2000 | On L(d, 1)-labelings of graphs | GERARD JENNHWA CHANG | Discrete Mathematics | |||
106 | 2000 | Linear k-arboricities on trees | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
107 | 2000 | The number of maximum independent sets in graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
108 | 2000 | Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples | GERARD JENNHWA CHANG | European Journal of Combinatorics | |||
109 | 1999 | The number of maximal independent sets in connected triangle-free graphs | GERARD JENNHWA CHANG | Discrete Mathematics | |||
110 | 1999 | T-colorings and T-edge spans of graphs | GERARD JENNHWA CHANG | Graphs and Combinatorics | |||
111 | 1999 | Reliabilities for (n,f,k) systems | GERARD JENNHWA CHANG | Statistics and Probability Letters | |||
112 | 1999 | Wide diameters of butterfly networks | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
113 | 1999 | On k-ary spanning trees of tournaments | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
114 | 1999 | Bipartite Steinhaus graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
115 | 1999 | Characterizing bit permutation networks | GERARD JENNHWA CHANG | Networks | |||
116 | 1999 | Characterizations of bipartite Steinhaus graphs | GERARD JENNHWA CHANG | Discrete Mathematics | |||
117 | 1999 | Algorithmic aspects of linear k-arboricity | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
118 | 1999 | The consecutive-4 digraphs are Hamiltonian | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
119 | 1999 | Rabin numbers of Butterfly networks | GERARD JENNHWA CHANG | Discrete Mathematics | |||
120 | 1999 | The circular chromatic number of the Mycielskian of Gd k | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
121 | 1999 | New comparisons in birnbaum importance for the consecutive-k-out-of-n system | GERARD JENNHWA CHANG | Probability in the Engineering and Informational Sciences | |||
122 | 1999 | Distance Graphs andT-Coloring | GERARD JENNHWA CHANG | Journal of Combinatorial Theory. Series B | 39 | 33 | |
123 | 1999 | Circular chromatic numbers of Mycielski's graphs | GERARD JENNHWA CHANG | Discrete Mathematics | |||
124 | 1998 | Localizing Combinatorial Properties for Partitions on Block Graphs | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | |||
125 | 1998 | Sortabilities of Partition Properties | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | |||
126 | 1998 | The path-partition problem in bipartite distance-hereditary graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
127 | 1998 | Generalized Diameters and Rabin Numbers of Networks | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | |||
128 | 1998 | The β-assignment problems | GERARD JENNHWA CHANG | European Journal of Operational Research | |||
129 | 1998 | Weighted connected domination and Steiner trees in distance-hereditary graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
130 | 1998 | Circular chromatic numbers and fractional chromatic numbers of distance graphs | GERARD JENNHWA CHANG | European Journal of Combinatorics | |||
131 | 1998 | K-neighborhood-covering and -independence problems for chordal graphs | GERARD JENNHWA CHANG | SIAM Journal on Discrete Mathematics | |||
132 | 1997 | Optimality of consecutive and nested tree partitions | GERARD JENNHWA CHANG | Networks | |||
133 | 1997 | Algorithmic aspects of majority domination | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
134 | 1997 | K-path partitions in trees | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
135 | 1997 | The β-assignment problem in general graphs | GERARD JENNHWA CHANG | Computers and Operations Research | |||
136 | 1997 | The exact gossiping problem | GERARD JENNHWA CHANG | Discrete Mathematics | |||
137 | 1997 | Integral Distance Graphs | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
138 | 1997 | The hamiltonian property of the consecutive-3 digraph | GERARD JENNHWA CHANG | Mathematical and Computer Modelling | 4 | 5 | |
139 | 1997 | Proper interval graphs and the guard problem 1 | GERARD JENNHWA CHANG | Discrete Mathematics | |||
140 | 1997 | Maximal independent sets in graphs with at most one cycle | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
141 | 1997 | Medians of graphs and kings of tournaments | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
142 | 1997 | Signed Degree Sequences of Signed Graphs | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
143 | 1997 | Cordial labeling of mKn | GERARD JENNHWA CHANG | Discrete Mathematics | |||
144 | 1996 | The partial gossiping problem | GERARD JENNHWA CHANG | Discrete Mathematics | |||
145 | 1996 | The L(2, 1)-labeling problem on graphs | GERARD JENNHWA CHANG | SIAM Journal on Discrete Mathematics | |||
146 | 1996 | Quasi-threshold graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
147 | 1996 | A finiteness theorem for maximal independent sets | GERARD JENNHWA CHANG | Graphs and Combinatorics | |||
148 | 1996 | Algorithmic aspects of the generalized clique-transversal problem on chordal graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 28 | 24 | |
149 | 1995 | Weighted independent perfect domination on cocomparability graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 33 | 28 | |
150 | 1994 | Profile minimization problem in trees | GERARD JENNHWA CHANG | SIAM Journal on Computing | |||
151 | 1994 | The path-partition problem in block graphs | GERARD JENNHWA CHANG | Information Processing Letters | 20 | 0 | |
152 | 1992 | Set to set broadcasting in communication networks | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 15 | 13 | |
153 | 1991 | Centers of chordal graphs | GERARD JENNHWA CHANG | Graphs and Combinatorics | 12 | 9 | |
154 | 1991 | The k-neighbor domination problem | GERARD JENNHWA CHANG | European Journal of Operational Research | 10 | 5 | |
155 | 1990 | An upper bound for the transversal numbers of 4-uniform hypergraphs | GERARD JENNHWA CHANG | Journal of Combinatorial Theory, Series B | 48 | 41 | |
156 | 1989 | Total domination in block graphs | GERARD JENNHWA CHANG | Operations Research Letters | 20 | 18 | |
157 | 1988 | Labeling algorithms for domination problems in sun-free chordal graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 53 | 42 | |
158 | 1987 | The minimum of the antichains in the factor poset | GERARD JENNHWA CHANG | Order | 0 | 0 | |
159 | 1985 | The poset scheduling problem | GERARD JENNHWA CHANG | Order | 7 | 5 | |
160 | 1982 | R-domination on block graphs | GERARD JENNHWA CHANG | Operations Research Letters | 16 | 0 | |
161 | 1982 | Group testing with two defectives | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 20 | 23 |