Frank K. Hwang

223 papers A* 2B 3Misc 1Journal 210Unranked 5
YearRankTypeTitle / Venue / Authors
2014 J jnl
Are there more almost separable partitions than separable partitions?
J. Comb. Optim.
Fei-Huang Chang, Hong-Bin Chen, Frank K. Hwang
2012 J jnl
A new approach to solve open-partition problems.
J. Comb. Optim.
Huilan Chang, Frank K. Hwang, Uriel G. Rothblum
2011 J jnl
On the number of separable partitions.
J. Comb. Optim.
Frank K. Hwang, Uriel G. Rothblum
2011 J jnl
Pooling designs for clone library screening in the inhibitor complex model.
J. Comb. Optim.
Fei-Huang Chang, Huilan Chang, Frank K. Hwang
2009 J jnl
Generalizing and Fine Tuning Triple-Loop Networks.
J. Interconnect. Networks
Bey-Chi Lin, Frank K. Hwang
2009 — ch.
Optimal Reservation Scheme Routing for Two-Rate Wide-Sense Nonblocking Three-Stage Clos Networks.
The Mathematics of Preference, Choice and Order
Wenqing Dou, Frank K. Hwang
2009 J jnl
The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks.
Discret. Appl. Math.
F. H. Chang, Hung-Lin Fu, Frank K. Hwang, B. C. Lin
2008 J jnl
A new construction of
Discret. Optim.
Hung-Lin Fu, Frank K. Hwang
2008 J jnl
A survey on nonadaptive group testing algorithms through the angle of decoding.
J. Comb. Optim.
Hong-Bin Chen, Frank K. Hwang
2008 J jnl
An upper bound of the number of tests in pooling designs for the error-tolerant complex model.
Optim. Lett.
Hong-Bin Chen, Hung-Lin Fu, Frank K. Hwang
2008 J jnl
Equivalence of permutation polytopes corresponding to strictly supermodular functions.
Discret. Appl. Math.
Frank K. Hwang, J. S. Lee, Uriel G. Rothblum
2008 J jnl
Improved construction for pooling design.
J. Comb. Optim.
Ping Deng, Frank K. Hwang, Weili Wu, David MacCallum, Feng Wang, Taieb Znati
2008 J jnl
Sphere-separable partitions of multi-parameter elements.
Discret. Appl. Math.
Boaz Golany, Frank K. Hwang, Uriel G. Rothblum
2007 J jnl
A competitive algorithm in searching for many edges in a hypergraph.
Discret. Appl. Math.
Ting Chen, Frank K. Hwang
2007 J jnl
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution.
J. Comb. Optim.
H. B. Chen, Ding-Zhu Du, Frank K. Hwang
2007 J jnl
Counting disjoint 2-partitions for points in the plane.
Discret. Appl. Math.
F. H. Chang, J. Y. Guo, Frank K. Hwang, J. S. Lee
2007 J jnl
Exploring the missing link among d-separable, d
Discret. Appl. Math.
Hong-Bin Chen, Frank K. Hwang
2007 J jnl
Strictly Nonblocking f-Cast Log
IEEE Trans. Commun.
Frank K. Hwang, Yang Wang, Jinzhi Tan
2007 J jnl
The identification of positive clones in a general inhibitor model.
J. Comput. Syst. Sci.
Frank K. Hwang, F. H. Chang
2006 J jnl
A Polytope Approach to the Optimal Assembly Problem.
J. Glob. Optim.
Frank K. Hwang, Uriel G. Rothblum
2006 J jnl
A novel use of t-packings to construct d-disjunct matrices.
Discret. Appl. Math.
Hung-Lin Fu, Frank K. Hwang
2006 J jnl
Construction of
J. Comb. Optim.
Hong Gao, Frank K. Hwang, My T. Thai, Weili Wu, Taieb Znati
2006 J jnl
New Construction for Transversal Design.
J. Comput. Biol.
Ding-Zhu Du, Frank K. Hwang, Weili Wu, Taieb Znati
2006 J jnl
On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out.
SIAM J. Discret. Math.
Hong-Bin Chen, Frank K. Hwang
2006 J jnl
On noninterruptive rearrangeable networks.
IEEE/ACM Trans. Netw.
Frank K. Hwang, Wen-Dar Lin, Vadim Lioubimov
2006 J jnl
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions.
J. Comb. Optim.
F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang, Uriel G. Rothblum
2006 J jnl
Rearrangeability of bit permutation networks.
Theor. Comput. Sci.
Xuewen Bao, Frank K. Hwang, Qiao Li
2006 J jnl
Tessellating polyominos in the plane.
Discret. Math.
Ming-You Chen, Frank K. Hwang, Chih-Hung Yen
2006 J jnl
The Mean-Partition Problem.
J. Glob. Optim.
Fei-Hwang Chang, Frank K. Hwang, Uriel G. Rothblum
2006 J jnl
Wide-sense nonblocking for multi-log
Theor. Comput. Sci.
F. H. Chang, J. Y. Guo, Frank K. Hwang
2005 J jnl
A Construction of Pooling Designs with Some Happy Surprises.
J. Comput. Biol.
Arkadii G. D'yachkov, Frank K. Hwang, Anthony J. Macula, Pavel A. Vilenkin, Chih-Wen Weng
2005 J jnl
A competitive algorithm to find all defective edges in a graph.
Discret. Appl. Math.
Frank K. Hwang
2005 J jnl
A hierarchy of importance indices.
IEEE Trans. Reliab.
Frank K. Hwang
2005 J jnl
A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks.
IEEE Trans. Commun.
Frank K. Hwang
2005 J jnl
An almost-linear time and linear space algorithm for the longest common subsequence problem.
Inf. Process. Lett.
J. Y. Guo, Frank K. Hwang
2005 J jnl
Equivalence of buddy networks with arbitrary number of stages.
Networks
Chiuyuan Chen, Frank K. Hwang, James K. Lan
2005 J jnl
Identifying d positive clones in the presence of inhibitors.
Int. J. Bioinform. Res. Appl.
Ding-Zhu Du, Frank K. Hwang
2005 J jnl
Necessary and sufficient conditions for rearrangeable Log
IEEE Trans. Commun.
Frank K. Hwang, Wen-Dar Lin
2005 J jnl
On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls.
J. Comb. Optim.
Hung-Lin Fu, Frank K. Hwang
2005 J jnl
Strict nonblockingness of reduced shuffle-exchange networks.
Networks
Frank K. Hwang, Binwu Zhang
2005 J jnl
Supermodularity in Mean-Partition Problems.
J. Glob. Optim.
F. H. Chang, Frank K. Hwang
2004 J jnl
Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks.
SIAM J. Discret. Math.
W. R. Chen, Frank K. Hwang, Xuding Zhu
2004 J jnl
Permutation polytopes corresponding to strongly supermodular functions.
Discret. Appl. Math.
Frank K. Hwang, J. S. Lee, Uriel G. Rothblum
2004 J jnl
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies.
Theor. Comput. Sci.
F. H. Chang, J. Y. Guo, Frank K. Hwang, C. K. Lin
2003 J jnl
A general construction for nonblocking crosstalk-free photonic switching networks.
Networks
Frank K. Hwang, Wen-Dar Lin
2003 J jnl
A survey of nonblocking multicast three-stage Clos networks.
IEEE Commun. Mag.
Frank K. Hwang
2003 J jnl
A survey on multi-loop networks.
Theor. Comput. Sci.
Frank K. Hwang
2003 J jnl
An Efficient Algorithm for the Reliability of Consecutive-k-n Networks.
J. Inf. Sci. Eng.
Jen-Chun Chang, Rong-Jaye Chen, Frank K. Hwang
2003 J jnl
Error-Tolerant Pooling Designs with Inhibitors.
J. Comput. Biol.
Frank K. Hwang, Yu-Chi Liu
2003 J jnl
Random Pooling Designs Under Various Structures.
J. Comb. Optim.
Frank K. Hwang, Yu-Chi Liu
2003 J jnl
Some Combinatorial Properties of Mixed Chordal Rings.
J. Interconnect. Networks
S. K. Chen, Frank K. Hwang, Yu-Chi Liu
2003 J jnl
Sortability of vector partitions.
Discret. Math.
Frank K. Hwang, J. S. Lee, Yu-Chi Liu, Uriel G. Rothblum
2003 J jnl
Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability.
IEEE Trans. Commun.
Frank K. Hwang, Sheng-Chyang Liaw, Li-Da Tong
2003 J jnl
The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules.
J. Comb. Optim.
Frank K. Hwang, Wen-Dar Lin
2003 J jnl
The existence of hyper-L triple-loop networks.
Discret. Math.
Chiuyuan Chen, Frank K. Hwang, J. S. Lee, S. J. Shih
2003 J jnl
Using transforming matrices to generate DNA clone grids.
Discret. Appl. Math.
Hua-Min Huang, Frank K. Hwang, Jian-Feng Ma
2003 J jnl
Wide-sense nonblocking multicast Log
IEEE Trans. Commun.
Frank K. Hwang, Bey-Chi Lin
2002 J jnl
Group testing and fault detection for replicated files.
Discret. Appl. Math.
Frank K. Hwang, Wenan Zang
2002 J jnl
Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1.
SIAM J. Discret. Math.
Ding-Zhu Du, Frank K. Hwang, Xiaohua Jia, Hung Q. Ngo
2002 J jnl
Preface.
Discret. Math.
Frank K. Hwang, Xuding Zhu
2002 J jnl
Some permutation routing algorithms for low-dimensional hypercubes.
Theor. Comput. Sci.
Frank K. Hwang, Yi-Ching Yao, Bhaskar DasGupta
2002 J jnl
Sortability of Multi-partitions.
J. Glob. Optim.
Frank K. Hwang, Y. M. Wang, J. S. Lee
2002 J jnl
The Structural Birnbaum Importance of Consecutive-k Systems.
J. Comb. Optim.
Hsun-Wen Chang, Rong-Jaye Chen, Frank K. Hwang
2002 J jnl
k-Diameters of the Hyper-L Shape Tile.
J. Interconnect. Networks
Frank K. Hwang, B. C. Lin
2001 — conf
A General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks.
ICPP Workshops
Frank K. Hwang, Wen-Dar Lin
2001 J jnl
A complementary survey on double-loop networks.
Theor. Comput. Sci.
Frank K. Hwang
2001 J jnl
A new index of component importance.
Oper. Res. Lett.
Frank K. Hwang
2001 J jnl
Channel graphs of bit permutation networks.
Theor. Comput. Sci.
Li-Da Tong, Frank K. Hwang, Gerard J. Chang
2001 J jnl
Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks.
Networks
Frank K. Hwang, Chih-Hung Yen
2001 J jnl
Lower bounds for wide-sense nonblocking Clos network.
Theor. Comput. Sci.
Kuo-Hui Tsai, Da-Wei Wang, Frank K. Hwang
2001 J jnl
Monotone Routing in Multirate Rearrangeable Clos Networks.
J. Parallel Distributed Comput.
Xiao-Dong Hu, Xiaohua Jia, Ding-Zhu Du, Frank K. Hwang
2001 J jnl
Optimal Consecutive-k-out-of-(2k+1): G Cycle.
J. Glob. Optim.
Ding-Zhu Du, Frank K. Hwang, Yunjae Jung, Hung Q. Ngo
2001 J jnl
Optimal quantitative group testing on cycles and paths.
Discret. Appl. Math.
Frank K. Hwang, J. S. Lee
2001 J jnl
When is Individual Testing Optimal for Nonadaptive Group Testing?
SIAM J. Discret. Math.
S. H. Huang, Frank K. Hwang
2000 J jnl
Equivalent L-Shapes of Double-Loop Networks for the Degenerate Case.
J. Interconnect. Networks
Chiuyuan Chen, Frank K. Hwang
2000 J jnl
Linear-shaped partition problems.
Oper. Res. Lett.
Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum
2000 J jnl
On nonblocking multicast three-stage Clos networks.
IEEE/ACM Trans. Netw.
Frank K. Hwang, Sheng-Chyang Liaw
2000 J jnl
Sequential construction of a circular consecutive-2 system.
Inf. Process. Lett.
Frank K. Hwang, C. K. Pai
2000 J jnl
Supermodularity in Various Partition Problems.
J. Glob. Optim.
Frank K. Hwang, M. M. Liao, Chiuyuan Chen
2000 B conf
The 1.5-loop network and the mixed 1.5-loop network.
SIROCCO
Frank K. Hwang, S. K. Chen
2000 J jnl
The Minimum Distance Diagram of Double-Loop Networks.
IEEE Trans. Computers
Chiuyuan Chen, Frank K. Hwang
1999 J jnl
A Polynomial Time Algorithm for Shaped Partition Problems.
SIAM J. Optim.
Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum
1999 J jnl
Characterizing bit permutation networks.
Networks
Gerard J. Chang, Frank K. Hwang, Li-Da Tong
1999 J jnl
Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation.
Networks
Gaylord W. Richards, Frank K. Hwang
1999 J jnl
Interconnecting Highways.
SIAM J. Discret. Math.
Ding-Zhu Du, Frank K. Hwang, Guoliang Xue
1999 J jnl
Partition polytopes over 1-dimensional points.
Math. Program.
Biao Gao, Frank K. Hwang, Wen-Ching Winnie Li, Uriel G. Rothblum
1999 J jnl
The consecutive-4 digraphs are Hamiltonian.
J. Graph Theory
Gerard J. Chang, Frank K. Hwang, Li-Da Tong
1998 — ed.
Advances in Switching Networks, Proceedings of a DIMACS Workshop,Princeton, New Jersey, USA, July 7-9, 1997
Advances in Switching Networks
Ding-Zhu Du, Frank K. Hwang
1998 J jnl
Choosing the best log
IEEE Trans. Commun.
Frank K. Hwang
1998 J jnl
Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube.
Theory Comput. Syst.
Frank K. Hwang, Yi-Ching Yao
1998 J jnl
Enumerating Consecutive and Nested Partitions for Graphs.
Eur. J. Comb.
Frank K. Hwang, Gerard J. Chang
1998 J jnl
Localizing Combinatorial Properties for Partitions on Block Graphs.
J. Comb. Optim.
Gerard J. Chang, Frank K. Hwang, Yi-Ching Yao
1998 J jnl
On Multirate Rearrangeable Clos Networks.
SIAM J. Comput.
Ding-Zhu Du, Biao Gao, Frank K. Hwang, J. H. Kim
1998 J jnl
Sortabilities of Partition Properties.
J. Comb. Optim.
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
1998 Misc conf
The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch.
COCOON
Frank K. Hwang, Wen-Dar Lin
1997 J jnl
A Modification to a Decomposition Algorithm of Gordon and Srikanthan.
IEEE Trans. Computers
Frank K. Hwang
1997 J jnl
A Permutation Routing Algorithm for Double Loop Networks.
Parallel Process. Lett.
Frank K. Hwang, Tzai-Shunne Lin, Rong-Hong Jan
1997 J jnl
A d-move Local Permutation Routing for the d-cube.
Discret. Appl. Math.
Frank K. Hwang, Yi-Ching Yao, Miltos D. Grammatikakis
1997 — conf
Characterizing bit permutation networks.
Advances in Switching Networks
Gerard J. Chang, Frank K. Hwang, Li-Da Tong
1997 J jnl
Comparing File Copies with at Most Three Disagreeing Pages.
IEEE Trans. Computers
Frank K. Hwang, P. J. Wan
1997 J jnl
Detecting Corrupted Pages in
IEEE Trans. Parallel Distributed Syst.
Frank K. Hwang, Wenan Zang
1997 J jnl
Exact reliabilities of most reliable double-loop networks.
Networks
Frank K. Hwang, Paul E. Wright, Xiao-Dong Hu
1997 — conf
Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation.
Advances in Switching Networks
Gaylord W. Richards, Frank K. Hwang
1997 J jnl
On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks.
Discret. Appl. Math.
Peter C. Fishburn, Frank K. Hwang, Ding-Zhu Du, Biao Gao
1997 J jnl
Optimality of consecutive and nested tree partitions.
Networks
Gerard J. Chang, Frank K. Hwang
1997 J jnl
Wide-Sense Nonblocking for Multirate 3-Stage Clos Networks.
Theor. Comput. Sci.
B. Gao, Frank K. Hwang
1996 J jnl
A new decomposition algorithm for rearrangeable Clos interconnection networks.
IEEE Trans. Commun.
Hyun Yeop Lee, Frank K. Hwang, John D. Carpinelli
1996 J jnl
Comment/reply: some recent papers on consecutively-connected systems.
IEEE Trans. Reliab.
Frank K. Hwang
1996 J jnl
Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions.
Math. Oper. Res.
Frank K. Hwang, Uriel G. Rothblum
1996 J jnl
Efficient algorithms for the reliabilities of replicated n-parallel-task graphs.
Oper. Res. Lett.
Frank K. Hwang, Paul E. Wright
1996 J jnl
Extremal Permutations with Respect to Weak Majorizations.
Eur. J. Comb.
Frank K. Hwang
1996 J jnl
Localizing combinatorial properties of partitions.
Discret. Math.
Frank K. Hwang, Uriel G. Rothblum, Yi-Ching Yao
1996 J jnl
Optimality of Nested Partitions and Its Application to Cluster Analysis.
SIAM J. Optim.
Endre Boros, Frank K. Hwang
1995 J jnl
An isomorphic factorization of the complete graph.
J. Graph Theory
Frank K. Hwang
1995 J jnl
Assembly at system level versus component level.
Oper. Res. Lett.
Frank K. Hwang, Uriel G. Rothblum
1995 J jnl
Enumerating Nested and Consecutive Partitions.
J. Comb. Theory A
Frank K. Hwang, Colin L. Mallows
1995 J jnl
Survival Reliability of Some Double-Loop Networks and Chordal Rings.
IEEE Trans. Computers
Frank K. Hwang, Paul E. Wright
1995 J jnl
The Time Complexity of Deterministic Broadcast Radio Networks.
Discret. Appl. Math.
Frank K. Hwang
1994 J jnl
A New Competitive Algorithm for Group Testing.
Discret. Appl. Math.
Amotz Bar-Noy, Frank K. Hwang, Ilan Kessler, Shay Kutten
1994 J jnl
A New Competitive Algorithm for the Counterfeit Coin Problem.
Inf. Process. Lett.
Xiao-Dong Hu, P. D. Chen, Frank K. Hwang
1994 J jnl
Comments on "Network Resilience: A Measure of Network Fault Tolerance".
IEEE Trans. Computers
Frank K. Hwang
1994 J jnl
Constrained partitioning problems.
Discret. Appl. Math.
Frank K. Hwang, Uriel G. Rothblum
1994 J jnl
Cutting Numbers for the Forward Loop Backward Hop Network.
Discret. Appl. Math.
Xiao-Dong Hu, Frank K. Hwang
1994 J jnl
Minimal-distance routing for KYKLOS II.
Networks
Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang
1994 J jnl
Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules.
Oper. Res.
Frank K. Hwang, Uriel G. Rothblum
1993 J jnl
A two-stage network with dual partial concentrators.
Networks
Frank K. Hwang, Gaylord W. Richards
1993 B conf
Adaptive and Oblivious Algorithms for D-Cube Permutation Routing.
ISAAC
Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang
1993 J jnl
An optimal group testing algorithm on k disjoint sets.
Oper. Res. Lett.
J. F. Weng, Frank K. Hwang
1993 J jnl
Competitive Group Testing.
Discret. Appl. Math.
Ding-Zhu Du, Frank K. Hwang
1993 J jnl
Erratum: Binary Vectors with Exactly
Discret. Appl. Math.
Frank K. Hwang, Stavros G. Papastavridis
1993 J jnl
Majorization and Schur Convexity with Respect to Partial Orders.
Math. Oper. Res.
Frank K. Hwang, Uriel G. Rothblum
1993 J jnl
Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders.
SIAM J. Discret. Math.
Frank K. Hwang, Uriel G. Rothblum, Larry A. Shepp
1993 J jnl
Most reliable double loop networks in survival reliability.
Networks
Xiao-Dong Hu, Frank K. Hwang, Wen-Ch'ing Winnie Li
1993 — conf
Universality of D-Cube (D<8).
PARCO
Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang
1992 A* conf
A New Competitive Algorithm for Group Testing.
INFOCOM
Amotz Bar-Noy, Ilan Kessler, Shay Kutten, Frank K. Hwang
1992 J jnl
A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio.
Algorithmica
Ding-Zhu Du, Frank K. Hwang
1992 J jnl
An Improved Upper Bound for the Subarray Partial Concentrators.
Discret. Appl. Math.
Xiao-Dong Hu, Frank K. Hwang
1992 J jnl
Foreword.
Algorithmica
Frank K. Hwang
1992 J jnl
Generalization of an engineering principle.
Oper. Res. Lett.
Frank K. Hwang, Uriel G. Rothblum
1992 J jnl
Reducing the Steiner Problem in a Normed Space.
SIAM J. Comput.
Ding-Zhu Du, Frank K. Hwang
1992 J jnl
Routing Algorithms for Double Loop Networks.
Int. J. Found. Comput. Sci.
Y. Cheng, Frank K. Hwang, Ian F. Akyildiz, D. Frank Hsu
1992 J jnl
Steiner tree problems.
Networks
Frank K. Hwang, Dana S. Richards
1992 J jnl
The Capacity of the Subarray Partial Concentrators.
Discret. Appl. Math.
Frank K. Hwang, Gaylord W. Richards
1992 J jnl
The Rectilinear Steiner Arborescence Problem.
Algorithmica
Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor
1992 J jnl
The Shortest Network under a Given Topology.
J. Algorithms
Frank K. Hwang, J. F. Weng
1991 J jnl
A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization.
Oper. Res. Lett.
Frank K. Hwang, Yi-Ching Yao
1991 J jnl
A primer of the Euclidean Steiner problem.
Ann. Oper. Res.
Frank K. Hwang
1991 J jnl
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones.
Discret. Appl. Math.
Frank K. Hwang, S. Papastavridis
1991 J jnl
The Hamiltonian property of generalized de Bruijn digraphs.
J. Comb. Theory B
Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang, X. M. Zhang
1991 J jnl
Using combinatorial designs to construct partial concentrators.
IEEE Trans. Commun.
Frank K. Hwang, Gaylord W. Richards
1990 A* conf
An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio
FOCS
Ding-Zhu Du, Frank K. Hwang
1990 J jnl
Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees.
Algorithmica
Frank K. Hwang, Yi-Ching Yao
1990 J jnl
On the cutoff point for pairwise enabling for infinite users in a multiaccess system.
IEEE Trans. Inf. Theory
Yi-Ching Yao, Frank K. Hwang
1990 J jnl
Optimal Assembly of an
SIAM J. Discret. Math.
Ding-Zhu Du, Frank K. Hwang
1989 J jnl
A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels.
IEEE Trans. Inf. Theory
Frank K. Hwang, Yi-Ching Yao
1989 J jnl
Optimal Assignment of Components to a Two-Stage
Math. Oper. Res.
Frank K. Hwang
1989 J jnl
Y. C. Yao: Cutoff Point and Monotonicity Properties for Multinomial Group Testing.
SIAM J. Discret. Math.
Frank K. Hwang
1988 J jnl
A Decomposition Theorem on Euclidean Steiner Minimal Trees.
Discret. Comput. Geom.
Frank K. Hwang, G. D. Song, G. Y. Ting, Ding-Zhu Du
1988 J jnl
A Fundamental Monotonicity in Group Testing.
SIAM J. Discret. Math.
Yi-Ching Yao, Frank K. Hwang
1988 J jnl
Asymptotic results for partial concentrators.
IEEE Trans. Commun.
Michael R. Garey, Frank K. Hwang, Gaylord W. Richards
1988 J jnl
Diameters of Weighted Double Loop Networks.
J. Algorithms
Ying Cheng, Frank K. Hwang
1988 J jnl
Generalized de Bruijn digraphs.
Networks
Ding-Zhu Du, Frank K. Hwang
1988 J jnl
Optimal Detection of Two Defectives with a Parity Check Device.
SIAM J. Discret. Math.
Xian M. Chang, Frank K. Hwang, J. F. Weng
1988 J jnl
Stronger players win more balanced knockout tournaments.
Graphs Comb.
Robert Chen, Frank K. Hwang
1988 J jnl
The Existence of Symmetric Skew Balanced Starters for Odd Prime Powers.
Eur. J. Comb.
Jia En Yu, Frank K. Hwang
1987 J jnl
Comments on "Reliable Loop Topologies for Large Local Computer Networks".
IEEE Trans. Computers
Frank K. Hwang
1987 J jnl
Cutoff points for roll call protocols in multiple access systems.
IEEE Trans. Inf. Theory
Frank K. Hwang, Xian M. Chang
1987 J jnl
Double loop networks with minimum delay.
Discret. Math.
Frank K. Hwang, Y. H. Xu
1987 B conf
Minimal-Distance Routing for Kykios II.
ICPP
Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang
1987 J jnl
Some inequalities concerning random subsets of a set.
IEEE Trans. Inf. Theory
Frank K. Hwang, Lawrence A. Shepp
1987 J jnl
Steiner Minimal Trees for Regular Polygons.
Discret. Comput. Geom.
Ding-Zhu Du, Frank K. Hwang, J. F. Weng
1987 J jnl
Steiner Minimal Trees on Sets of Four Points.
Discret. Comput. Geom.
Ding-Zhu Du, Frank K. Hwang, G. D. Song, G. Y. Ting
1986 J jnl
Do local majorities force a global majority?
Discret. Math.
Peter C. Fishburn, Frank K. Hwang, Hikyu Lee
1986 J jnl
Hexagonal coordinate systems and steiner minimal trees.
Discret. Math.
Frank K. Hwang, J. F. Weng
1986 J jnl
On Nonblocking Multiconnection Networks.
IEEE Trans. Commun.
Frank K. Hwang, Andrzej Jajszczyk
1986 J jnl
On a conjecture of trietsch and handler on the flow-dependent steiner ratio.
Networks
Ding-Zhu Du, Frank K. Hwang
1986 J jnl
Optimal Consecutive-2-Out-of-
Math. Oper. Res.
D. Z. Du, Frank K. Hwang
1985 J jnl
Component-level redundancy is better than system-level redundancy for channel graphs.
Networks
Frank K. Hwang, Lawrence A. Shepp
1985 J jnl
Diagonal and Pandiagonal Tournament Latin Squares.
Eur. J. Comb.
Gerard J. Chang, Frank K. Hwang
1985 J jnl
Doubly Linked Ring Networks.
IEEE Trans. Computers
Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang
1985 J jnl
Optimal consecutive-2 systems of lines and cycles.
Networks
Ding-Zhu Du, Frank K. Hwang
1985 J jnl
The Steiner Ratio Conjecture Is True for Five Points.
J. Comb. Theory A
Ding-Zhu Du, Frank K. Hwang, E. Y. Yao
1984 J jnl
A Multiplication Theorem for Balanced Howell Rotations.
J. Comb. Theory A
Ding-Zhu Du, Frank K. Hwang
1984 J jnl
Complete Balanced Howell Rotations for 16k + 12 Partnerships.
J. Comb. Theory A
Frank K. Hwang, Qin De Kang, Jia En Yu
1984 J jnl
Selecting Non-consecutive Balls Arranged in Many Lines.
J. Comb. Theory A
Frank K. Hwang, János Körner, Victor K.-W. Wei
1984 J jnl
Selecting k Objects from a Cycle with p Pairs of Separation s.
J. Comb. Theory A
Frank K. Hwang
1983 J jnl
A class of full Steiner minimal trees.
Discret. Math.
Frank K. Hwang, Jia Feng Weng, Ding-Zhu Du
1983 J jnl
A partition identity.
Discret. Math.
Frank K. Hwang, Victor K.-W. Wei
1983 J jnl
Control Algorithms for Rearrangeable Clos Networks.
IEEE Trans. Commun.
Frank K. Hwang
1983 J jnl
Latin Squares and Superqueens.
J. Comb. Theory A
Frank K. Hwang, Ko-Wei Lih
1983 J jnl
Multiplicative magic squares.
Discret. Math.
D. Borkovitz, Frank K. Hwang
1982 J jnl
A Short Proof of a Result of Pollak on Steiner Minimal Trees.
J. Comb. Theory A
Ding-Zhu Du, E. Y. Yao, Frank K. Hwang
1982 J jnl
Complete balanced Howell rotations for 8k+5 teams.
Discret. Math.
Frank K. Hwang
1982 J jnl
Computing the Blocking Probabilities for Spiderweb Channel Graphs.
IEEE Trans. Commun.
Frank K. Hwang
1982 J jnl
Group testing with two defectives.
Discret. Appl. Math.
Gerard J. Chang, Frank K. Hwang, Shen Lin
1980 J jnl
A Group Testing Problem.
SIAM J. Algebraic Discret. Methods
Gerard J. Chang, Frank K. Hwang
1980 J jnl
An explicit expression for the cost of a class of Huffman trees.
Discret. Math.
Frank K. Hwang
1980 J jnl
Blocking Probabilities for a Class of Spiderweb Channel Graphs.
IEEE Trans. Commun.
Frank K. Hwang
1980 J jnl
Maximum Wealth Trees.
Math. Oper. Res.
Frank K. Hwang
1980 J jnl
Optimal Merging of 3 Elements with n Elements.
SIAM J. Comput.
Frank K. Hwang
1980 J jnl
The Connection Patterns of Two Complete Binary Trees.
SIAM J. Algebraic Discret. Methods
F. R. K. Chung, Frank K. Hwang
1979 J jnl
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees.
J. ACM
Frank K. Hwang
1979 J jnl
Crisscross Latin Squares.
J. Comb. Theory A
Frank K. Hwang
1979 J jnl
On the construction of balanced switching networks.
Networks
Frank K. Hwang, Shen Lin
1979 J jnl
The largest minimal rectilinear steiner trees for a set of
Networks
F. R. K. Chung, Frank K. Hwang
1978 J jnl
Distribution of Integers into k-tuples with Prescribed Conditions.
J. Comb. Theory A
Frank K. Hwang, Shen Lin
1978 J jnl
Link designs and probability analyses for a class of connecting networks.
Networks
Frank K. Hwang
1978 J jnl
Some Optimal Partition Problems with Applications to Switching Networks.
IEEE Trans. Commun.
Frank K. Hwang
1977 J jnl
A problem on blocking probabilities in connecting networks.
Networks
F. R. K. Chung, Frank K. Hwang
1977 J jnl
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units.
IEEE Trans. Computers
M. R. Garey, Frank K. Hwang, David S. Johnson
1977 J jnl
Minimum range sequences of all k-subsets of a set.
Discret. Math.
Frank K. Hwang, J. C. Lagarias
1977 J jnl
Neighbor Designs.
J. Comb. Theory A
Frank K. Hwang, Shen Lin
1977 J jnl
Rectilinear steiner trees: Efficient special-case algorithms.
Networks
Alfred V. Aho, Michael R. Garey, Frank K. Hwang
1976 J jnl
New Classes of Complete Balanced Howell Rotations.
J. Comb. Theory A
Frank K. Hwang
1976 J jnl
New Constructions for Balanced Howell Rotations.
J. Comb. Theory A
Frank K. Hwang
1976 J jnl
On the rearrangeability of some multistage connecting networks.
Bell Syst. Tech. J.
Frank K. Hwang
1974 J jnl
A Direct Method to Construct Triple Systems.
J. Comb. Theory A
Frank K. Hwang, Shen Lin
1973 J jnl
A Class of Merging Algorithms.
J. ACM
Frank K. Hwang, David N. Deutsch
1973 — conf
Hypergeometric group testing algorithms.
AFIPS National Computer Conference
Frank K. Hwang, Shen Lin
1972 J jnl
A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets.
SIAM J. Comput.
Frank K. Hwang, Shen Lin
1972 J jnl
Constructions for Balanced Howell Rotations for Bridge Tournaments.
J. Comb. Theory A
Elwyn R. Berlekamp, Frank K. Hwang
1972 J jnl
Rearrangeability of multi-connection three-stage clos networks.
Networks
Frank K. Hwang
1971 J jnl
Optimal Merging of 2 Elements with n Elements.
Acta Informatica
Frank K. Hwang, Shen Lin