![]() | ![]() |
Frank Kwang-Ming Hwang
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
150 | EE | 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. Discrete Applied Mathematics 157(1): 164-169 (2009) |
2008 | ||
149 | EE | Frank K. Hwang, J. S. Lee, Uriel G. Rothblum: Equivalence of permutation polytopes corresponding to strictly supermodular functions. Discrete Applied Mathematics 156(12): 2336-2343 (2008) |
148 | EE | Boaz Golany, Frank K. Hwang, Uriel G. Rothblum: Sphere-separable partitions of multi-parameter elements. Discrete Applied Mathematics 156(6): 838-845 (2008) |
147 | EE | Hung-Lin Fu, Frank K. Hwang: A new construction of I-separable matrices via an improved decoding of Macula's construction. Discrete Optimization 5(4): 700-704 (2008) |
146 | EE | 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) |
145 | EE | 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) |
144 | EE | 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. Optimization Letters 2(3): 425-431 (2008) |
2007 | ||
143 | EE | F. H. Chang, J. Y. Guo, Frank K. Hwang, J. S. Lee: Counting disjoint 2-partitions for points in the plane. Discrete Applied Mathematics 155(16): 2087-2092 (2007) |
142 | EE | Ting Chen, Frank K. Hwang: A competitive algorithm in searching for many edges in a hypergraph. Discrete Applied Mathematics 155(4): 566-571 (2007) |
141 | EE | Hong-Bin Chen, Frank K. Hwang: Exploring the missing link among d-separable, d_-separable and d-disjunct matrices. Discrete Applied Mathematics 155(5): 662-664 (2007) |
140 | EE | 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) |
139 | EE | 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) |
2006 | ||
138 | EE | Hung-Lin Fu, Frank K. Hwang: A novel use of t-packings to construct d-disjunct matrices. Discrete Applied Mathematics 154(12): 1759-1762 (2006) |
137 | EE | Ming-You Chen, Frank K. Hwang, Chih-Hung Yen: Tessellating polyominos in the plane. Discrete Mathematics 306(12): 1139-1144 (2006) |
136 | EE | Frank K. Hwang, Wen-Dar Lin, Vadim Lioubimov: On noninterruptive rearrangeable networks. IEEE/ACM Trans. Netw. 14(5): 1141-1149 (2006) |
135 | EE | 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) |
134 | EE | 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) |
133 | EE | Ding-Zhu Du, Frank K. Hwang, Weili Wu, Taieb Znati: New Construction for Transversal Design. Journal of Computational Biology 13(4): 990-995 (2006) |
132 | EE | Hong-Bin Chen, Frank K. Hwang: On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out. SIAM J. Discrete Math. 20(2): 287-290 (2006) |
131 | EE | Xuewen Bao, Frank K. Hwang, Qiao Li: Rearrangeability of bit permutation networks. Theor. Comput. Sci. 352(1-3): 197-214 (2006) |
130 | EE | 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) |
2005 | ||
129 | EE | Frank K. Hwang: A competitive algorithm to find all defective edges in a graph. Discrete Applied Mathematics 148(3): 273-277 (2005) |
128 | EE | Frank K. Hwang, Wen-Dar Lin: Necessary and sufficient conditions for rearrangeable Log/sub d/(N, m, p). IEEE Transactions on Communications 53(12): 2020-2023 (2005) |
127 | EE | Frank K. Hwang: A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks. IEEE Transactions on Communications 53(9): 1581-1586 (2005) |
126 | EE | Ding-Zhu Du, Frank K. Hwang: Identifying d positive clones in the presence of inhibitors. IJBRA 1(2): 162-168 (2005) |
125 | EE | 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) |
124 | EE | 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) |
123 | EE | 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. Journal of Computational Biology 12(8): 1129-1136 (2005) |
122 | EE | Frank K. Hwang, Binwu Zhang: Strict nonblockingness of reduced shuffle-exchange networks. Networks 45(1): 4-8 (2005) |
121 | EE | Chiuyuan Chen, Frank K. Hwang, James K. Lan: Equivalence of buddy networks with arbitrary number of stages. Networks 46(4): 171-176 (2005) |
120 | EE | Frank Kwang-Ming Hwang, Yong He, Yang Wang: Strictly Nonblocking Multirate logd(N, m, p) Networks. SIAM J. Comput. 34(5): 1271-1278 (2005) |
2004 | ||
119 | EE | Frank K. Hwang, J. S. Lee, Uriel G. Rothblum: Permutation polytopes corresponding to strongly supermodular functions. Discrete Applied Mathematics 142(1-3): 87-97 (2004) |
118 | EE | 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. Discrete Math. 17(3): 446-452 (2004) |
117 | EE | Frank Kwang-Ming Hwang, Uriel G. Rothblum: Partition-Optimization with Schur Convex Sum Objective Functions. SIAM J. Discrete Math. 18(3): 512-524 (2004) |
116 | EE | 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 | ||
115 | EE | Hua-Min Huang, Frank K. Hwang, Jian-Feng Ma: Using transforming matrices to generate DNA clone grids. Discrete Applied Mathematics 129(2-3): 421-431 (2003) |
114 | EE | Frank K. Hwang, J. S. Lee, Y. C. Liu, Uriel G. Rothblum: Sortability of vector partitions. Discrete Mathematics 263(1-3): 129-142 (2003) |
113 | EE | Chiuyuan Chen, Frank K. Hwang, J. S. Lee, S. J. Shih: The existence of hyper-L triple-loop networks. Discrete Mathematics 268(1-3): 287-291 (2003) |
112 | EE | Frank Kwang-Ming Hwang: On Macula's error-correcting pool designs. Discrete Mathematics 268(1-3): 311-314 (2003) |
111 | EE | 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) |
110 | EE | Frank K. Hwang, Y. C. Liu: Random Pooling Designs Under Various Structures. J. Comb. Optim. 7(4): 339-352 (2003) |
109 | EE | 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) |
108 | Frank K. Hwang, Y. C. Liu: Error-Tolerant Pooling Designs with Inhibitors. Journal of Computational Biology 10(2): 231-236 (2003) | |
107 | EE | S. K. Chen, Frank K. Hwang, Y. C. Liu: Some Combinatorial Properties of Mixed Chordal Rings. Journal of Interconnection Networks 4(1): 3-16 (2003) |
106 | EE | Frank K. Hwang, Wen-Dar Lin: A general construction for nonblocking crosstalk-free photonic switching networks. Networks 42(1): 20-25 (2003) |
105 | EE | Frank K. Hwang: A survey on multi-loop networks. Theor. Comput. Sci. 1-3(299): 107-121 (2003) |
2002 | ||
104 | Frank K. Hwang, Wenan Zang: Group testing and fault detection for replicated files. Discrete Applied Mathematics 116(3): 231-242 (2002) | |
103 | EE | Frank K. Hwang, Xuding Zhu: Preface. Discrete Mathematics 253(1-3): 1- (2002) |
102 | 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) | |
101 | EE | Frank K. Hwang, B. C. Lin: k-Diameters of the Hyper-L Shape Tile. Journal of Interconnection Networks 3(3-4): 245-252 (2002) |
100 | EE | 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. Discrete Math. 15(3): 305-316 (2002) |
99 | EE | Frank K. Hwang, Y. C. Yao, B. DasGupta: Some permutation routing algorithms for low-dimensional hypercubes. Theor. Comput. Sci. 270(1-2): 111-124 (2002) |
2001 | ||
98 | EE | Frank K. Hwang, Wen-Dar Lin: A General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks. ICPP Workshops 2001: 297-301 |
97 | Frank K. Hwang, J. S. Lee: Optimal quantitative group testing on cycles and paths. Discrete Applied Mathematics 113(2-3): 299-302 (2001) | |
96 | EE | Xiao-Dong Hu, Xiaohua Jia, Ding-Zhu Du, Frank K. Hwang: Monotone Routing in Multirate Rearrangeable Clos Networks. J. Parallel Distrib. Comput. 61(9): 1382-1388 (2001) |
95 | EE | 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) |
94 | EE | S. H. Huang, Frank K. Hwang: When is Individual Testing Optimal for Nonadaptive Group Testing? SIAM J. Discrete Math. 14(4): 540-548 (2001) |
93 | EE | 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) |
92 | EE | Li-Da Tong, Frank K. Hwang, Gerard J. Chang: Channel graphs of bit permutation networks. Theor. Comput. Sci. 263(1-2): 139-143 (2001) |
91 | EE | Frank K. Hwang: A complementary survey on double-loop networks. Theor. Comput. Sci. 263(1-2): 211-229 (2001) |
2000 | ||
90 | Frank K. Hwang, S. K. Chen: The 1.5-loop network and the mixed 1.5-loop network. SIROCCO 2000: 297-306 | |
89 | EE | Chiuyuan Chen, Frank K. Hwang: The Minimum Distance Diagram of Double-Loop Networks. IEEE Trans. Computers 49(9): 977-979 (2000) |
88 | EE | Frank K. Hwang, Sheng-Chyang Liaw: On nonblocking multicast three-stage Clos networks. IEEE/ACM Trans. Netw. 8(4): 535-539 (2000) |
87 | EE | Frank K. Hwang, C. K. Pai: Sequential construction of a circular consecutive-2 system. Inf. Process. Lett. 75(5): 231-235 (2000) |
86 | Chiuyuan Chen, Frank K. Hwang: Equivalent L-Shapes of Double-Loop Networks for the Degenerate Case. Journal of Interconnection Networks 1(1): 47-60 (2000) | |
85 | EE | Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum: Linear-shaped partition problems. Oper. Res. Lett. 26(4): 159-163 (2000) |
1999 | ||
84 | EE | Gerard J. Chang, Frank K. Hwang, Li-Da Tong: Characterizing bit permutation networks. Networks 33(4): 261-267 (1999) |
83 | EE | G. W. Richards, Frank K. Hwang: Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation. Networks 33(4): 269-291 (1999) |
82 | EE | Ding-Zhu Du, Frank K. Hwang, Guoliang Xue: Interconnecting Highways. SIAM J. Discrete Math. 12(2): 252-261 (1999) |
1998 | ||
81 | EE | Frank K. Hwang, Wen-Dar Lin: The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch. COCOON 1998: 204-212 |
80 | EE | Frank K. Hwang, Gerard J. Chang: Enumerating Consecutive and Nested Partitions for Graphs. Eur. J. Comb. 19(1): 63-70 (1998) |
79 | 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) | |
78 | Gerard J. Chang, Frank K. Hwang, Y. C. Yao: Localizing Combinatorial Properties for Partitions on Block Graphs. J. Comb. Optim. 2(4): 429-441 (1998) | |
77 | Ding-Zhu Du, Biao Gao, Frank K. Hwang, J. H. Kim: On Multirate Rearrangeable Clos Networks. SIAM J. Comput. 28(2): 463-470 (1998) | |
76 | Frank K. Hwang, Y. C. Yao: Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube. Theory Comput. Syst. 31(1): 63-66 (1998) | |
1997 | ||
75 | EE | Frank K. Hwang, Y. C. Yao, Miltos D. Grammatikakis: A d-move Local Permutation Routing for the d-cube. Discrete Applied Mathematics 72(3): 199-207 (1997) |
74 | EE | Peter C. Fishburn, Frank K. Hwang, Ding-Zhu Du, Biao Gao: On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks. Discrete Applied Mathematics 78(1-3): 75-87 (1997) |
73 | Frank K. Hwang, P. J. Wan: Comparing File Copies with at Most Three Disagreeing Pages. IEEE Trans. Computers 46(6): 716-718 (1997) | |
72 | Frank K. Hwang: A Modification to a Decomposition Algorithm of Gordon and Srikanthan. IEEE Trans. Computers 46(8): 958-960 (1997) | |
71 | EE | Frank K. Hwang, Wenan Zang: Detecting Corrupted Pages in M Replicated Large Files. IEEE Trans. Parallel Distrib. Syst. 8(12): 1241-1245 (1997) |
70 | EE | Gerard J. Chang, Frank K. Hwang: Optimality of consecutive and nested tree partitions. Networks 30(2): 75-80 (1997) |
69 | EE | Frank K. Hwang, Paul E. Wright, Xiao-Dong Hu: Exact reliabilities of most reliable double-loop networks. Networks 30(2): 81-90 (1997) |
68 | Frank K. Hwang, Tzai-Shunne Lin, Rong-Hong Jan: A Permutation Routing Algorithm for Double Loop Networks. Parallel Processing Letters 7(3): 259-265 (1997) | |
67 | EE | B. Gao, Frank K. Hwang: Wide-Sense Nonblocking for Multirate 3-Stage Clos Networks. Theor. Comput. Sci. 182(1-2): 171-182 (1997) |
1996 | ||
66 | EE | Frank K. Hwang, Uriel G. Rothblum, Yi-Ching Yao: Localizing combinatorial properties of partitions. Discrete Mathematics 160(1-3): 1-23 (1996) |
65 | EE | Frank K. Hwang: Extremal Permutations with Respect to Weak Majorizations. Eur. J. Comb. 17(7): 637-645 (1996) |
1995 | ||
64 | EE | Frank K. Hwang: The Time Complexity of Deterministic Broadcast Radio Networks. Discrete Applied Mathematics 60(1-3): 219-222 (1995) |
63 | Frank K. Hwang, Paul E. Wright: Survival Reliability of Some Double-Loop Networks and Chordal Rings. IEEE Trans. Computers 44(12): 1468-1471 (1995) | |
62 | Frank K. Hwang, C. L. Mallows: Enumerating Nested and Consecutive Partitions. J. Comb. Theory, Ser. A 70(2): 323-333 (1995) | |
1994 | ||
61 | EE | Xiao-Dong Hu, Frank K. Hwang: Cutting Numbers for the Forward Loop Backward Hop Network. Discrete Applied Mathematics 48(2): 147-161 (1994) |
60 | Frank K. Hwang, Uriel G. Rothblum: Constrained partitioning problems. Discrete Applied Mathematics 50(1): 93-96 (1994) | |
59 | EE | Amotz Bar-Noy, Frank K. Hwang, Ilan Kessler, Shay Kutten: A New Competitive Algorithm for Group Testing. Discrete Applied Mathematics 52(1): 29-38 (1994) |
58 | Frank K. Hwang: Comments on "Network Resilience: A Measure of Network Fault Tolerance". IEEE Trans. Computers 43(12): 1451-1452 (1994) | |
57 | 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) | |
1993 | ||
56 | Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang: Adaptive and Oblivious Algorithms for D-Cube Permutation Routing. ISAAC 1993: 167-175 | |
55 | Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang: Universality of D-Cube (D<8). PARCO 1993: 517-520 | |
54 | EE | Ding-Zhu Du, Frank K. Hwang: Competitive Group Testing. Discrete Applied Mathematics 45(3): 221-232 (1993) |
53 | EE | Frank K. Hwang, Stavros G. Papastavridis: Erratum: Binary Vectors with Exactly k Nonoverlapping m-Tuples of Consecutive ones. Discrete Applied Mathematics 46(3): 283 (1993) |
52 | Frank K. Hwang, Uriel G. Rothblum, Larry A. Shepp: Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders. SIAM J. Discrete Math. 6(4): 533-547 (1993) | |
1992 | ||
51 | Amotz Bar-Noy, Ilan Kessler, Shay Kutten, Frank K. Hwang: A New Competitive Algorithm for Group Testing. INFOCOM 1992: 786-793 | |
50 | Frank K. Hwang: Foreword. Algorithmica 7(2&3): 119-120 (1992) | |
49 | Ding-Zhu Du, Frank K. Hwang: A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio. Algorithmica 7(2&3): 121-135 (1992) | |
48 | Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor: The Rectilinear Steiner Arborescence Problem. Algorithmica 7(2&3): 277-288 (1992) | |
47 | EE | Xiao-Dong Hu, Frank K. Hwang: An Improved Upper Bound for the Subarray Partial Concentrators. Discrete Applied Mathematics 37/38: 341-346 (1992) |
46 | EE | Frank K. Hwang, G. W. Richards: The Capacity of the Subarray Partial Concentrators. Discrete Applied Mathematics 39(3): 231-240 (1992) |
45 | 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) | |
44 | Frank K. Hwang, J. F. Weng: The Shortest Network under a Given Topology. J. Algorithms 13(3): 468-488 (1992) | |
43 | Ding-Zhu Du, Frank K. Hwang: Reducing the Steiner Problem in a Normed Space. SIAM J. Comput. 21(6): 1001-1007 (1992) | |
1991 | ||
42 | EE | Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang, X. M. Zhang: The Hamiltonian property of generalized de Bruijn digraphs. J. Comb. Theory, Ser. B 52(1): 1-8 (1991) |
1990 | ||
41 | 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 | |
40 | Frank K. Hwang, Y. C. Yao: Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees. Algorithmica 5(4): 591-598 (1990) | |
39 | Y. C. Yao, Frank K. Hwang: On the cutoff point for pairwise enabling for infinite users in a multiaccess system. IEEE Transactions on Information Theory 36(5): 1183- (1990) | |
38 | Ding-Zhu Du, Frank K. Hwang: Optimal Assembly of an s-Stage k-OUT-OF-n System. SIAM J. Discrete Math. 3(3): 349-354 (1990) | |
1989 | ||
37 | Frank K. Hwang, Y. C. Yao: A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels. IEEE Transactions on Information Theory 35(3): 698- (1989) | |
36 | Frank K. Hwang: Y. C. Yao: Cutoff Point and Monotonicity Properties for Multinomial Group Testing. SIAM J. Discrete Math. 2(4): 500-507 (1989) | |
1988 | ||
35 | Frank K. Hwang, G. D. Song, G. Y. Ting, Ding-Zhu Du: A Decomposition Theorem on Euclidean Steiner Minimal Trees. Discrete & Computational Geometry 3: 367-382 (1988) | |
34 | Ying Cheng, Frank K. Hwang: Diameters of Weighted Double Loop Networks. J. Algorithms 9(3): 401-410 (1988) | |
33 | Xian M. Chang, Frank K. Hwang, J. F. Weng: Optimal Detection of Two Defectives with a Parity Check Device. SIAM J. Discrete Math. 1(1): 38-44 (1988) | |
32 | Y. C. Yao, Frank K. Hwang: A Fundamental Monotonicity in Group Testing. SIAM J. Discrete Math. 1(2): 256-259 (1988) | |
1987 | ||
31 | Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang: Minimal-Distance Routing for Kykios II. ICPP 1987: 546-549 | |
30 | Ding-Zhu Du, Frank K. Hwang, G. D. Song, G. Y. Ting: Steiner Minimal Trees on Sets of Four Points. Discrete & Computational Geometry 2: 401-414 (1987) | |
29 | Ding-Zhu Du, Frank K. Hwang, J. F. Weng: Steiner Minimal Trees for Regular Polygons. Discrete & Computational Geometry 2: 65-84 (1987) | |
28 | Frank K. Hwang: Comments on ``Reliable Loop Topologies for Large Local Computer Networks''. IEEE Trans. Computers 36(3): 383-384 (1987) | |
27 | Frank K. Hwang, Xian M. Chang: Cutoff points for roll call protocols in multiple access systems. IEEE Transactions on Information Theory 33(4): 577-581 (1987) | |
26 | Frank K. Hwang, Lawrence A. Shepp: Some inequalities concerning random subsets of a set. IEEE Transactions on Information Theory 33(4): 596- (1987) | |
1986 | ||
25 | EE | Peter C. Fishburn, Frank K. Hwang, Hikyu Lee: Do local majorities force a global majority? Discrete Mathematics 61(2-3): 165-179 (1986) |
24 | EE | Frank K. Hwang, J. F. Weng: Hexagonal coordinate systems and steiner minimal trees. Discrete Mathematics 62(1): 49-57 (1986) |
1985 | ||
23 | Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang: Doubly Linked Ring Networks. IEEE Trans. Computers 34(9): 853-855 (1985) | |
22 | Ding-Zhu Du, Frank K. Hwang, E. Y. Yao: The Steiner Ratio Conjecture Is True for Five Points. J. Comb. Theory, Ser. A 38(2): 230-240 (1985) | |
1984 | ||
21 | Frank K. Hwang, Qin De Kang, Jia En Yu: Complete Balanced Howell Rotations for 16k + 12 Partnerships. J. Comb. Theory, Ser. A 36(1): 66-72 (1984) | |
20 | Ding-Zhu Du, Frank K. Hwang: A Multiplication Theorem for Balanced Howell Rotations. J. Comb. Theory, Ser. A 37(2): 121-126 (1984) | |
19 | Frank K. Hwang: Selecting k Objects from a Cycle with p Pairs of Separation s. J. Comb. Theory, Ser. A 37(2): 197-199 (1984) | |
18 | Frank K. Hwang, János Körner, Victor K.-W. Wei: Selecting Non-consecutive Balls Arranged in Many Lines. J. Comb. Theory, Ser. A 37(3): 327-336 (1984) | |
1983 | ||
17 | EE | Frank K. Hwang, Jia Feng Weng, Ding-Zhu Du: A class of full Steiner minimal trees. Discrete Mathematics 45(1): 107-112 (1983) |
16 | EE | Frank K. Hwang, Victor K.-W. Wei: A partition identity. Discrete Mathematics 46(3): 323-326 (1983) |
15 | Frank K. Hwang, Ko-Wei Lih: Latin Squares and Superqueens. J. Comb. Theory, Ser. A 34(1): 110-114 (1983) | |
1982 | ||
14 | Ding-Zhu Du, E. Y. Yao, Frank K. Hwang: A Short Proof of a Result of Pollak on Steiner Minimal Trees. J. Comb. Theory, Ser. A 32(3): 396-400 (1982) | |
1980 | ||
13 | Frank K. Hwang: Optimal Merging of 3 Elements with n Elements. SIAM J. Comput. 9(2): 298-320 (1980) | |
1979 | ||
12 | EE | Frank K. Hwang: An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees. J. ACM 26(2): 177-182 (1979) |
11 | Frank K. Hwang: Crisscross Latin Squares. J. Comb. Theory, Ser. A 27(3): 371-375 (1979) | |
1978 | ||
10 | Frank K. Hwang, Shen Lin: Distribution of Integers into k-tuples with Prescribed Conditions. J. Comb. Theory, Ser. A 25(2): 105-116 (1978) | |
1977 | ||
9 | 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) | |
8 | Frank K. Hwang, Shen Lin: Neighbor Designs. J. Comb. Theory, Ser. A 23(3): 302-313 (1977) | |
1976 | ||
7 | Frank K. Hwang: New Constructions for Balanced Howell Rotations. J. Comb. Theory, Ser. A 21(1): 44-51 (1976) | |
6 | Frank K. Hwang: New Classes of Complete Balanced Howell Rotations. J. Comb. Theory, Ser. A 21(1): 86-92 (1976) | |
1974 | ||
5 | Frank K. Hwang, Shen Lin: A Direct Method to Construct Triple Systems. J. Comb. Theory, Ser. A 17(1): 84-94 (1974) | |
1973 | ||
4 | EE | Frank K. Hwang, David N. Deutsch: A Class of Merging Algorithms. J. ACM 20(1): 148-159 (1973) |
1972 | ||
3 | Elwyn R. Berlekamp, Frank K. Hwang: Constructions for Balanced Howell Rotations for Bridge Tournaments. J. Comb. Theory, Ser. A 12(2): 159-166 (1972) | |
2 | Frank K. Hwang, Shen Lin: A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets. SIAM J. Comput. 1(1): 31-39 (1972) | |
1971 | ||
1 | Frank K. Hwang, Shen Lin: Optimal Merging of 2 Elements with n Elements Acta Inf. 1: 145-158 (1971) |