default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank K. Hwang
Frank Kwang-Ming Hwang
Person information
- affiliation: National Chiao-Tung University, Hsinchu, Taiwan
- affiliation (1967-1996): Bell Labs, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2014
[j214]Fei-Huang Chang, Hong-Bin Chen, Frank K. Hwang:
Are there more almost separable partitions than separable partitions? J. Comb. Optim. 27(3): 567-573 (2014)- 2012
- [j213]Huilan Chang, Frank K. Hwang, Uriel G. Rothblum:
A new approach to solve open-partition problems. J. Comb. Optim. 23(1): 61-78 (2012) - 2011
- [j212]Frank K. Hwang, Uriel G. Rothblum:
On the number of separable partitions. J. Comb. Optim. 21(4): 423-433 (2011) - [j211]Fei-Huang Chang, Huilan Chang, Frank K. Hwang:
Pooling designs for clone library screening in the inhibitor complex model. J. Comb. Optim. 22(2): 145-152 (2011)
2000 – 2009
- 2009
- [j210]F. H. Chang, Hung-Lin Fu, Frank K. Hwang, B. C. Lin:
The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. Discret. Appl. Math. 157(1): 164-169 (2009) - [j209]Bey-Chi Lin, Frank K. Hwang:
Generalizing and Fine Tuning Triple-Loop Networks. J. Interconnect. Networks 10(1-2): 133-148 (2009) - [p1]Wenqing Dou, Frank K. Hwang:
Optimal Reservation Scheme Routing for Two-Rate Wide-Sense Nonblocking Three-Stage Clos Networks. The Mathematics of Preference, Choice and Order 2009: 355-360 - 2008
- [j208]Boaz Golany, Frank K. Hwang, Uriel G. Rothblum:
Sphere-separable partitions of multi-parameter elements. Discret. Appl. Math. 156(6): 838-845 (2008) - [j207]Frank K. Hwang, J. S. Lee, Uriel G. Rothblum:
Equivalence of permutation polytopes corresponding to strictly supermodular functions. Discret. Appl. Math. 156(12): 2336-2343 (2008) - [j206]Hung-Lin Fu, Frank K. Hwang:
A new construction of I-separable matrices via an improved decoding of Macula's construction. Discret. Optim. 5(4): 700-704 (2008) - [j205]Hong-Bin Chen, Frank K. Hwang:
A survey on nonadaptive group testing algorithms through the angle of decoding. J. Comb. Optim. 15(1): 49-59 (2008) - [j204]Ping Deng, Frank K. Hwang, Weili Wu, David MacCallum, Feng Wang
, Taieb Znati:
Improved construction for pooling design. J. Comb. Optim. 15(1): 123-126 (2008) - [j203]Hong-Bin Chen, Hung-Lin Fu, Frank K. Hwang:
An upper bound of the number of tests in pooling designs for the error-tolerant complex model. Optim. Lett. 2(3): 425-431 (2008) - 2007
- [j202]Ting Chen, Frank K. Hwang:
A competitive algorithm in searching for many edges in a hypergraph. Discret. Appl. Math. 155(4): 566-571 (2007) - [j201]Hong-Bin Chen, Frank K. Hwang:
Exploring the missing link among d-separable, d_-separable and d-disjunct matrices. Discret. Appl. Math. 155(5): 662-664 (2007) - [j200]F. H. Chang, J. Y. Guo, Frank K. Hwang, J. S. Lee:
Counting disjoint 2-partitions for points in the plane. Discret. Appl. Math. 155(16): 2087-2092 (2007) - [j199]H. B. Chen, Ding-Zhu Du, Frank K. Hwang:
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. J. Comb. Optim. 14(2-3): 121-129 (2007) - [j198]Frank K. Hwang, F. H. Chang:
The identification of positive clones in a general inhibitor model. J. Comput. Syst. Sci. 73(7): 1090-1094 (2007) - [j197]Frank K. Hwang, Yang Wang, Jinzhi Tan:
Strictly Nonblocking f-Cast Logd(N, m, p) Networks. IEEE Trans. Commun. 55(5): 981-986 (2007) - 2006
- [j196]Hung-Lin Fu, Frank K. Hwang:
A novel use of t-packings to construct d-disjunct matrices. Discret. Appl. Math. 154(12): 1759-1762 (2006) - [j195]Ming-You Chen, Frank K. Hwang, Chih-Hung Yen:
Tessellating polyominos in the plane. Discret. Math. 306(12): 1139-1144 (2006) - [j194]Ding-Zhu Du, Frank K. Hwang, Weili Wu, Taieb Znati:
New Construction for Transversal Design. J. Comput. Biol. 13(4): 990-995 (2006) - [j193]F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang, Uriel G. Rothblum:
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions. J. Comb. Optim. 11(3): 321-339 (2006) - [j192]Hong Gao, Frank K. Hwang, My T. Thai, Weili Wu, Taieb Znati:
Construction of d(H)-disjunct matrix for group testing in hypergraphs. J. Comb. Optim. 12(3): 297-301 (2006) - [j191]Frank K. Hwang, Uriel G. Rothblum:
A Polytope Approach to the Optimal Assembly Problem. J. Glob. Optim. 35(3): 387-403 (2006) - [j190]Fei-Hwang Chang, Frank K. Hwang, Uriel G. Rothblum:
The Mean-Partition Problem. J. Glob. Optim. 36(1): 21-31 (2006) - [j189]Hong-Bin Chen, Frank K. Hwang:
On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out. SIAM J. Discret. Math. 20(2): 287-290 (2006) - [j188]Xuewen Bao, Frank K. Hwang, Qiao Li:
Rearrangeability of bit permutation networks. Theor. Comput. Sci. 352(1-3): 197-214 (2006) - [j187]F. H. Chang, J. Y. Guo, Frank K. Hwang:
Wide-sense nonblocking for multi-logdN networks under various routing strategies. Theor. Comput. Sci. 352(1-3): 232-239 (2006) - [j186]Frank K. Hwang, Wen-Dar Lin, Vadim Lioubimov:
On noninterruptive rearrangeable networks. IEEE/ACM Trans. Netw. 14(5): 1141-1149 (2006) - 2005
- [j185]Frank K. Hwang:
A competitive algorithm to find all defective edges in a graph. Discret. Appl. Math. 148(3): 273-277 (2005) - [j184]Ding-Zhu Du, Frank K. Hwang:
Identifying d positive clones in the presence of inhibitors. Int. J. Bioinform. Res. Appl. 1(2): 162-168 (2005) - [j183]J. Y. Guo, Frank K. Hwang:
An almost-linear time and linear space algorithm for the longest common subsequence problem. Inf. Process. Lett. 94(3): 131-135 (2005) - [j182]Arkadii G. D'yachkov, Frank K. Hwang, Anthony J. Macula, Pavel A. Vilenkin, Chih-Wen Weng:
A Construction of Pooling Designs with Some Happy Surprises. J. Comput. Biol. 12(8): 1129-1136 (2005) - [j181]Hung-Lin Fu, Frank K. Hwang:
On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. J. Comb. Optim. 9(3): 263-266 (2005) - [j180]F. H. Chang, Frank K. Hwang:
Supermodularity in Mean-Partition Problems. J. Glob. Optim. 33(3): 337-347 (2005) - [j179]Frank K. Hwang, Binwu Zhang:
Strict nonblockingness of reduced shuffle-exchange networks. Networks 45(1): 4-8 (2005) - [j178]Chiuyuan Chen, Frank K. Hwang, James K. Lan:
Equivalence of buddy networks with arbitrary number of stages. Networks 46(4): 171-176 (2005) - [j177]Frank Kwang-Ming Hwang, Yong He, Yang Wang:
Strictly Nonblocking Multirate logd(N, m, p) Networks. SIAM J. Comput. 34(5): 1271-1278 (2005) - [j176]Frank K. Hwang:
A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks. IEEE Trans. Commun. 53(9): 1581-1586 (2005) - [j175]Frank K. Hwang, Wen-Dar Lin:
Necessary and sufficient conditions for rearrangeable Logd(N, m, p). IEEE Trans. Commun. 53(12): 2020-2023 (2005) - [j174]Frank K. Hwang:
A hierarchy of importance indices. IEEE Trans. Reliab. 54(1): 169-172 (2005) - 2004
- [j173]Frank K. Hwang, J. S. Lee, Uriel G. Rothblum:
Permutation polytopes corresponding to strongly supermodular functions. Discret. Appl. Math. 142(1-3): 87-97 (2004) - [j172]W. R. Chen, Frank K. Hwang, Xuding Zhu:
Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks. SIAM J. Discret. Math. 17(3): 446-452 (2004) - [j171]Frank Kwang-Ming Hwang, Uriel G. Rothblum:
Partition-Optimization with Schur Convex Sum Objective Functions. SIAM J. Discret. Math. 18(3): 512-524 (2004) - [j170]F. H. Chang, J. Y. Guo, Frank K. Hwang, C. K. Lin:
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies. Theor. Comput. Sci. 314(3): 375-386 (2004) - 2003
- [j169]Frank K. Hwang:
A survey of nonblocking multicast three-stage Clos networks. IEEE Commun. Mag. 41(10): 34-37 (2003) - [j168]Hua-Min Huang, Frank K. Hwang, Jian-Feng Ma:
Using transforming matrices to generate DNA clone grids. Discret. Appl. Math. 129(2-3): 421-431 (2003) - [j167]Frank K. Hwang, J. S. Lee, Yu-Chi Liu, Uriel G. Rothblum:
Sortability of vector partitions. Discret. Math. 263(1-3): 129-142 (2003) - [j166]Chiuyuan Chen, Frank K. Hwang, J. S. Lee, S. J. Shih:
The existence of hyper-L triple-loop networks. Discret. Math. 268(1-3): 287-291 (2003) - [j165]Frank Kwang-Ming Hwang:
On Macula's error-correcting pool designs. Discret. Math. 268(1-3): 311-314 (2003) - [j164]Frank K. Hwang, Yu-Chi Liu:
Error-Tolerant Pooling Designs with Inhibitors. J. Comput. Biol. 10(2): 231-236 (2003) - [j163]Frank K. Hwang, Wen-Dar Lin:
The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules. J. Comb. Optim. 7(4): 327-337 (2003) - [j162]Frank K. Hwang, Yu-Chi Liu:
Random Pooling Designs Under Various Structures. J. Comb. Optim. 7(4): 339-352 (2003) - [j161]Jen-Chun Chang, Rong-Jaye Chen, Frank K. Hwang:
An Efficient Algorithm for the Reliability of Consecutive-k-n Networks. J. Inf. Sci. Eng. 19(1): 159-166 (2003) - [j160]S. K. Chen, Frank K. Hwang, Yu-Chi Liu:
Some Combinatorial Properties of Mixed Chordal Rings. J. Interconnect. Networks 4(1): 3-16 (2003) - [j159]Frank K. Hwang, Wen-Dar Lin:
A general construction for nonblocking crosstalk-free photonic switching networks. Networks 42(1): 20-25 (2003) - [j158]Frank K. Hwang, Bey-Chi Lin:
Wide-sense nonblocking multicast Log2(N, m, p) networks. IEEE Trans. Commun. 51(10): 1730-1735 (2003) - [j157]Frank K. Hwang, Sheng-Chyang Liaw, Li-Da Tong:
Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability. IEEE Trans. Commun. 51(11): 1765-1767 (2003) - [j156]Frank K. Hwang:
A survey on multi-loop networks. Theor. Comput. Sci. 299(1-3): 107-121 (2003) - 2002
- [j155]Frank K. Hwang, Wenan Zang:
Group testing and fault detection for replicated files. Discret. Appl. Math. 116(3): 231-242 (2002) - [j154]Frank K. Hwang, Xuding Zhu:
Preface. Discret. Math. 253(1-3): 1- (2002) - [j153]Hsun-Wen Chang, Rong-Jaye Chen, Frank K. Hwang:
The Structural Birnbaum Importance of Consecutive-k Systems. J. Comb. Optim. 6(2): 183-197 (2002) - [j152]Frank K. Hwang, Y. M. Wang, J. S. Lee:
Sortability of Multi-partitions. J. Glob. Optim. 24(4): 463-472 (2002) - [j151]Frank K. Hwang, B. C. Lin:
k-Diameters of the Hyper-L Shape Tile. J. Interconnect. Networks 3(3-4): 245-252 (2002) - [j150]Ding-Zhu Du, Frank K. Hwang, Xiaohua Jia, Hung Q. Ngo:
Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1. SIAM J. Discret. Math. 15(3): 305-316 (2002) - [j149]Frank K. Hwang, Yi-Ching Yao, Bhaskar DasGupta:
Some permutation routing algorithms for low-dimensional hypercubes. Theor. Comput. Sci. 270(1-2): 111-124 (2002) - 2001
- [j148]Frank K. Hwang, J. S. Lee:
Optimal quantitative group testing on cycles and paths. Discret. Appl. Math. 113(2-3): 299-302 (2001) - [j147]Ding-Zhu Du, Frank K. Hwang, Yunjae Jung, Hung Q. Ngo:
Optimal Consecutive-k-out-of-(2k+1): G Cycle. J. Glob. Optim. 19(1): 51-60 (2001) - [j146]Xiao-Dong Hu, Xiaohua Jia, Ding-Zhu Du, Frank K. Hwang:
Monotone Routing in Multirate Rearrangeable Clos Networks. J. Parallel Distributed Comput. 61(9): 1382-1388 (2001) - [j145]Frank K. Hwang, Chih-Hung Yen:
Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks. Networks 38(1): 1-5 (2001) - [j144]Frank K. Hwang:
A new index of component importance. Oper. Res. Lett. 28(2): 75-79 (2001) - [j143]S. H. Huang, Frank K. Hwang:
When is Individual Testing Optimal for Nonadaptive Group Testing? SIAM J. Discret. Math. 14(4): 540-548 (2001) - [j142]Kuo-Hui Tsai, Da-Wei Wang, Frank K. Hwang:
Lower bounds for wide-sense nonblocking Clos network. Theor. Comput. Sci. 261(2): 323-328 (2001) - [j141]Li-Da Tong, Frank K. Hwang, Gerard J. Chang:
Channel graphs of bit permutation networks. Theor. Comput. Sci. 263(1-2): 139-143 (2001) - [j140]Frank K. Hwang:
A complementary survey on double-loop networks. Theor. Comput. Sci. 263(1-2): 211-229 (2001) - [c13]Frank K. Hwang, Wen-Dar Lin:
A General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks. ICPP Workshops 2001: 297-301 - 2000
- [j139]Frank K. Hwang, C. K. Pai:
Sequential construction of a circular consecutive-2 system. Inf. Process. Lett. 75(5): 231-235 (2000) - [j138]Frank K. Hwang, M. M. Liao, Chiuyuan Chen:
Supermodularity in Various Partition Problems. J. Glob. Optim. 18(3): 275-282 (2000) - [j137]Chiuyuan Chen, Frank K. Hwang:
Equivalent L-Shapes of Double-Loop Networks for the Degenerate Case. J. Interconnect. Networks 1(1): 47-60 (2000) - [j136]Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum:
Linear-shaped partition problems. Oper. Res. Lett. 26(4): 159-163 (2000) - [j135]Chiuyuan Chen, Frank K. Hwang:
The Minimum Distance Diagram of Double-Loop Networks. IEEE Trans. Computers 49(9): 977-979 (2000) - [j134]Frank K. Hwang, Sheng-Chyang Liaw:
On nonblocking multicast three-stage Clos networks. IEEE/ACM Trans. Netw. 8(4): 535-539 (2000) - [c12]Frank K. Hwang, S. K. Chen:
The 1.5-loop network and the mixed 1.5-loop network. SIROCCO 2000: 297-306
1990 – 1999
- 1999
- [j133]Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
The consecutive-4 digraphs are Hamiltonian. J. Graph Theory 31(1): 1-6 (1999) - [j132]Biao Gao, Frank K. Hwang, Wen-Ching Winnie Li, Uriel G. Rothblum:
Partition polytopes over 1-dimensional points. Math. Program. 85(2): 335-362 (1999) - [j131]Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
Characterizing bit permutation networks. Networks 33(4): 261-267 (1999) - [j130]Gaylord W. Richards, Frank K. Hwang:
Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation. Networks 33(4): 269-291 (1999) - [j129]Ding-Zhu Du, Frank K. Hwang, Guoliang Xue:
Interconnecting Highways. SIAM J. Discret. Math. 12(2): 252-261 (1999) - [j128]Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum:
A Polynomial Time Algorithm for Shaped Partition Problems. SIAM J. Optim. 10(1): 70-81 (1999) - 1998
- [j127]Frank K. Hwang, Gerard J. Chang:
Enumerating Consecutive and Nested Partitions for Graphs. Eur. J. Comb. 19(1): 63-70 (1998) - [j126]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:
Sortabilities of Partition Properties. J. Comb. Optim. 2(4): 413-427 (1998) - [j125]Gerard J. Chang, Frank K. Hwang, Yi-Ching Yao:
Localizing Combinatorial Properties for Partitions on Block Graphs. J. Comb. Optim. 2(4): 429-441 (1998) - [j124]Frank K. Hwang, Yi-Ching Yao:
Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube. Theory Comput. Syst. 31(1): 63-66 (1998) - [j123]Ding-Zhu Du, Biao Gao, Frank K. Hwang, J. H. Kim:
On Multirate Rearrangeable Clos Networks. SIAM J. Comput. 28(2): 463-470 (1998) - [j122]Frank K. Hwang:
Choosing the best logk(N, m, P) strictly nonblocking networks. IEEE Trans. Commun. 46(4): 454-455 (1998) - [c11]Frank K. Hwang, Wen-Dar Lin:
The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch. COCOON 1998: 204-212 - [e1]Ding-Zhu Du, Frank K. Hwang:
Advances in Switching Networks, Proceedings of a DIMACS Workshop,Princeton, New Jersey, USA, July 7-9, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 42, DIMACS/AMS 1998, ISBN 978-0-8218-0831-3 [contents] - 1997
- [j121]Frank K. Hwang, Yi-Ching Yao, Miltos D. Grammatikakis:
A d-move Local Permutation Routing for the d-cube. Discret. Appl. Math. 72(3): 199-207 (1997) - [j120]Peter C. Fishburn, Frank K. Hwang, Ding-Zhu Du, Biao Gao:
On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks. Discret. Appl. Math. 78(1-3): 75-87 (1997) - [j119]Gerard J. Chang, Frank K. Hwang:
Optimality of consecutive and nested tree partitions. Networks 30(2): 75-80 (1997) - [j118]Frank K. Hwang, Paul E. Wright, Xiao-Dong Hu:
Exact reliabilities of most reliable double-loop networks. Networks 30(2): 81-90 (1997) - [j117]Frank K. Hwang, Tzai-Shunne Lin, Rong-Hong Jan:
A Permutation Routing Algorithm for Double Loop Networks. Parallel Process. Lett. 7(3): 259-265 (1997) - [j116]Frank K. Hwang, P. J. Wan:
Comparing File Copies with at Most Three Disagreeing Pages. IEEE Trans. Computers 46(6): 716-718 (1997) - [j115]Frank K. Hwang:
A Modification to a Decomposition Algorithm of Gordon and Srikanthan. IEEE Trans. Computers 46(8): 958-960 (1997) - [j114]B. Gao, Frank K. Hwang:
Wide-Sense Nonblocking for Multirate 3-Stage Clos Networks. Theor. Comput. Sci. 182(1-2): 171-182 (1997) - [j113]Frank K. Hwang, Wenan Zang:
Detecting Corrupted Pages in M Replicated Large Files. IEEE Trans. Parallel Distributed Syst. 8(12): 1241-1245 (1997) - [c10]Gaylord W. Richards, Frank K. Hwang:
Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation. Advances in Switching Networks 1997: 15-48 - [c9]Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
Characterizing bit permutation networks. Advances in Switching Networks 1997: 157-167 - 1996
- [j112]Frank K. Hwang, Uriel G. Rothblum, Yi-Ching Yao:
Localizing combinatorial properties of partitions. Discret. Math. 160(1-3): 1-23 (1996) - [j111]Frank K. Hwang:
Extremal Permutations with Respect to Weak Majorizations. Eur. J. Comb. 17(7): 637-645 (1996) - [j110]Frank K. Hwang, Uriel G. Rothblum:
Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions. Math. Oper. Res. 21(3): 540-554 (1996) - [j109]Frank K. Hwang, Paul E. Wright:
Efficient algorithms for the reliabilities of replicated n-parallel-task graphs. Oper. Res. Lett. 19(4): 171-174 (1996) - [j108]Endre Boros, Frank K. Hwang:
Optimality of Nested Partitions and Its Application to Cluster Analysis. SIAM J. Optim. 6(4): 1153-1162 (1996) - [j107]Hyun Yeop Lee, Frank K. Hwang, John D. Carpinelli:
A new decomposition algorithm for rearrangeable Clos interconnection networks. IEEE Trans. Commun. 44(11): 1572-1578 (1996) - [j106]Frank K. Hwang:
Comment/reply: some recent papers on consecutively-connected systems. IEEE Trans. Reliab. 45(1) (1996) - 1995
- [j105]Frank K. Hwang:
The Time Complexity of Deterministic Broadcast Radio Networks. Discret. Appl. Math. 60(1-3): 219-222 (1995) - [j104]Frank K. Hwang, Colin L. Mallows:
Enumerating Nested and Consecutive Partitions. J. Comb. Theory A 70(2): 323-333 (1995) - [j103]Frank K. Hwang:
An isomorphic factorization of the complete graph. J. Graph Theory 19(3): 333-337 (1995) - [j102]Frank K. Hwang, Uriel G. Rothblum:
Assembly at system level versus component level. Oper. Res. Lett. 17(4): 153-157 (1995) - [j101]Frank K. Hwang, Paul E. Wright:
Survival Reliability of Some Double-Loop Networks and Chordal Rings. IEEE Trans. Computers 44(12): 1468-1471 (1995) - 1994
- [j100]Xiao-Dong Hu, Frank K. Hwang:
Cutting Numbers for the Forward Loop Backward Hop Network. Discret. Appl. Math. 48(2): 147-161 (1994) - [j99]Frank K. Hwang, Uriel G. Rothblum:
Constrained partitioning problems. Discret. Appl. Math. 50(1): 93-96 (1994) - [j98]Amotz Bar-Noy, Frank K. Hwang, Ilan Kessler, Shay Kutten:
A New Competitive Algorithm for Group Testing. Discret. Appl. Math. 52(1): 29-38 (1994) - [j97]Frank K. Hwang, Uriel G. Rothblum:
Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules. Oper. Res. 42(4): 709-720 (1994) - [j96]Xiao-Dong Hu, P. D. Chen, Frank K. Hwang:
A New Competitive Algorithm for the Counterfeit Coin Problem. Inf. Process. Lett. 51(4): 213-218 (1994) - [j95]Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang:
Minimal-distance routing for KYKLOS II. Networks 24(2): 103-108 (1994) - [j94]Frank K. Hwang:
Comments on "Network Resilience: A Measure of Network Fault Tolerance". IEEE Trans. Computers 43(12): 1451-1452 (1994) - 1993
- [j93]Ding-Zhu Du, Frank K. Hwang:
Competitive Group Testing. Discret. Appl. Math. 45(3): 221-232 (1993) - [j92]Frank K. Hwang, Stavros G. Papastavridis:
Erratum: Binary Vectors with Exactly k Nonoverlapping m-Tuples of Consecutive ones. Discret. Appl. Math. 46(3): 283 (1993) - [j91]Frank K. Hwang, Uriel G. Rothblum:
Majorization and Schur Convexity with Respect to Partial Orders. Math. Oper. Res. 18(4): 928-944 (1993) - [j90]Frank K. Hwang, Gaylord W. Richards:
A two-stage network with dual partial concentrators. Networks 23(1): 53-58 (1993) - [j89]Xiao-Dong Hu, Frank K. Hwang, Wen-Ch'ing Winnie Li:
Most reliable double loop networks in survival reliability. Networks 23(5): 451-458 (1993) - [j88]J. F. Weng, Frank K. Hwang:
An optimal group testing algorithm on k disjoint sets. Oper. Res. Lett. 13(1): 43-44 (1993) - [j87]Frank K. Hwang, Uriel G. Rothblum, Larry A. Shepp:
Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders. SIAM J. Discret. Math. 6(4): 533-547 (1993) - [c8]Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang:
Adaptive and Oblivious Algorithms for D-Cube Permutation Routing. ISAAC 1993: 167-175 - [c7]Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang:
Universality of D-Cube (D<8). PARCO 1993: 517-520 - 1992
- [j86]Frank K. Hwang:
Foreword. Algorithmica 7(2&3): 119-120 (1992) - [j85]Ding-Zhu Du, Frank K. Hwang:
A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio. Algorithmica 7(2&3): 121-135 (1992) - [j84]Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor:
The Rectilinear Steiner Arborescence Problem. Algorithmica 7(2&3): 277-288 (1992) - [j83]Xiao-Dong Hu, Frank K. Hwang:
An Improved Upper Bound for the Subarray Partial Concentrators. Discret. Appl. Math. 37/38: 341-346 (1992) - [j82]Frank K. Hwang, Gaylord W. Richards:
The Capacity of the Subarray Partial Concentrators. Discret. Appl. Math. 39(3): 231-240 (1992) - [j81]Y. Cheng, Frank K. Hwang, Ian F. Akyildiz, D. Frank Hsu:
Routing Algorithms for Double Loop Networks. Int. J. Found. Comput. Sci. 3(3): 323-331 (1992) - [j80]Frank K. Hwang, J. F. Weng:
The Shortest Network under a Given Topology. J. Algorithms 13(3): 468-488 (1992) - [j79]Frank K. Hwang, Dana S. Richards:
Steiner tree problems. Networks 22(1): 55-89 (1992) - [j78]Xiao-Dong Hu, Frank Kwang-Ming Hwang:
Reliabilities of chordal rings. Networks 22(5): 487-501 (1992) - [j77]Frank K. Hwang, Uriel G. Rothblum:
Generalization of an engineering principle. Oper. Res. Lett. 12(4): 197-199 (1992) - [j76]Ding-Zhu Du, Frank K. Hwang:
Reducing the Steiner Problem in a Normed Space. SIAM J. Comput. 21(6): 1001-1007 (1992) - [c6]Amotz Bar-Noy, Ilan Kessler, Shay Kutten, Frank K. Hwang:
A New Competitive Algorithm for Group Testing. INFOCOM 1992: 786-793 - 1991
- [j75]Frank K. Hwang:
A primer of the Euclidean Steiner problem. Ann. Oper. Res. 33(1): 73-84 (1991) - [j74]Frank K. Hwang, S. Papastavridis:
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones. Discret. Appl. Math. 30(1): 83-86 (1991) - [j73]Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang, X. M. Zhang:
The Hamiltonian property of generalized de Bruijn digraphs. J. Comb. Theory B 52(1): 1-8 (1991) - [j72]Frank K. Hwang, Yi-Ching Yao:
A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization. Oper. Res. Lett. 10(4): 241-243 (1991) - [j71]Frank K. Hwang, Gaylord W. Richards:
Using combinatorial designs to construct partial concentrators. IEEE Trans. Commun. 39(7): 1141-1146 (1991) - [c5]Ding-Zhu Du, Frank Kwang-Ming Hwang:
Competitive Group Testing. On-Line Algorithms 1991: 125-134 - 1990
- [j70]Frank K. Hwang, Yi-Ching Yao:
Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees. Algorithmica 5(4): 591-598 (1990) - [j69]Ding-Zhu Du, Frank K. Hwang:
Optimal Assembly of an s-Stage k-OUT-OF-n System. SIAM J. Discret. Math. 3(3): 349-354 (1990) - [j68]Yi-Ching Yao, Frank K. Hwang:
On the cutoff point for pairwise enabling for infinite users in a multiaccess system. IEEE Trans. Inf. Theory 36(5): 1183-1186 (1990) - [c4]Ding-Zhu Du, Frank K. Hwang:
An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio. FOCS 1990: 76-85
1980 – 1989
- 1989
- [j67]Frank K. Hwang:
Optimal Assignment of Components to a Two-Stage k-Out-of-n System. Math. Oper. Res. 14(2): 376-382 (1989) - [j66]Frank K. Hwang:
Y. C. Yao: Cutoff Point and Monotonicity Properties for Multinomial Group Testing. SIAM J. Discret. Math. 2(4): 500-507 (1989) - [j65]Frank K. Hwang, Yi-Ching Yao:
A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels. IEEE Trans. Inf. Theory 35(3): 698-700 (1989) - [c3]Frank Kwang-Ming Hwang:
A Survey on Double Loop Networks. Reliability Of Computer And Communication Networks 1989: 143-152 - 1988
- [j64]Frank K. Hwang, G. D. Song, G. Y. Ting, Ding-Zhu Du:
A Decomposition Theorem on Euclidean Steiner Minimal Trees. Discret. Comput. Geom. 3: 367-382 (1988) - [j63]Jia En Yu, Frank K. Hwang:
The Existence of Symmetric Skew Balanced Starters for Odd Prime Powers. Eur. J. Comb. 9(2): 153-160 (1988) - [j62]Robert Chen, Frank K. Hwang:
Stronger players win more balanced knockout tournaments. Graphs Comb. 4(1): 95-99 (1988) - [j61]Ying Cheng, Frank K. Hwang:
Diameters of Weighted Double Loop Networks. J. Algorithms 9(3): 401-410 (1988) - [j60]Ding-Zhu Du, Frank K. Hwang:
Generalized de Bruijn digraphs. Networks 18(1): 27-38 (1988) - [j59]Xian M. Chang, Frank K. Hwang, J. F. Weng:
Optimal Detection of Two Defectives with a Parity Check Device. SIAM J. Discret. Math. 1(1): 38-44 (1988) - [j58]Yi-Ching Yao, Frank K. Hwang:
A Fundamental Monotonicity in Group Testing. SIAM J. Discret. Math. 1(2): 256-259 (1988) - [j57]Michael R. Garey, Frank K. Hwang, Gaylord W. Richards:
Asymptotic results for partial concentrators. IEEE Trans. Commun. 36(2): 214-217 (1988) - 1987
- [j56]Ding-Zhu Du, Frank K. Hwang, J. F. Weng:
Steiner Minimal Trees for Regular Polygons. Discret. Comput. Geom. 2: 65-84 (1987) - [j55]Ding-Zhu Du, Frank K. Hwang, G. D. Song, G. Y. Ting:
Steiner Minimal Trees on Sets of Four Points. Discret. Comput. Geom. 2: 401-414 (1987) - [j54]Frank K. Hwang, Y. H. Xu:
Double loop networks with minimum delay. Discret. Math. 66(1-2): 109-118 (1987) - [j53]Frank K. Hwang:
Comments on "Reliable Loop Topologies for Large Local Computer Networks". IEEE Trans. Computers 36(3): 383-384 (1987) - [j52]Frank K. Hwang, Xian M. Chang:
Cutoff points for roll call protocols in multiple access systems. IEEE Trans. Inf. Theory 33(4): 577-581 (1987) - [j51]Frank K. Hwang, Lawrence A. Shepp:
Some inequalities concerning random subsets of a set. IEEE Trans. Inf. Theory 33(4): 596-598 (1987) - [c2]Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang:
Minimal-Distance Routing for Kykios II. ICPP 1987: 546-549 - 1986
- [j50]Peter C. Fishburn, Frank K. Hwang, Hikyu Lee:
Do local majorities force a global majority? Discret. Math. 61(2-3): 165-179 (1986) - [j49]Frank K. Hwang, J. F. Weng:
Hexagonal coordinate systems and steiner minimal trees. Discret. Math. 62(1): 49-57 (1986) - [j48]D. Z. Du, Frank K. Hwang:
Optimal Consecutive-2-Out-of-n Systems. Math. Oper. Res. 11(1): 187-191 (1986) - [j47]Ding-Zhu Du, Frank K. Hwang:
On a conjecture of trietsch and handler on the flow-dependent steiner ratio. Networks 16(1): 47-50 (1986) - [j46]Frank K. Hwang, Andrzej Jajszczyk:
On Nonblocking Multiconnection Networks. IEEE Trans. Commun. 34(10): 1038-1041 (1986) - 1985
- [j45]Gerard J. Chang, Frank K. Hwang:
Diagonal and Pandiagonal Tournament Latin Squares. Eur. J. Comb. 6(2): 149-155 (1985) - [j44]Ding-Zhu Du, Frank K. Hwang, E. Y. Yao:
The Steiner Ratio Conjecture Is True for Five Points. J. Comb. Theory A 38(2): 230-240 (1985) - [j43]Ding-Zhu Du, Frank K. Hwang:
Optimal consecutive-2 systems of lines and cycles. Networks 15(4): 439-447 (1985) - [j42]Frank K. Hwang, Lawrence A. Shepp:
Component-level redundancy is better than system-level redundancy for channel graphs. Networks 15(4): 449-453 (1985) - [j41]Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang:
Doubly Linked Ring Networks. IEEE Trans. Computers 34(9): 853-855 (1985) - 1984
- [j40]Frank K. Hwang, Qin De Kang, Jia En Yu:
Complete Balanced Howell Rotations for 16k + 12 Partnerships. J. Comb. Theory A 36(1): 66-72 (1984) - [j39]Ding-Zhu Du, Frank K. Hwang:
A Multiplication Theorem for Balanced Howell Rotations. J. Comb. Theory A 37(2): 121-126 (1984) - [j38]Frank K. Hwang:
Selecting k Objects from a Cycle with p Pairs of Separation s. J. Comb. Theory A 37(2): 197-199 (1984) - [j37]Frank K. Hwang, János Körner, Victor K.-W. Wei:
Selecting Non-consecutive Balls Arranged in Many Lines. J. Comb. Theory A 37(3): 327-336 (1984) - 1983
- [j36]Frank K. Hwang, Jia Feng Weng, Ding-Zhu Du:
A class of full Steiner minimal trees. Discret. Math. 45(1): 107-112 (1983) - [j35]Frank K. Hwang, Victor K.-W. Wei:
A partition identity. Discret. Math. 46(3): 323-326 (1983) - [j34]D. Borkovitz, Frank K. Hwang:
Multiplicative magic squares. Discret. Math. 47: 1-11 (1983) - [j33]Frank K. Hwang, Ko-Wei Lih:
Latin Squares and Superqueens. J. Comb. Theory A 34(1): 110-114 (1983) - [j32]Frank K. Hwang:
Control Algorithms for Rearrangeable Clos Networks. IEEE Trans. Commun. 31(8): 952-954 (1983) - 1982
- [j31]Gerard J. Chang, Frank K. Hwang, Shen Lin:
Group testing with two defectives. Discret. Appl. Math. 4(2): 97-102 (1982) - [j30]Frank K. Hwang:
Complete balanced Howell rotations for 8k+5 teams. Discret. Math. 39(2): 145-151 (1982) - [j29]Ding-Zhu Du, E. Y. Yao, Frank K. Hwang:
A Short Proof of a Result of Pollak on Steiner Minimal Trees. J. Comb. Theory A 32(3): 396-400 (1982) - [j28]Frank K. Hwang:
Computing the Blocking Probabilities for Spiderweb Channel Graphs. IEEE Trans. Commun. 30(8): 1916-1918 (1982) - 1980
- [j27]Frank K. Hwang:
An explicit expression for the cost of a class of Huffman trees. Discret. Math. 32(2): 163-165 (1980) - [j26]Frank K. Hwang:
Maximum Wealth Trees. Math. Oper. Res. 5(4): 487-493 (1980) - [j25]Frank K. Hwang:
Optimal Merging of 3 Elements with n Elements. SIAM J. Comput. 9(2): 298-320 (1980) - [j24]Gerard J. Chang, Frank K. Hwang:
A Group Testing Problem. SIAM J. Algebraic Discret. Methods 1(1): 21-24 (1980) - [j23]F. R. K. Chung, Frank K. Hwang:
The Connection Patterns of Two Complete Binary Trees. SIAM J. Algebraic Discret. Methods 1(3): 322-335 (1980) - [j22]Frank K. Hwang:
Blocking Probabilities for a Class of Spiderweb Channel Graphs. IEEE Trans. Commun. 28(1): 115-117 (1980)
1970 – 1979
- 1979
- [j21]Frank K. Hwang:
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees. J. ACM 26(2): 177-182 (1979) - [j20]Frank K. Hwang:
Crisscross Latin Squares. J. Comb. Theory A 27(3): 371-375 (1979) - [j19]F. R. K. Chung, Frank K. Hwang:
The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter. Networks 9(1): 19-36 (1979) - [j18]Frank K. Hwang, Shen Lin:
On the construction of balanced switching networks. Networks 9(4): 283-307 (1979) - 1978
- [j17]Frank K. Hwang, Shen Lin:
Distribution of Integers into k-tuples with Prescribed Conditions. J. Comb. Theory A 25(2): 105-116 (1978) - [j16]Frank K. Hwang:
Link designs and probability analyses for a class of connecting networks. Networks 8(4): 287-296 (1978) - [j15]Frank K. Hwang:
Some Optimal Partition Problems with Applications to Switching Networks. IEEE Trans. Commun. 26(11): 1761-1764 (1978) - 1977
- [j14]Frank K. Hwang, J. C. Lagarias:
Minimum range sequences of all k-subsets of a set. Discret. Math. 19(3): 257-264 (1977) - [j13]Frank K. Hwang, Shen Lin:
Neighbor Designs. J. Comb. Theory A 23(3): 302-313 (1977) - [j12]Alfred V. Aho, Michael R. Garey, Frank K. Hwang:
Rectilinear steiner trees: Efficient special-case algorithms. Networks 7(1): 37-58 (1977) - [j11]F. R. K. Chung, Frank K. Hwang:
A problem on blocking probabilities in connecting networks. Networks 7(2): 185-192 (1977) - [j10]M. R. Garey, Frank K. Hwang, David S. Johnson:
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units. IEEE Trans. Computers 26(4): 321-328 (1977) - 1976
- [j9]Frank K. Hwang:
On the rearrangeability of some multistage connecting networks. Bell Syst. Tech. J. 55(9): 1411-1422 (1976) - [j8]Frank K. Hwang:
New Constructions for Balanced Howell Rotations. J. Comb. Theory A 21(1): 44-51 (1976) - [j7]Frank K. Hwang:
New Classes of Complete Balanced Howell Rotations. J. Comb. Theory A 21(1): 86-92 (1976) - 1974
- [j6]Frank K. Hwang, Shen Lin:
A Direct Method to Construct Triple Systems. J. Comb. Theory A 17(1): 84-94 (1974) - 1973
- [j5]Frank K. Hwang, David N. Deutsch:
A Class of Merging Algorithms. J. ACM 20(1): 148-159 (1973) - [c1]Frank K. Hwang, Shen Lin:
Hypergeometric group testing algorithms. AFIPS National Computer Conference 1973: 452 - 1972
- [j4]Elwyn R. Berlekamp, Frank K. Hwang:
Constructions for Balanced Howell Rotations for Bridge Tournaments. J. Comb. Theory A 12(2): 159-166 (1972) - [j3]Frank K. Hwang:
Rearrangeability of multi-connection three-stage clos networks. Networks 2(4): 301-306 (1972) - [j2]Frank K. Hwang, Shen Lin:
A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets. SIAM J. Comput. 1(1): 31-39 (1972) - 1971
- [j1]Frank K. Hwang, Shen Lin:
Optimal Merging of 2 Elements with n Elements. Acta Informatica 1: 145-158 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
