Optimal Merging of 2 Elements with n Elements. - Frank K. Hwang; Shen Lin 005 (Acta Informatica, 1971)

Constructions for Balanced Howell Rotations for Bridge Tournaments. - Elwyn R. Berlekamp; Frank K. Hwang (J. Comb. Theory A, 1972)

Rearrangeability of multi-connection three-stage clos networks. - Frank K. Hwang (Networks, 1972)

A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets. - Frank K. Hwang; Shen Lin 005 (SIAM J. Comput., 1972)

Hypergeometric group testing algorithms. - Frank K. Hwang; Shen Lin 005 (AFIPS National Computer Conference, 1973)

A Class of Merging Algorithms. - Frank K. Hwang; David N. Deutsch (J. ACM, 1973)

A Direct Method to Construct Triple Systems. - Frank K. Hwang; Shen Lin 005 (J. Comb. Theory A, 1974)

On the rearrangeability of some multistage connecting networks. - Frank K. Hwang (Bell Syst. Tech. J., 1976)

New Constructions for Balanced Howell Rotations. - Frank K. Hwang (J. Comb. Theory A, 1976)

New Classes of Complete Balanced Howell Rotations. - Frank K. Hwang (J. Comb. Theory A, 1976)

Minimum range sequences of all k-subsets of a set. - Frank K. Hwang; J. C. Lagarias 001 (Discret. Math., 1977)

Neighbor Designs. - Frank K. Hwang; Shen Lin 005 (J. Comb. Theory A, 1977)

Rectilinear steiner trees: Efficient special-case algorithms. - Alfred V. Aho; Michael R. Garey; Frank K. Hwang (Networks, 1977)

A problem on blocking probabilities in connecting networks. - F. R. K. Chung; Frank K. Hwang (Networks, 1977)

Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units. - M. R. Garey; Frank K. Hwang; David S. Johnson 001 (IEEE Trans. Computers, 1977)

Distribution of Integers into k-tuples with Prescribed Conditions. - Frank K. Hwang; Shen Lin 005 (J. Comb. Theory A, 1978)

Link designs and probability analyses for a class of connecting networks. - Frank K. Hwang (Networks, 1978)

Some Optimal Partition Problems with Applications to Switching Networks. - Frank K. Hwang (IEEE Trans. Commun., 1978)

An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees. - Frank K. Hwang (J. ACM, 1979)

Crisscross Latin Squares. - Frank K. Hwang (J. Comb. Theory A, 1979)

The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter. - F. R. K. Chung; Frank K. Hwang (Networks, 1979)

On the construction of balanced switching networks. - Frank K. Hwang; Shen Lin 005 (Networks, 1979)

An explicit expression for the cost of a class of Huffman trees. - Frank K. Hwang (Discret. Math., 1980)

Maximum Wealth Trees. - Frank K. Hwang (Math. Oper. Res., 1980)

Optimal Merging of 3 Elements with n Elements. - Frank K. Hwang (SIAM J. Comput., 1980)

A Group Testing Problem. - Gerard J. Chang; Frank K. Hwang (SIAM J. Algebraic Discret. Methods, 1980)

The Connection Patterns of Two Complete Binary Trees. - F. R. K. Chung; Frank K. Hwang (SIAM J. Algebraic Discret. Methods, 1980)

Blocking Probabilities for a Class of Spiderweb Channel Graphs. - Frank K. Hwang (IEEE Trans. Commun., 1980)

Group testing with two defectives. - Gerard J. Chang; Frank K. Hwang; Shen Lin 005 (Discret. Appl. Math., 1982)

Complete balanced Howell rotations for 8k+5 teams. - Frank K. Hwang (Discret. Math., 1982)

A Short Proof of a Result of Pollak on Steiner Minimal Trees. - Ding-Zhu Du; E. Y. Yao; Frank K. Hwang (J. Comb. Theory A, 1982)

Computing the Blocking Probabilities for Spiderweb Channel Graphs. - Frank K. Hwang (IEEE Trans. Commun., 1982)

Multiplicative magic squares. - D. Borkovitz; Frank K. Hwang (Discret. Math., 1983)

A partition identity. - Frank K. Hwang; Victor K.-W. Wei (Discret. Math., 1983)

A class of full Steiner minimal trees. - Frank K. Hwang; Jia Feng Weng; Ding-Zhu Du (Discret. Math., 1983)

Latin Squares and Superqueens. - Frank K. Hwang; Ko-Wei Lih (J. Comb. Theory A, 1983)

Control Algorithms for Rearrangeable Clos Networks. - Frank K. Hwang (IEEE Trans. Commun., 1983)

A Multiplication Theorem for Balanced Howell Rotations. - Ding-Zhu Du; Frank K. Hwang (J. Comb. Theory A, 1984)

Selecting k Objects from a Cycle with p Pairs of Separation s. - Frank K. Hwang (J. Comb. Theory A, 1984)

Selecting Non-consecutive Balls Arranged in Many Lines. - Frank K. Hwang; János Körner; Victor K.-W. Wei (J. Comb. Theory A, 1984)

Complete Balanced Howell Rotations for 16k + 12 Partnerships. - Frank K. Hwang; Qin De Kang; Jia En Yu (J. Comb. Theory A, 1984)

Diagonal and Pandiagonal Tournament Latin Squares. - Gerard J. Chang; Frank K. Hwang (Eur. J. Comb., 1985)

The Steiner Ratio Conjecture Is True for Five Points. - Ding-Zhu Du; Frank K. Hwang; E. Y. Yao (J. Comb. Theory A, 1985)

Optimal consecutive-2 systems of lines and cycles. - Ding-Zhu Du; Frank K. Hwang (Networks, 1985)

Component-level redundancy is better than system-level redundancy for channel graphs. - Frank K. Hwang; Lawrence A. Shepp (Networks, 1985)

Doubly Linked Ring Networks. - Ding-Zhu Du; D. Frank Hsu; Frank K. Hwang (IEEE Trans. Computers, 1985)

Do local majorities force a global majority? - Peter C. Fishburn; Frank K. Hwang; Hikyu Lee (Discret. Math., 1986)

Hexagonal coordinate systems and steiner minimal trees. - Frank K. Hwang; J. F. Weng (Discret. Math., 1986)

Optimal Consecutive-2-Out-of-n Systems. - D. Z. Du; Frank K. Hwang (Math. Oper. Res., 1986)

On a conjecture of trietsch and handler on the flow-dependent steiner ratio. - Ding-Zhu Du; Frank K. Hwang (Networks, 1986)

On Nonblocking Multiconnection Networks. - Frank K. Hwang; Andrzej Jajszczyk (IEEE Trans. Commun., 1986)

Minimal-Distance Routing for Kykios II. - Ding-Zhu Du; Frank K. Hwang; Andrew M. Odlyzko; Yanjun Zhang (ICPP, 1987)

Steiner Minimal Trees on Sets of Four Points. - Ding-Zhu Du; Frank K. Hwang; G. D. Song; G. Y. Ting (Discret. Comput. Geom., 1987)

Steiner Minimal Trees for Regular Polygons. - Ding-Zhu Du; Frank K. Hwang; J. F. Weng (Discret. Comput. Geom., 1987)

Double loop networks with minimum delay. - Frank K. Hwang; Y. H. Xu (Discret. Math., 1987)

Comments on "Reliable Loop Topologies for Large Local Computer Networks". - Frank K. Hwang (IEEE Trans. Computers, 1987)

Cutoff points for roll call protocols in multiple access systems. - Frank K. Hwang; Xian M. Chang (IEEE Trans. Inf. Theory, 1987)

Some inequalities concerning random subsets of a set. - Frank K. Hwang; Lawrence A. Shepp (IEEE Trans. Inf. Theory, 1987)

A Decomposition Theorem on Euclidean Steiner Minimal Trees. - Frank K. Hwang; G. D. Song; G. Y. Ting; Ding-Zhu Du (Discret. Comput. Geom., 1988)

The Existence of Symmetric Skew Balanced Starters for Odd Prime Powers. - Jia En Yu; Frank K. Hwang (Eur. J. Comb., 1988)

Stronger players win more balanced knockout tournaments. - Robert Chen; Frank K. Hwang (Graphs Comb., 1988)

Diameters of Weighted Double Loop Networks. - Ying Cheng 006; Frank K. Hwang (J. Algorithms, 1988)

Generalized de Bruijn digraphs. - Ding-Zhu Du; Frank K. Hwang (Networks, 1988)

Optimal Detection of Two Defectives with a Parity Check Device. - Xian M. Chang; Frank K. Hwang; J. F. Weng (SIAM J. Discret. Math., 1988)

A Fundamental Monotonicity in Group Testing. - Yi-Ching Yao; Frank K. Hwang (SIAM J. Discret. Math., 1988)

Asymptotic results for partial concentrators. - Michael R. Garey; Frank K. Hwang; Gaylord W. Richards (IEEE Trans. Commun., 1988)

A Survey on Double Loop Networks. - Frank Kwang-Ming Hwang (Reliability Of Computer And Communication Networks, 1989)

Optimal Assignment of Components to a Two-Stage k-Out-of-n System. - Frank K. Hwang (Math. Oper. Res., 1989)

Y. C. Yao: Cutoff Point and Monotonicity Properties for Multinomial Group Testing. - Frank K. Hwang (SIAM J. Discret. Math., 1989)

A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels. - Frank K. Hwang; Yi-Ching Yao (IEEE Trans. Inf. Theory, 1989)

An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio - Ding-Zhu Du; Frank K. Hwang (FOCS, 1990)

Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees. - Frank K. Hwang; Yi-Ching Yao (Algorithmica, 1990)

Optimal Assembly of an s-Stage k-OUT-OF-n System. - Ding-Zhu Du; Frank K. Hwang (SIAM J. Discret. Math., 1990)

On the cutoff point for pairwise enabling for infinite users in a multiaccess system. - Yi-Ching Yao; Frank K. Hwang (IEEE Trans. Inf. Theory, 1990)

A primer of the Euclidean Steiner problem. - Frank K. Hwang (Ann. Oper. Res., 1991)

Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones. - Frank K. Hwang; S. Papastavridis (Discret. Appl. Math., 1991)

The Hamiltonian property of generalized de Bruijn digraphs. - Ding-Zhu Du; D. Frank Hsu; Frank K. Hwang; X. M. Zhang (J. Comb. Theory B, 1991)

A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization. - Frank K. Hwang; Yi-Ching Yao (Oper. Res. Lett., 1991)

Using combinatorial designs to construct partial concentrators. - Frank K. Hwang; Gaylord W. Richards (IEEE Trans. Commun., 1991)

A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio. - Ding-Zhu Du; Frank K. Hwang (Algorithmica, 1992)

Foreword. - Frank K. Hwang (Algorithmica, 1992)

The Rectilinear Steiner Arborescence Problem. - Sailesh K. Rao; P. Sadayappan; Frank K. Hwang; Peter W. Shor (Algorithmica, 1992)

An Improved Upper Bound for the Subarray Partial Concentrators. - Xiao-Dong Hu 001; Frank K. Hwang (Discret. Appl. Math., 1992)

The Capacity of the Subarray Partial Concentrators. - Frank K. Hwang; Gaylord W. Richards (Discret. Appl. Math., 1992)

Routing Algorithms for Double Loop Networks. - Y. Cheng; Frank K. Hwang; Ian F. Akyildiz; D. Frank Hsu (Int. J. Found. Comput. Sci., 1992)

The Shortest Network under a Given Topology. - Frank K. Hwang; J. F. Weng (J. Algorithms, 1992)

Reliabilities of chordal rings. - Xiao-Dong Hu 001; Frank Kwang-Ming Hwang (Networks, 1992)

Steiner tree problems. - Frank K. Hwang; Dana S. Richards (Networks, 1992)

Generalization of an engineering principle. - Frank K. Hwang; Uriel G. Rothblum (Oper. Res. Lett., 1992)

Reducing the Steiner Problem in a Normed Space. - Ding-Zhu Du; Frank K. Hwang (SIAM J. Comput., 1992)

Adaptive and Oblivious Algorithms for D-Cube Permutation Routing. - Miltos D. Grammatikakis; D. Frank Hsu; Frank K. Hwang (ISAAC, 1993)

Universality of D-Cube (D<8). - Miltos D. Grammatikakis; D. Frank Hsu; Frank K. Hwang (PARCO, 1993)

Competitive Group Testing. - Ding-Zhu Du; Frank K. Hwang (Discret. Appl. Math., 1993)

Erratum: Binary Vectors with Exactly k Nonoverlapping m-Tuples of Consecutive ones. - Frank K. Hwang; Stavros G. Papastavridis (Discret. Appl. Math., 1993)

Majorization and Schur Convexity with Respect to Partial Orders. - Frank K. Hwang; Uriel G. Rothblum (Math. Oper. Res., 1993)

Most reliable double loop networks in survival reliability. - Xiao-Dong Hu 001; Frank K. Hwang; Wen-Ch'ing Winnie Li (Networks, 1993)

A two-stage network with dual partial concentrators. - Frank K. Hwang; Gaylord W. Richards (Networks, 1993)

An optimal group testing algorithm on k disjoint sets. - J. F. Weng; Frank K. Hwang (Oper. Res. Lett., 1993)

Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders. - Frank K. Hwang; Uriel G. Rothblum; Larry A. Shepp (SIAM J. Discret. Math., 1993)

A New Competitive Algorithm for Group Testing. - Amotz Bar-Noy; Frank K. Hwang; Ilan Kessler; Shay Kutten (Discret. Appl. Math., 1994)

Cutting Numbers for the Forward Loop Backward Hop Network. - Xiao-Dong Hu 001; Frank K. Hwang (Discret. Appl. Math., 1994)

Constrained partitioning problems. - Frank K. Hwang; Uriel G. Rothblum (Discret. Appl. Math., 1994)

Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules. - Frank K. Hwang; Uriel G. Rothblum (Oper. Res., 1994)

A New Competitive Algorithm for the Counterfeit Coin Problem. - Xiao-Dong Hu 001; P. D. Chen; Frank K. Hwang (Inf. Process. Lett., 1994)

Minimal-distance routing for KYKLOS II. - Ding-Zhu Du; Frank K. Hwang; Andrew M. Odlyzko; Yanjun Zhang (Networks, 1994)

Comments on "Network Resilience: A Measure of Network Fault Tolerance". - Frank K. Hwang (IEEE Trans. Computers, 1994)

The Time Complexity of Deterministic Broadcast Radio Networks. - Frank K. Hwang (Discret. Appl. Math., 1995)

Enumerating Nested and Consecutive Partitions. - Frank K. Hwang; Colin L. Mallows (J. Comb. Theory A, 1995)

An isomorphic factorization of the complete graph. - Frank K. Hwang (J. Graph Theory, 1995)

Assembly at system level versus component level. - Frank K. Hwang; Uriel G. Rothblum (Oper. Res. Lett., 1995)

Survival Reliability of Some Double-Loop Networks and Chordal Rings. - Frank K. Hwang; Paul E. Wright (IEEE Trans. Computers, 1995)

Localizing combinatorial properties of partitions. - Frank K. Hwang; Uriel G. Rothblum; Yi-Ching Yao (Discret. Math., 1996)

Extremal Permutations with Respect to Weak Majorizations. - Frank K. Hwang (Eur. J. Comb., 1996)

Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions. - Frank K. Hwang; Uriel G. Rothblum (Math. Oper. Res., 1996)

Efficient algorithms for the reliabilities of replicated n-parallel-task graphs. - Frank K. Hwang; Paul E. Wright (Oper. Res. Lett., 1996)

Optimality of Nested Partitions and Its Application to Cluster Analysis. - Endre Boros; Frank K. Hwang (SIAM J. Optim., 1996)

A new decomposition algorithm for rearrangeable Clos interconnection networks. - Hyun Yeop Lee; Frank K. Hwang; John D. Carpinelli (IEEE Trans. Commun., 1996)

Comment/reply: some recent papers on consecutively-connected systems. - Frank K. Hwang (IEEE Trans. Reliab., 1996)

Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation. - Gaylord W. Richards; Frank K. Hwang (Advances in Switching Networks, 1997)

On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks. - Peter C. Fishburn; Frank K. Hwang; Ding-Zhu Du; Biao Gao (Discret. Appl. Math., 1997)

A d-move Local Permutation Routing for the d-cube. - Frank K. Hwang; Yi-Ching Yao; Miltos D. Grammatikakis (Discret. Appl. Math., 1997)

Optimality of consecutive and nested tree partitions. - Gerard J. Chang; Frank K. Hwang (Networks, 1997)

Exact reliabilities of most reliable double-loop networks. - Frank K. Hwang; Paul E. Wright; Xiao-Dong Hu 001 (Networks, 1997)

A Permutation Routing Algorithm for Double Loop Networks. - Frank K. Hwang; Tzai-Shunne Lin; Rong-Hong Jan (Parallel Process. Lett., 1997)

A Modification to a Decomposition Algorithm of Gordon and Srikanthan. - Frank K. Hwang (IEEE Trans. Computers, 1997)

Comparing File Copies with at Most Three Disagreeing Pages. - Frank K. Hwang; P. J. Wan (IEEE Trans. Computers, 1997)

Wide-Sense Nonblocking for Multirate 3-Stage Clos Networks. - B. Gao; Frank K. Hwang (Theor. Comput. Sci., 1997)

Detecting Corrupted Pages in M Replicated Large Files. - Frank K. Hwang; Wenan Zang (IEEE Trans. Parallel Distributed Syst., 1997)

The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch. - Frank K. Hwang; Wen-Dar Lin (COCOON, 1998)

Enumerating Consecutive and Nested Partitions for Graphs. - Frank K. Hwang; Gerard J. Chang (Eur. J. Comb., 1998)

Sortabilities of Partition Properties. - 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 (J. Comb. Optim., 1998)

Localizing Combinatorial Properties for Partitions on Block Graphs. - Gerard J. Chang; Frank K. Hwang; Yi-Ching Yao (J. Comb. Optim., 1998)

Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube. - Frank K. Hwang; Yi-Ching Yao (Theory Comput. Syst., 1998)

On Multirate Rearrangeable Clos Networks. - Ding-Zhu Du; Biao Gao; Frank K. Hwang; J. H. Kim (SIAM J. Comput., 1998)

Choosing the best logk(N, m, P) strictly nonblocking networks. - Frank K. Hwang (IEEE Trans. Commun., 1998)

The consecutive-4 digraphs are Hamiltonian. - Gerard J. Chang; Frank K. Hwang; Li-Da Tong (J. Graph Theory, 1999)

Partition polytopes over 1-dimensional points. - Biao Gao; Frank K. Hwang; Wen-Ching Winnie Li; Uriel G. Rothblum (Math. Program., 1999)

Characterizing bit permutation networks. - Gerard J. Chang; Frank K. Hwang; Li-Da Tong (Networks, 1999)

Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation. - Gaylord W. Richards; Frank K. Hwang (Networks, 1999)

Interconnecting Highways. - Ding-Zhu Du; Frank K. Hwang; Guoliang Xue (SIAM J. Discret. Math., 1999)

A Polynomial Time Algorithm for Shaped Partition Problems. - Frank K. Hwang; Shmuel Onn; Uriel G. Rothblum (SIAM J. Optim., 1999)

The 1.5-loop network and the mixed 1.5-loop network. - Frank K. Hwang; S. K. Chen (SIROCCO, 2000)

Sequential construction of a circular consecutive-2 system. - Frank K. Hwang; C. K. Pai (Inf. Process. Lett., 2000)

Supermodularity in Various Partition Problems. - Frank K. Hwang; M. M. Liao; Chiuyuan Chen (J. Glob. Optim., 2000)

Equivalent L-Shapes of Double-Loop Networks for the Degenerate Case. - Chiuyuan Chen; Frank K. Hwang (J. Interconnect. Networks, 2000)

Linear-shaped partition problems. - Frank K. Hwang; Shmuel Onn; Uriel G. Rothblum (Oper. Res. Lett., 2000)

The Minimum Distance Diagram of Double-Loop Networks. - Chiuyuan Chen; Frank K. Hwang (IEEE Trans. Computers, 2000)

On nonblocking multicast three-stage Clos networks. - Frank K. Hwang; Sheng-Chyang Liaw (IEEE/ACM Trans. Netw., 2000)

Optimal quantitative group testing on cycles and paths. - Frank K. Hwang; J. S. Lee (Discret. Appl. Math., 2001)

Optimal Consecutive-k-out-of-(2k+1): G Cycle. - Ding-Zhu Du; Frank K. Hwang; Yunjae Jung; Hung Q. Ngo 001 (J. Glob. Optim., 2001)

Monotone Routing in Multirate Rearrangeable Clos Networks. - Xiao-Dong Hu 001; Xiaohua Jia; Ding-Zhu Du; Frank K. Hwang (J. Parallel Distributed Comput., 2001)

Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks. - Frank K. Hwang; Chih-Hung Yen (Networks, 2001)

A new index of component importance. - Frank K. Hwang (Oper. Res. Lett., 2001)

When is Individual Testing Optimal for Nonadaptive Group Testing? - S. H. Huang; Frank K. Hwang (SIAM J. Discret. Math., 2001)

A complementary survey on double-loop networks. - Frank K. Hwang (Theor. Comput. Sci., 2001)

Channel graphs of bit permutation networks. - Li-Da Tong; Frank K. Hwang; Gerard J. Chang (Theor. Comput. Sci., 2001)

Lower bounds for wide-sense nonblocking Clos network. - Kuo-Hui Tsai; Da-Wei Wang 004; Frank K. Hwang (Theor. Comput. Sci., 2001)

Group testing and fault detection for replicated files. - Frank K. Hwang; Wenan Zang (Discret. Appl. Math., 2002)

Preface. - Frank K. Hwang; Xuding Zhu (Discret. Math., 2002)

The Structural Birnbaum Importance of Consecutive-k Systems. - Hsun-Wen Chang; Rong-Jaye Chen; Frank K. Hwang (J. Comb. Optim., 2002)

Sortability of Multi-partitions. - Frank K. Hwang; Y. M. Wang; J. S. Lee (J. Glob. Optim., 2002)

k-Diameters of the Hyper-L Shape Tile. - Frank K. Hwang; B. C. Lin (J. Interconnect. Networks, 2002)

Optimal Consecutive-k-out-of-n: G Cycle for n leq 2k+1. - Ding-Zhu Du; Frank K. Hwang; Xiaohua Jia; Hung Q. Ngo 001 (SIAM J. Discret. Math., 2002)

Some permutation routing algorithms for low-dimensional hypercubes. - Frank K. Hwang; Yi-Ching Yao; Bhaskar DasGupta (Theor. Comput. Sci., 2002)

A survey of nonblocking multicast three-stage Clos networks. - Frank K. Hwang (IEEE Commun. Mag., 2003)

Using transforming matrices to generate DNA clone grids. - Hua-Min Huang; Frank K. Hwang; Jian-Feng Ma (Discret. Appl. Math., 2003)

The existence of hyper-L triple-loop networks. - Chiuyuan Chen; Frank K. Hwang; J. S. Lee; S. J. Shih (Discret. Math., 2003)

On Macula's error-correcting pool designs. - Frank Kwang-Ming Hwang (Discret. Math., 2003)

Sortability of vector partitions. - Frank K. Hwang; J. S. Lee; Yu-Chi Liu; Uriel G. Rothblum (Discret. Math., 2003)

Error-Tolerant Pooling Designs with Inhibitors. - Frank K. Hwang; Yu-Chi Liu (J. Comput. Biol., 2003)

The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules. - Frank K. Hwang; Wen-Dar Lin (J. Comb. Optim., 2003)

Random Pooling Designs Under Various Structures. - Frank K. Hwang; Yu-Chi Liu (J. Comb. Optim., 2003)

An Efficient Algorithm for the Reliability of Consecutive-k-n Networks. - Jen-Chun Chang; Rong-Jaye Chen; Frank K. Hwang (J. Inf. Sci. Eng., 2003)

Some Combinatorial Properties of Mixed Chordal Rings. - S. K. Chen; Frank K. Hwang; Yu-Chi Liu (J. Interconnect. Networks, 2003)

A general construction for nonblocking crosstalk-free photonic switching networks. - Frank K. Hwang; Wen-Dar Lin (Networks, 2003)

Wide-sense nonblocking multicast Log2(N, m, p) networks. - Frank K. Hwang; Bey-Chi Lin (IEEE Trans. Commun., 2003)

Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability. - Frank K. Hwang; Sheng-Chyang Liaw; Li-Da Tong (IEEE Trans. Commun., 2003)

A survey on multi-loop networks. - Frank K. Hwang (Theor. Comput. Sci., 2003)

Permutation polytopes corresponding to strongly supermodular functions. - Frank K. Hwang; J. S. Lee; Uriel G. Rothblum (Discret. Appl. Math., 2004)

Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks. - W. R. Chen; Frank K. Hwang; Xuding Zhu (SIAM J. Discret. Math., 2004)

Partition-Optimization with Schur Convex Sum Objective Functions. - Frank Kwang-Ming Hwang; Uriel G. Rothblum (SIAM J. Discret. Math., 2004)

Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies. - F. H. Chang; J. Y. Guo; Frank K. Hwang; C. K. Lin (Theor. Comput. Sci., 2004)

A competitive algorithm to find all defective edges in a graph. - Frank K. Hwang (Discret. Appl. Math., 2005)

Identifying d positive clones in the presence of inhibitors. - Ding-Zhu Du; Frank K. Hwang (Int. J. Bioinform. Res. Appl., 2005)

An almost-linear time and linear space algorithm for the longest common subsequence problem. - J. Y. Guo; Frank K. Hwang (Inf. Process. Lett., 2005)

A Construction of Pooling Designs with Some Happy Surprises. - Arkadii G. D'yachkov; Frank K. Hwang; Anthony J. Macula; Pavel A. Vilenkin; Chih-Wen Weng (J. Comput. Biol., 2005)

On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. - Hung-Lin Fu; Frank K. Hwang (J. Comb. Optim., 2005)

Supermodularity in Mean-Partition Problems. - F. H. Chang; Frank K. Hwang (J. Glob. Optim., 2005)

Equivalence of buddy networks with arbitrary number of stages. - Chiuyuan Chen; Frank K. Hwang; James K. Lan (Networks, 2005)

Strict nonblockingness of reduced shuffle-exchange networks. - Frank K. Hwang; Binwu Zhang (Networks, 2005)

Strictly Nonblocking Multirate logd(N, m, p) Networks. - Frank Kwang-Ming Hwang; Yong He; Yang Wang (SIAM J. Comput., 2005)

A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks. - Frank K. Hwang (IEEE Trans. Commun., 2005)

Necessary and sufficient conditions for rearrangeable Logd(N, m, p). - Frank K. Hwang; Wen-Dar Lin (IEEE Trans. Commun., 2005)

A hierarchy of importance indices. - Frank K. Hwang (IEEE Trans. Reliab., 2005)

A novel use of t-packings to construct d-disjunct matrices. - Hung-Lin Fu; Frank K. Hwang (Discret. Appl. Math., 2006)

Tessellating polyominos in the plane. - Ming-You Chen; Frank K. Hwang; Chih-Hung Yen (Discret. Math., 2006)

New Construction for Transversal Design. - Ding-Zhu Du; Frank K. Hwang; Weili Wu 001; Taieb Znati (J. Comput. Biol., 2006)

One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions. - F. H. Chang; H. B. Chen; J. Y. Guo; Frank K. Hwang; Uriel G. Rothblum (J. Comb. Optim., 2006)

Construction of d(H)-disjunct matrix for group testing in hypergraphs. - Hong Gao 001; Frank K. Hwang; My T. Thai; Weili Wu 001; Taieb Znati (J. Comb. Optim., 2006)

The Mean-Partition Problem. - Fei-Hwang Chang; Frank K. Hwang; Uriel G. Rothblum (J. Glob. Optim., 2006)

A Polytope Approach to the Optimal Assembly Problem. - Frank K. Hwang; Uriel G. Rothblum (J. Glob. Optim., 2006)

On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out. - Hong-Bin Chen; Frank K. Hwang (SIAM J. Discret. Math., 2006)

Rearrangeability of bit permutation networks. - Xuewen Bao; Frank K. Hwang; Qiao Li (Theor. Comput. Sci., 2006)

Wide-sense nonblocking for multi-logdN networks under various routing strategies. - F. H. Chang; J. Y. Guo; Frank K. Hwang (Theor. Comput. Sci., 2006)

On noninterruptive rearrangeable networks. - Frank K. Hwang; Wen-Dar Lin; Vadim Lioubimov (IEEE/ACM Trans. Netw., 2006)

Counting disjoint 2-partitions for points in the plane. - F. H. Chang; J. Y. Guo; Frank K. Hwang; J. S. Lee (Discret. Appl. Math., 2007)

A competitive algorithm in searching for many edges in a hypergraph. - Ting Chen; Frank K. Hwang (Discret. Appl. Math., 2007)

Exploring the missing link among d-separable, d_-separable and d-disjunct matrices. - Hong-Bin Chen; Frank K. Hwang (Discret. Appl. Math., 2007)

An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. - H. B. Chen; Ding-Zhu Du; Frank K. Hwang (J. Comb. Optim., 2007)

The identification of positive clones in a general inhibitor model. - Frank K. Hwang; F. H. Chang (J. Comput. Syst. Sci., 2007)

Strictly Nonblocking f-Cast Logd(N, m, p) Networks. - Frank K. Hwang; Yang Wang; Jinzhi Tan (IEEE Trans. Commun., 2007)

Sphere-separable partitions of multi-parameter elements. - Boaz Golany; Frank K. Hwang; Uriel G. Rothblum (Discret. Appl. Math., 2008)

Equivalence of permutation polytopes corresponding to strictly supermodular functions. - Frank K. Hwang; J. S. Lee; Uriel G. Rothblum (Discret. Appl. Math., 2008)

A new construction of I-separable matrices via an improved decoding of Macula's construction. - Hung-Lin Fu; Frank K. Hwang (Discret. Optim., 2008)

A survey on nonadaptive group testing algorithms through the angle of decoding. - Hong-Bin Chen; Frank K. Hwang (J. Comb. Optim., 2008)

Improved construction for pooling design. - Ping Deng 001; Frank K. Hwang; Weili Wu 001; David MacCallum; Feng Wang 002; Taieb Znati (J. Comb. Optim., 2008)

An upper bound of the number of tests in pooling designs for the error-tolerant complex model. - Hong-Bin Chen; Hung-Lin Fu; Frank K. Hwang (Optim. Lett., 2008)

Optimal Reservation Scheme Routing for Two-Rate Wide-Sense Nonblocking Three-Stage Clos Networks. - Wenqing Dou; Frank K. Hwang (The Mathematics of Preference, Choice and Order, 2009)

The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. - F. H. Chang; Hung-Lin Fu; Frank K. Hwang; B. C. Lin (Discret. Appl. Math., 2009)

Generalizing and Fine Tuning Triple-Loop Networks. - Bey-Chi Lin; Frank K. Hwang (J. Interconnect. Networks, 2009)

Pooling designs for clone library screening in the inhibitor complex model. - Fei-Huang Chang; Huilan Chang; Frank K. Hwang (J. Comb. Optim., 2011)

On the number of separable partitions. - Frank K. Hwang; Uriel G. Rothblum (J. Comb. Optim., 2011)

A new approach to solve open-partition problems. - Huilan Chang; Frank K. Hwang; Uriel G. Rothblum (J. Comb. Optim., 2012)

Are there more almost separable partitions than separable partitions? - Fei-Huang Chang; Hong-Bin Chen; Frank K. Hwang (J. Comb. Optim., 2014)