F. K. Hwang

Publication Activity (10 Years)

Years Active: 1972-2005
Publications (10 Years): 0

Publications

F. K. Hwang
A hierarchy of importance indices. IEEE Trans. Reliab. 54 (1) (2005)
F. K. Hwang, Y. M. Wang, J. S. Lee
Sortability of Multi-partitions. J. Glob. Optim. 24 (4) (2002)
F. K. Hwang
A new index of component importance. Oper. Res. Lett. 28 (2) (2001)
F. K. Hwang
Comment/reply: some recent papers on consecutively-connected systems. IEEE Trans. Reliab. 45 (1) (1996)
F. K. Hwang
An isomorphic factorization of the complete graph. J. Graph Theory 19 (3) (1995)
F. K. Hwang, Dana S. Richards
Steiner tree problems. Networks 22 (1) (1992)
F. K. Hwang, S. Papastavridis
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones. Discret. Appl. Math. 30 (1) (1991)
F. K. Hwang, Yi-Ching Yao
A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization. Oper. Res. Lett. 10 (4) (1991)
F. K. Hwang
A primer of the Euclidean Steiner problem. Ann. Oper. Res. 33 (1) (1991)
F. K. Hwang
System. Math. Oper. Res. 14 (2) (1989)
Robert Chen, F. K. Hwang
Stronger players win more balanced knockout tournaments. Graphs Comb. 4 (1) (1988)
F. K. Hwang, Y. H. Xu
Double loop networks with minimum delay. Discret. Math. 66 (1-2) (1987)
D. Z. Du, F. K. Hwang
Systems. Math. Oper. Res. 11 (1) (1986)
D. Borkovitz, F. K. Hwang
Multiplicative magic squares. Discret. Math. 47 (1983)
F. K. Hwang
Complete balanced Howell rotations for 8k+5 teams. Discret. Math. 39 (2) (1982)
F. K. Hwang
Computing the Blocking Probabilities for Spiderweb Channel Graphs. IEEE Trans. Commun. 30 (8) (1982)
F. K. Hwang
Blocking Probabilities for a Class of Spiderweb Channel Graphs. IEEE Trans. Commun. 28 (1) (1980)
F. K. Hwang
An explicit expression for the cost of a class of Huffman trees. Discret. Math. 32 (2) (1980)
F. R. K. Chung, F. K. Hwang
The Connection Patterns of Two Complete Binary Trees. SIAM J. Algebraic Discret. Methods 1 (3) (1980)
F. K. Hwang
Maximum Wealth Trees. Math. Oper. Res. 5 (4) (1980)
F. R. K. Chung, F. K. Hwang
points enclosed in a rectangle with given perimeter. Networks 9 (1) (1979)
F. K. Hwang
Link designs and probability analyses for a class of connecting networks. Networks 8 (4) (1978)
F. K. Hwang, J. C. Lagarias
Minimum range sequences of all k-subsets of a set. Discret. Math. 19 (3) (1977)
F. R. K. Chung, F. K. Hwang
A problem on blocking probabilities in connecting networks. Networks 7 (2) (1977)
F. K. Hwang
Rearrangeability of multi-connection three-stage clos networks. Networks 2 (4) (1972)