第 1 到 53 筆結果,共 53 筆。
公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 | |
---|---|---|---|---|---|---|---|
1 | 1999 | The consecutive-4 digraphs are Hamiltonian | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
2 | 1999 | Bipartite Steinhaus graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
3 | 1999 | Characterizing bit permutation networks | GERARD JENNHWA CHANG | Networks | |||
4 | 1999 | On k-ary spanning trees of tournaments | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
5 | 1999 | Circular chromatic numbers of Mycielski's graphs | GERARD JENNHWA CHANG | Discrete Mathematics | |||
6 | 1999 | Distance Graphs andT-Coloring | GERARD JENNHWA CHANG | Journal of Combinatorial Theory. Series B | 39 | 33 | |
7 | 1999 | Algorithmic aspects of linear k-arboricity | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
8 | 1999 | New comparisons in birnbaum importance for the consecutive-k-out-of-n system | GERARD JENNHWA CHANG | Probability in the Engineering and Informational Sciences | |||
9 | 1999 | Rabin numbers of Butterfly networks | GERARD JENNHWA CHANG | Discrete Mathematics | |||
10 | 1999 | The circular chromatic number of the Mycielskian of Gd k | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
11 | 1999 | Characterizations of bipartite Steinhaus graphs | GERARD JENNHWA CHANG | Discrete Mathematics | |||
12 | 1999 | The number of maximal independent sets in connected triangle-free graphs | GERARD JENNHWA CHANG | Discrete Mathematics | |||
13 | 1999 | T-colorings and T-edge spans of graphs | GERARD JENNHWA CHANG | Graphs and Combinatorics | |||
14 | 1999 | Reliabilities for (n,f,k) systems | GERARD JENNHWA CHANG | Statistics and Probability Letters | |||
15 | 1999 | Wide diameters of butterfly networks | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
16 | 1998 | Localizing Combinatorial Properties for Partitions on Block Graphs | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | |||
17 | 1998 | K-neighborhood-covering and -independence problems for chordal graphs | GERARD JENNHWA CHANG | SIAM Journal on Discrete Mathematics | |||
18 | 1998 | Weighted connected domination and Steiner trees in distance-hereditary graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
19 | 1998 | Circular chromatic numbers and fractional chromatic numbers of distance graphs | GERARD JENNHWA CHANG | European Journal of Combinatorics | |||
20 | 1998 | The β-assignment problems | GERARD JENNHWA CHANG | European Journal of Operational Research | |||
21 | 1998 | The path-partition problem in bipartite distance-hereditary graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
22 | 1998 | Sortabilities of Partition Properties | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | |||
23 | 1998 | Generalized Diameters and Rabin Numbers of Networks | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | |||
24 | 1997 | Optimality of consecutive and nested tree partitions | GERARD JENNHWA CHANG | Networks | |||
25 | 1997 | Proper interval graphs and the guard problem 1 | GERARD JENNHWA CHANG | Discrete Mathematics | |||
26 | 1997 | Algorithmic aspects of majority domination | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
27 | 1997 | Signed Degree Sequences of Signed Graphs | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
28 | 1997 | Cordial labeling of mKn | GERARD JENNHWA CHANG | Discrete Mathematics | |||
29 | 1997 | Integral Distance Graphs | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
30 | 1997 | K-path partitions in trees | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
31 | 1997 | The hamiltonian property of the consecutive-3 digraph | GERARD JENNHWA CHANG | Mathematical and Computer Modelling | 4 | 5 | |
32 | 1997 | Maximal independent sets in graphs with at most one cycle | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
33 | 1997 | The β-assignment problem in general graphs | GERARD JENNHWA CHANG | Computers and Operations Research | |||
34 | 1997 | The exact gossiping problem | GERARD JENNHWA CHANG | Discrete Mathematics | |||
35 | 1997 | Medians of graphs and kings of tournaments | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
36 | 1996 | The L(2, 1)-labeling problem on graphs | GERARD JENNHWA CHANG | SIAM Journal on Discrete Mathematics | |||
37 | 1996 | The partial gossiping problem | GERARD JENNHWA CHANG | Discrete Mathematics | |||
38 | 1996 | Quasi-threshold graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
39 | 1996 | Algorithmic aspects of the generalized clique-transversal problem on chordal graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 28 | 24 | |
40 | 1996 | A finiteness theorem for maximal independent sets | GERARD JENNHWA CHANG | Graphs and Combinatorics | |||
41 | 1995 | Weighted independent perfect domination on cocomparability graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 33 | 28 | |
42 | 1994 | Profile minimization problem in trees | GERARD JENNHWA CHANG | SIAM Journal on Computing | |||
43 | 1994 | The path-partition problem in block graphs | GERARD JENNHWA CHANG | Information Processing Letters | 20 | 0 | |
44 | 1992 | Set to set broadcasting in communication networks | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 15 | 13 | |
45 | 1991 | Centers of chordal graphs | GERARD JENNHWA CHANG | Graphs and Combinatorics | 12 | 9 | |
46 | 1991 | The k-neighbor domination problem | GERARD JENNHWA CHANG | European Journal of Operational Research | 10 | 5 | |
47 | 1990 | An upper bound for the transversal numbers of 4-uniform hypergraphs | GERARD JENNHWA CHANG | Journal of Combinatorial Theory, Series B | 48 | 41 | |
48 | 1989 | Total domination in block graphs | GERARD JENNHWA CHANG | Operations Research Letters | 20 | 18 | |
49 | 1988 | Labeling algorithms for domination problems in sun-free chordal graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 53 | 42 | |
50 | 1987 | The minimum of the antichains in the factor poset | GERARD JENNHWA CHANG | Order | 0 | 0 | |
51 | 1985 | The poset scheduling problem | GERARD JENNHWA CHANG | Order | 7 | 5 | |
52 | 1982 | R-domination on block graphs | GERARD JENNHWA CHANG | Operations Research Letters | 16 | 0 | |
53 | 1982 | Group testing with two defectives | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 20 | 23 |