Academic Webs

Chair Professor Frank Kwang-Ming Hwang

Contact

Email: fkhwang@gmail.com
Tel:
Fax:
Address:

Teaching

Fall Semester, 2024：

Spring Semester, 2024：

Vitae

Education
- Ph. D. , North Carolina State Univ. (1968)

Research Areas
- Combinatorial Optimization
- Discrete Mathematics
- Communication Networks

Positions, Honors and Awards

Selected Publications

(A) Refereed Papers：

Chang, G. J., Chen, F. L., Huang, L. L., Hwang, F. K., Nuan, S. T., Rothblum, U. G., Sun, I. F., Wang, J. W. and Yeh, H. G., Sortability of partition properties, J. Combin. Opt., 2, pp. 413-427 (1999).
Chang, G. J., Hwang, F. K. and Yao, Y. C., Localizing Combinatorial Properties of Graph Partitions, J. Combin. Opt., 2, pp. 429-441 (1999).
Chang, G. J., Cui, L. R. and Hwang, F. K., Reliabilities for (n, f, k) systems, Stat. Prob. Lett. 43, pp. 237-242 (1999).
Chang, G. J., Cui, L. R. and Hwang, F. K., New comparisons in Birnbaum importance for the consecutive-k-out-of-n system, Prob. Eng. Inform. Sci. 13, pp. 187-192, (1999).
Chang, G. J., Hwang, F. K. and Dong, L. D., Characterizing the bit permutation networks, Networks 33, pp. 261-267, (1999).
Chang, G. J., Hwang, F. K. and Tong, L. T., The consecutive-4 digraphs are Hamiltonian, J. Graph Thy. 31, pp. 1-6 (1999).
Gao, B., Hwang, F. K., Li, W. C. and Rothblum, U. J., Partition Polytopes over 1-Dimensional Points, Math. Program. 85, pp. 335-362 (1999).
Hwang, F. K., Onn, S. and Rothblum, U. G., A polynomial time algorithm for shaped partition problems, SIAM J. Opt. 10, pp. 101-107 (1999).
Lin F. H., Kuo W. and Hwang, F. K., Structure importance of consecutive-k-out-of-n systems, OR Letters 25, pp. 101-107 (1999).
Richards, G. W. and Hwang, F. K., Extended Generalized Shuffle Networks: Sufficient Conditions for Strictly Nonblocking Operations, Networks 33, pp. 269-291 (1999).
Du, D. Zu, Hwang, F. K. and Xue, G. L. Interconnecting highways, SIAM J. Disc. Math. 12, pp. 252-261 (1999).
Chen, C. Y. and Hwang, F. K., The minimum distance diagram of double loop networks, IEEE Trans. Comput. 49, pp. 977-979 (2000).
Hwang F. K., Random k-set pool designs with distinct columns, Prob. Eng. Inform. Sci. 14, pp. 47-56 (2000).
C. Y. Chen and F. K. Hwang, Equivalent L-shapes of double-loop networks for the degenerate case, J. Intercon. Networks, 1, pp. 47-60 (2000).
Hwang, F. K. Onn, S. and Rothblum, U. G., Linear shaped Partition Problems, O. R. Letters, 26, pp. 159-163 (2000).
Hwang, F. K., Cui, L. R., Chang, J. C. and Lin W. D., Comments on “Relability and Component importance of a consecutive-k system, by zuo, Microelec. Rel. 40,pp.1061-1063(2000).
Hwang, F. K. & Liaw, S. C., On nonblocking multicast 3-stage Clos networks, IEEE/ACM Trans. Network.8, pp. 535-539(2000).
Du, D. Z. and Hwang F. K., Combinatorial Group Testing and Its Applications, 2nd Ed., World Scientific, Singapore, 2000.
Chang, G. J., Cui, L. R. and Hwang, F. K., Reliabilities of Consecutive – k system, Kluwer, Boston, 2000.
Hwang, F. K., Onn, S. and Rothblum, U. G., Explicit solution of partition priblems over a one-dimensional parameter space, Naval Res. logist, 47, pp. 531-540(2000).
Hwang, F. K. Liao, M. J. and Chen, C. Y., Supermodularity of various partition functions, J. Global Opt., 18, pp.227-282 (2000).
Chen, C. Y. and Hwang, F. K., Equivalentnondegenerate L –shapes of double-loop networks, Networks, 36, pp.118-125(2000)
Hwang, F. K. and Chen, S. K., The1.5-loop network and the mixed 1.5-loop network, Proc 7 th Intem.Colloq. Structural Inform. Commun. Complexity, (2000).
Hwang, F. K. and Pai, C. K., Sequential construction of a circular consecutive-2 system, Inform. Proc. Lett., 75, pp. 231-235(2000).
Chang, G. J., Hwang, F. K. and Cui, L., corrigenda on “ New comparisions in Birnbaum importance for the consecutive – k –out-of- n system”, Prob. Engin. Inform. Sci. 14, pp. 405 (2000).
Huang, S. H. Hwang, F. K. and Liu Y. H., Equivalent double-loop networks, Taiwan J. Math., 4, pp.661-668 (2000).
Du, D. Z., Hwang, F. K., Jung, Y. and Ngo, H. Q., Optimal consecutive- k –out-of- (2k+1) : G cycle, J. Global Opt., 19 (2001) 51-60.
Chang, H. W., Hwang, F. K. and Lee, J. S., Direct proofs of some explicit fomulas in enumerating partition classes, Bull. Inst. Acad. Sinica, 29, pp. 99-103 (2001).
Tsai, K. W., Wang, D. W. and Hwang, F. K., Lower bounds for wide-sense nonblocking Clos networks, Theor. Comput. Sci., 261,pp.323-328(2001).
Hwang F. K., A new index of compoment inportance, OR Letters, 28 (2001), pp.25-29.
Dong, L. D., Hwang, F. K. and Chang, G., Channel graphs of bit permutation networks, Theor. Comput. Sci. A 263, pp. 139-143 (2001).
Hwang F. K., A complementary survey of the double-loop networks, Theor. Comput. Sci. 273 A, pp. 211-229 (2001).
Chang, J. C., Chen, R. J. and Hwang, F. K., On regular reliability models, in Systems and Bayesian reliability, Eds: Y. Hayakawa, T-Irony and M. Xie, Birkehouse, Boston, 2001.
Hwang, F. K., A proposed experiment on soap film solutions of planar Euclidean Steiner trees, in Steiner Trees in Industries, Eds: D. Z. Du and X. Cheng, Kluwer, Boston, 2002, pp.281-284.
Hwang, F. K. and J. S. Jee, Optimal quantitative group testing on cycles and paths, Disc. Appl. Math., 113, pp.299-302(2001).
Du, D. Z., Fishburn, P. C., Gao, B. and Hwang, F. K., Wide-sense nonblocking for 3-stage Clos networks, in Advances in Switching Networks, eds. D. Z. Du and H. Q. Ngo, Kluwer, 2001. pp.89-100.
Hwang, F. K. and Liu, Y. C., Expected number of unresolved positive clones for various random pool designs, Prob. Engin. Inform. Sci., 15, pp.57-68(2001)
Huang, S. H. and Hwang, F. K., When is individual group testing optimal for nonadaptive group testing? SIAM J. Disc. Math. 14,pp.540-548(2001).
Hwang, F. K. and C. H. Yen, Characterizing graphs of bit permutation networks with application to photonic switching, Networks. 38 (2001) 1-5.
Chang, J. C. and Hwang, F. K., Reliabilities on Consecutive- k system, in Contribution to the Reliability Engineering Handbook, ed. H. Pham, Springer Verlag, pp. 1-14 (2001).
Chang, J. C., Chen, R. J. and Hwang, F. K., A minimal-automation-based reliability algorithm of Con(d, k, n) system, Method. Comput. Appl. Prob., 3(2001) 379-386.
Hu, X. D., Jia, S. H., Du, D. Z. and Hwang, F. K., Monotone routing in multirate rearrangeable Clos Networks, J. Para. Distr. comput. 61 (2001) 1381-1388.
Hwang, F. K., A complementary survey on double-loop networks, Theor. Comput. Sci. 263(2001) 211-229.
Hwang, F. K., Combinatorial group testing-simple problems, difficult answers and many applications, Proc. ICCM Conf., 2001, Taipei.
F. K. Hwang W. D. Lin, the number of rearrangments in a 3-stage Clos network using an auxiliary switch, in Switching Networks: Recent Advances, eds: D. Z. Du and H. Q. Ngo, Kluwer, 2001, pp.179-190.
Du, D.Z., Hwang, F.K., Jia, X. and Ngo, H.Q., optimal consecutive-k-out-of-n: G cycle for n 2k+1, SIAM.J. Disc. Math., 15(2002) 305-316.
Chang, H. W. and Hwang, F. K., Rare-event component importance for the consecutive-k system, Naval Res. Logis. Quar., 49(2002)159-166.
Chang,H. W., Chen, R. J. and Hwang, F. K., The structural Birnbaum importance of consecutive-k systems, J. Combin. Opt. 6;pp.183-197(2002).
Hwang, F. K., Yao, Y. C. and Dasgupta B., Some permutation routing algorithms for low-dimensional hypercube, Theor. Comput. Sci. A, 270,pp.111-124(2002).
F. K. Hwang and W. Zhang Group testing and fault detection for replicated files, Disc. Appl. Math. 116, pp.231-242(2002).
F. K. Hwang, J. S. Lee and Y. M. Wang, Sortability of multi-partitions, J. Global Opt., 24, pp. 463-472 (2002).
Hwang, F. K., A survey of multi-loop networks, Theor. Comput. Sci., 299(2003) 107-121.
Chang, J. C., Chen, R. J. and Hwang, F. K., An efficient algorithm for the reliability of comsecutive- k –out-of- n : Fsystem, Inter. Comput. Symp., Workshop on Algorithms, Dec. 1998, pp.51-54. J. Inform Sci. Eng. 19(2003) 159-166.
Hwang, F. K., Lee, J. S., Liu, Y. C. and Rothblum, U. G., Sortability of Vector Partitions, Disc. math., 263, pp.129-142(2003)
S. K. Chen, F. K. Hwang and Y. C. Liu, Mixed chordal rings, J. Inter. Networks, 4(2003) 3-16.
Huang, H. M., Hwang, F. K. and J. F. Ma, using transforming matrices to generate DNA clone grids, Disc. Appl. Math., 129(2003)421-431.
Huang, F. K., On error correction of Macuda’s pool designs, Disc. Math., 268(2003) 311-314.
Chen, C. Y., Hwang, F. K., Lee, J. S. and Shih, S. J., The existence of hyper-L triple loop networks, Disc. Math, 268(2003) 287-291.
F. K. Hwang and Y. C. Liu, Error-tolerant pooling designs with Inhibitors, J. Comput. Biology, 10, pp. 231-236(2003).
F. K. Hwang and Y. C. Liu, Random pooling designs under various structures, J. Combin. Opt. 7, pp. 339-352(2003)
F. K. Hwang and W. D. Lin. The incremental group testing model for gap closing in sequencing long molecules, J. Combin. Opt. 7, pp. 327-337(2003).
F.K.Hwang and B.C.Lin, Wide diameter of hyper-L triple-loop networks, J. Intercon. Netw. 3, pp.245-252(2003).
F.K.Hwang and B.C.Lin, Wide-sense nonblocking multicast log_2 (N,m,p) networks, IEEE Trans. Commun., 51(2003) 1730-1735.
F. K. Hwang, A survey of nonblocking multicast 3-stage Clos networks, IEEE Commun. Mag., Oct. 2003, 34-37.
F. K. Hwang, S. C. Liaw and L. D. Tong, Strictly nonblocking 3-stage Clos networks with some rearrangeable multicast capability, IEEE Trans. Commun., 51(2003) 1765-1767.
C. Y. Chen, F. K. Hwang, J. S. Lee and S. J. Shih, The existence of hyper-L triple-loop networks, Disc. Math., 268(2003) 287-291.
F.K.Hwang and Y.C.Liu, A general approach to compute the probabilities of unresolved clones for various random pooling designs, Probab. Eng. Inform. Sci., 18, pp. 161-183, 2004.
H. L. Fu, F. K. Hwang, M. Jimbo, Y. Mutoh and C.L. Shiue, Decomposing complete graphs into , J. Statist. Plan. Inf., 119(2004) 225-236.
Hwang, F. K., Lee, J. S. and Rothblum, U. G., Permutation polytopes corresponding to strongly supermodular functions, Disc. Appl. Math., 142(2004) 87-97.
C. C. Ho and F. K. Hwang, Dynamic assignments on consective-2 systems, Inter. J. Pure and Appl. Math., Inter. J. Pure Appl. Math. 12(2004) 125-132.
W. R. Chen, F. K. Hwang and X. Zhu, Equivalence of the 1-rate model to the classical model on strictly nonblocking switching networks, SIAM J. Disc. Math. 17(2004) 446-452.
F. H. Chang, J. Y. Guo, F. K. Hwang and C. K. Lin, The wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies Theor. Comput. Sci, 314(2004) 375-386.
J. Y. Guo and F. K. Hwang, Modifying a parity-check matrix to a separable matrix, Inter. J. Pure Appl. Math. 16(2004) 173-179.
A. Jalali, A. G. Hawkes, L. R. Cui and F. K. Hwang, The optimal consecutive-k-out-of-n: G line for , J. Statist. Plan. Infer. 128(2005) 281-287.
F. K. Hwang and B. W. Zhang, Strict nonblockingness of reduced shuffle-exchange networks, Networks 45(2005) 1-48.
F. K. Hwang, A competitive algorithm to find all defective edges in a graph, Disc. Appl. Math., 148(2005) 273-277.
F.K.Hwang, A hierarchy of importance indices, IEEE Trans. Rel., 54(2005) 169-172.
Y. J. Guo and F. K. Hwang, An almost linear time and linear space algorithm for the longest common subsequence problem, Inform. Proc. Lett., 94(2005) 131-135.
H. B. Chen and F. K. Hwang, On multicast rearrangeable 3-stage Clos networks without first-stage fan-out, SIAM J. Disc. Math., 352 (2006) 232-239.
D.Z.Du and F.K.Hwang, Pooling Designs and Nonadaptive Group Testing, World Scientific, Singapore, 2006.
Chang, J. C., R. J. Chen and Hwang, F. K., An efficient algorithm for the Reliabitity of consecutive-k out of n networks, J. Inform Sci. Eng., to appear.
F.K.Hwang and W.D.Lin, A general construction for nonblocking crosstalk-free photonic switching networks, Networks, to appear.
F. K. Hwang and U. G. Rothblum, Partition-optimization with Schur convex sum objective functions, SIAM J. Disc. Math., to appear.
A. G. D’yachkov, F. K. Hwang, A. J. Macula, P. A. Vilenkin and C. W. Weng, A construction of pooling designs with some happy surprises, J. Comput. Biology, to appear.
F. H. Chang and F. K. Hwang, Super modularity in mean partition problems, J. Global Opt., to appear.
H. B. Chen, F. K. Hwang and C. M. Li, Bounding the number of columns which appear only in positive pools, Taiwan. J. Math., to appear.
F. K. Hwang, Y. He and Y. Wang, Strictly nonboocking multirate rearrangeable networks, SIAM J. Disc. Math., to appear.
Y. Wang and F. K. Hwang, Monotone routing and multirate rearrangeable network, Zhejiang University Journal, to appear.
F. K. Hwang, A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks, IEEE Trans. Commum. to appear.
H. L. Fu and F. K. Hwang, On 3-stage Clos network with different nonblocking requirementson two types of calls, J. Combin. Opt., to appear.
F. K. Hwang and W. D. Lin, Necessary and sufficient conditions for rearrangeable , IEEE Trans. Commun., to appear.
F. K. Hwang and U. G. Rothblum, A polytope approach to the optimal assembly problem J. Global Opt., to appear.
X. Bao, F. K. Hwang and Q. Li, Rearrangeability of bit permutation networks, TCS, to appear.
F. Chang, J. Guo and F. Hwang, Wide-sense nonblacking for multi- networks under various routing strategies TCS(A), to appear.
F. K. Hwang, W. D. Lin and V. Lioubimov, On noninteruptive rearrangeable networks, IEEE/ACM Netw., to appear.
D. Z. Du, F. K. Hwang, W. Wu and T. Znati, A new construction of transversal design, J. Comput. Biol, to appear.
M. Y. Chen, F. K. Hwang, C. H. Yen, Tessellating polyominos in the plane. Disc. Math., to appear.
H. L. Fu and F. K. Hwang, A novel use of t-packings to construct d-disjunct matrices, Disc. Appl. Math., to appear.
F. H. Chang, H. B. Chen, J. Y. Guo, F. K. Hwang and U. G. Rothblum, One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions, J. Combin. Opt., to appear.
T. Chen and F. K. Hwang, A competitive algorithm in searching for many edges in a hypergraph, Disc. Appl. Math., to appear.
F.H.Chang, F.K.Hwang and U.G.Rothblum, The mean partition problem, J. Global Opt., to appear.
B.Golany, F.K.Hwang and U.G.Rothblum, Sphere-separable partitions of multi-parameter elements, Disc. Appl. Math., to appear.

go back