# Frank K. Hwang

According to our database

^{1}, Frank K. Hwang## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2014

Are there more almost separable partitions than separable partitions?

J. Comb. Optim., 2014

2012

A new approach to solve open-partition problems.

J. Comb. Optim., 2012

2011

On the number of separable partitions.

J. Comb. Optim., 2011

Pooling designs for clone library screening in the inhibitor complex model.

J. Comb. Optim., 2011

2009

Generalizing and Fine Tuning Triple-Loop Networks.

Journal of Interconnection Networks, 2009

The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks.

Discrete Applied Mathematics, 2009

2008

An upper bound of the number of tests in pooling designs for the error-tolerant complex model.

Optimization Letters, 2008

Improved construction for pooling design.

J. Comb. Optim., 2008

A survey on nonadaptive group testing algorithms through the angle of decoding.

J. Comb. Optim., 2008

A new construction of

*I*-separable matrices via an improved decoding of Macula's construction.
Discrete Optimization, 2008

Equivalence of permutation polytopes corresponding to strictly supermodular functions.

Discrete Applied Mathematics, 2008

Sphere-separable partitions of multi-parameter elements.

Discrete Applied Mathematics, 2008

2007

The identification of positive clones in a general inhibitor model.

J. Comput. Syst. Sci., 2007

An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution.

J. Comb. Optim., 2007

Exploring the missing link among d-separable, d

^{_}-separable and d-disjunct matrices.
Discrete Applied Mathematics, 2007

A competitive algorithm in searching for many edges in a hypergraph.

Discrete Applied Mathematics, 2007

Counting disjoint 2-partitions for points in the plane.

Discrete Applied Mathematics, 2007

2006

On noninterruptive rearrangeable networks.

IEEE/ACM Trans. Netw., 2006

Wide-sense nonblocking for multi-log

_{d}N networks under various routing strategies.
Theor. Comput. Sci., 2006

Rearrangeability of bit permutation networks.

Theor. Comput. Sci., 2006

On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out.

SIAM J. Discrete Math., 2006

A Polytope Approach to the Optimal Assembly Problem.

J. Global Optimization, 2006

The Mean-Partition Problem.

J. Global Optimization, 2006

Construction of

*d(H)*-disjunct matrix for group testing in hypergraphs.
J. Comb. Optim., 2006

One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions.

J. Comb. Optim., 2006

New Construction for Transversal Design.

Journal of Computational Biology, 2006

Tessellating polyominos in the plane.

Discrete Mathematics, 2006

A novel use of t-packings to construct d-disjunct matrices.

Discrete Applied Mathematics, 2006

2005

Necessary and sufficient conditions for rearrangeable Log/sub d/(N, m, p).

IEEE Trans. Communications, 2005

A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks.

IEEE Trans. Communications, 2005

SIAM J. Comput., 2005

Strict nonblockingness of reduced shuffle-exchange networks.

Networks, 2005

Equivalence of buddy networks with arbitrary number of stages.

Networks, 2005

Supermodularity in Mean-Partition Problems.

J. Global Optimization, 2005

On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls.

J. Comb. Optim., 2005

A Construction of Pooling Designs with Some Happy Surprises.

Journal of Computational Biology, 2005

An almost-linear time and linear space algorithm for the longest common subsequence problem.

Inf. Process. Lett., 2005

Identifying d positive clones in the presence of inhibitors.

IJBRA, 2005

A competitive algorithm to find all defective edges in a graph.

Discrete Applied Mathematics, 2005

2004

Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies.

Theor. Comput. Sci., 2004

Partition-Optimization with Schur Convex Sum Objective Functions.

SIAM J. Discrete Math., 2004

Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks.

SIAM J. Discrete Math., 2004

Permutation polytopes corresponding to strongly supermodular functions.

Discrete Applied Mathematics, 2004

2003

A survey on multi-loop networks.

Theor. Comput. Sci., 2003

Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability.

IEEE Trans. Communications, 2003

Wide-sense nonblocking multicast Log

_{2}(N, m, p) networks.
IEEE Trans. Communications, 2003

A general construction for nonblocking crosstalk-free photonic switching networks.

Networks, 2003

Some Combinatorial Properties of Mixed Chordal Rings.

Journal of Interconnection Networks, 2003

An Efficient Algorithm for the Reliability of Consecutive-k-n Networks.

J. Inf. Sci. Eng., 2003

Random Pooling Designs Under Various Structures.

J. Comb. Optim., 2003

The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules.

J. Comb. Optim., 2003

Error-Tolerant Pooling Designs with Inhibitors.

Journal of Computational Biology, 2003

Sortability of vector partitions.

Discrete Mathematics, 2003

On Macula's error-correcting pool designs.

Discrete Mathematics, 2003

The existence of hyper-L triple-loop networks.

Discrete Mathematics, 2003

Using transforming matrices to generate DNA clone grids.

Discrete Applied Mathematics, 2003

2002

Some permutation routing algorithms for low-dimensional hypercubes.

Theor. Comput. Sci., 2002

Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1.

SIAM J. Discrete Math., 2002

k-Diameters of the Hyper-L Shape Tile.

Journal of Interconnection Networks, 2002

The Structural Birnbaum Importance of Consecutive-k Systems.

J. Comb. Optim., 2002

Preface.

Discrete Mathematics, 2002

Group testing and fault detection for replicated files.

Discrete Applied Mathematics, 2002

2001

Lower bounds for wide-sense nonblocking Clos network.

Theor. Comput. Sci., 2001

Channel graphs of bit permutation networks.

Theor. Comput. Sci., 2001

A complementary survey on double-loop networks.

Theor. Comput. Sci., 2001

When is Individual Testing Optimal for Nonadaptive Group Testing?

SIAM J. Discrete Math., 2001

Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks.

Networks, 2001

Monotone Routing in Multirate Rearrangeable Clos Networks.

J. Parallel Distrib. Comput., 2001

Optimal Consecutive-k-out-of-(2k+1): G Cycle.

J. Global Optimization, 2001

Optimal quantitative group testing on cycles and paths.

Discrete Applied Mathematics, 2001

A General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks.

Proceedings of the 30th International Workshops on Parallel Processing (ICPP 2001 Workshops), 2001

2000

On nonblocking multicast three-stage Clos networks.

IEEE/ACM Trans. Netw., 2000

The Minimum Distance Diagram of Double-Loop Networks.

IEEE Trans. Computers, 2000

Linear-shaped partition problems.

Oper. Res. Lett., 2000

Equivalent L-Shapes of Double-Loop Networks for the Degenerate Case.

Journal of Interconnection Networks, 2000

Supermodularity in Various Partition Problems.

J. Global Optimization, 2000

Sequential construction of a circular consecutive-2 system.

Inf. Process. Lett., 2000

The 1.5-loop network and the mixed 1.5-loop network.

Proceedings of the SIROCCO 7, 2000

1999

A Polynomial Time Algorithm for Shaped Partition Problems.

SIAM Journal on Optimization, 1999

Interconnecting Highways.

SIAM J. Discrete Math., 1999

Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation.

Networks, 1999

Characterizing bit permutation networks.

Networks, 1999

Partition polytopes over 1-dimensional points.

Math. Program., 1999

The consecutive-4 digraphs are Hamiltonian.

Journal of Graph Theory, 1999

1998

Choosing the best log

_{k}(N, m, P) strictly nonblocking networks.
IEEE Trans. Communications, 1998

On Multirate Rearrangeable Clos Networks.

SIAM J. Comput., 1998

Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube.

Theory Comput. Syst., 1998

Localizing Combinatorial Properties for Partitions on Block Graphs.

J. Comb. Optim., 1998

Sortabilities of Partition Properties.

J. Comb. Optim., 1998

Enumerating Consecutive and Nested Partitions for Graphs.

Eur. J. Comb., 1998

The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch.

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Detecting Corrupted Pages in

*M*Replicated Large Files.
IEEE Trans. Parallel Distrib. Syst., 1997

Wide-Sense Nonblocking for Multirate 3-Stage Clos Networks.

Theor. Comput. Sci., 1997

Comparing File Copies with at Most Three Disagreeing Pages.

IEEE Trans. Computers, 1997

A Modification to a Decomposition Algorithm of Gordon and Srikanthan.

IEEE Trans. Computers, 1997

A Permutation Routing Algorithm for Double Loop Networks.

Parallel Processing Letters, 1997

Exact reliabilities of most reliable double-loop networks.

Networks, 1997

Optimality of consecutive and nested tree partitions.

Networks, 1997

A d-move Local Permutation Routing for the d-cube.

Discrete Applied Mathematics, 1997

On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks.

Discrete Applied Mathematics, 1997

Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation.

Proceedings of the Advances in Switching Networks, 1997

Characterizing bit permutation networks.

Proceedings of the Advances in Switching Networks, 1997

1996

A new decomposition algorithm for rearrangeable Clos interconnection networks.

IEEE Trans. Communications, 1996

Optimality of Nested Partitions and Its Application to Cluster Analysis.

SIAM Journal on Optimization, 1996

Efficient algorithms for the reliabilities of replicated n-parallel-task graphs.

Oper. Res. Lett., 1996

Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions.

Math. Oper. Res., 1996

Extremal Permutations with Respect to Weak Majorizations.

Eur. J. Comb., 1996

Localizing combinatorial properties of partitions.

Discrete Mathematics, 1996

1995

Survival Reliability of Some Double-Loop Networks and Chordal Rings.

IEEE Trans. Computers, 1995

Assembly at system level versus component level.

Oper. Res. Lett., 1995

Enumerating Nested and Consecutive Partitions.

J. Comb. Theory, Ser. A, 1995

The Time Complexity of Deterministic Broadcast Radio Networks.

Discrete Applied Mathematics, 1995

1994

Comments on "Network Resilience: A Measure of Network Fault Tolerance".

IEEE Trans. Computers, 1994

Minimal-distance routing for KYKLOS II.

Networks, 1994

A New Competitive Algorithm for the Counterfeit Coin Problem.

Inf. Process. Lett., 1994

Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules.

Operations Research, 1994

Constrained partitioning problems.

Discrete Applied Mathematics, 1994

Cutting Numbers for the Forward Loop Backward Hop Network.

Discrete Applied Mathematics, 1994

A New Competitive Algorithm for Group Testing.

Discrete Applied Mathematics, 1994

1993

Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders.

SIAM J. Discrete Math., 1993

A two-stage network with dual partial concentrators.

Networks, 1993

Most reliable double loop networks in survival reliability.

Networks, 1993

Majorization and Schur Convexity with Respect to Partial Orders.

Math. Oper. Res., 1993

Discrete Applied Mathematics, 1993

Competitive Group Testing.

Discrete Applied Mathematics, 1993

Universality of D-Cube (D<8).

Proceedings of the Parallel Computing: Trends and Applications, 1993

Adaptive and Oblivious Algorithms for D-Cube Permutation Routing.

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992

Reducing the Steiner Problem in a Normed Space.

SIAM J. Comput., 1992

Reliabilities of chordal rings.

Networks, 1992

The Shortest Network under a Given Topology.

J. Algorithms, 1992

Routing Algorithms for Double Loop Networks.

Int. J. Found. Comput. Sci., 1992

The Capacity of the Subarray Partial Concentrators.

Discrete Applied Mathematics, 1992

An Improved Upper Bound for the Subarray Partial Concentrators.

Discrete Applied Mathematics, 1992

The Rectilinear Steiner Arborescence Problem.

Algorithmica, 1992

Foreword.

Algorithmica, 1992

A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio.

Algorithmica, 1992

A New Competitive Algorithm for Group Testing.

Proceedings of the Proceedings IEEE INFOCOM '92, 1992

1991

Using combinatorial designs to construct partial concentrators.

IEEE Trans. Communications, 1991

The Hamiltonian property of generalized de Bruijn digraphs.

J. Comb. Theory, Ser. B, 1991

Competitive Group Testing.

Proceedings of the On-Line Algorithms, 1991

1990

On the cutoff point for pairwise enabling for infinite users in a multiaccess system.

IEEE Trans. Information Theory, 1990

SIAM J. Discrete Math., 1990

Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees.

Algorithmica, 1990

An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels.

IEEE Trans. Information Theory, 1989

Y. C. Yao: Cutoff Point and Monotonicity Properties for Multinomial Group Testing.

SIAM J. Discrete Math., 1989

A Survey on Double Loop Networks.

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1988

Asymptotic results for partial concentrators.

IEEE Trans. Communications, 1988

A Fundamental Monotonicity in Group Testing.

SIAM J. Discrete Math., 1988

Optimal Detection of Two Defectives with a Parity Check Device.

SIAM J. Discrete Math., 1988

Generalized de Bruijn digraphs.

Networks, 1988

Diameters of Weighted Double Loop Networks.

J. Algorithms, 1988

The Existence of Symmetric Skew Balanced Starters for Odd Prime Powers.

Eur. J. Comb., 1988

A Decomposition Theorem on Euclidean Steiner Minimal Trees.

Discrete & Computational Geometry, 1988

1987

Some inequalities concerning random subsets of a set.

IEEE Trans. Information Theory, 1987

Cutoff points for roll call protocols in multiple access systems.

IEEE Trans. Information Theory, 1987

Comments on "Reliable Loop Topologies for Large Local Computer Networks".

IEEE Trans. Computers, 1987

Steiner Minimal Trees for Regular Polygons.

Discrete & Computational Geometry, 1987

Steiner Minimal Trees on Sets of Four Points.

Discrete & Computational Geometry, 1987

Minimal-Distance Routing for Kykios II.

Proceedings of the International Conference on Parallel Processing, 1987

1986

On Nonblocking Multiconnection Networks.

IEEE Trans. Communications, 1986

On a conjecture of trietsch and handler on the flow-dependent steiner ratio.

Networks, 1986

Hexagonal coordinate systems and steiner minimal trees.

Discrete Mathematics, 1986

Do local majorities force a global majority?

Discrete Mathematics, 1986

1985

Doubly Linked Ring Networks.

IEEE Trans. Computers, 1985

Component-level redundancy is better than system-level redundancy for channel graphs.

Networks, 1985

Optimal consecutive-2 systems of lines and cycles.

Networks, 1985

The Steiner Ratio Conjecture Is True for Five Points.

J. Comb. Theory, Ser. A, 1985

Diagonal and Pandiagonal Tournament Latin Squares.

Eur. J. Comb., 1985

1984

Complete Balanced Howell Rotations for 16k + 12 Partnerships.

J. Comb. Theory, Ser. A, 1984

Selecting Non-consecutive Balls Arranged in Many Lines.

J. Comb. Theory, Ser. A, 1984

Selecting k Objects from a Cycle with p Pairs of Separation s.

J. Comb. Theory, Ser. A, 1984

A Multiplication Theorem for Balanced Howell Rotations.

J. Comb. Theory, Ser. A, 1984

1983

Latin Squares and Superqueens.

J. Comb. Theory, Ser. A, 1983

A class of full Steiner minimal trees.

Discrete Mathematics, 1983

A partition identity.

Discrete Mathematics, 1983

1982

A Short Proof of a Result of Pollak on Steiner Minimal Trees.

J. Comb. Theory, Ser. A, 1982

Group testing with two defectives.

Discrete Applied Mathematics, 1982

1980

A Group Testing Problem.

SIAM J. Matrix Analysis Applications, 1980

Optimal Merging of 3 Elements with n Elements.

SIAM J. Comput., 1980

1979

On the construction of balanced switching networks.

Networks, 1979

Crisscross Latin Squares.

J. Comb. Theory, Ser. A, 1979

An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees.

J. ACM, 1979

1978

Distribution of Integers into k-tuples with Prescribed Conditions.

J. Comb. Theory, Ser. A, 1978

1977

Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units.

IEEE Trans. Computers, 1977

Rectilinear steiner trees: Efficient special-case algorithms.

Networks, 1977

Neighbor Designs.

J. Comb. Theory, Ser. A, 1977

1976

New Classes of Complete Balanced Howell Rotations.

J. Comb. Theory, Ser. A, 1976

New Constructions for Balanced Howell Rotations.

J. Comb. Theory, Ser. A, 1976

1974

A Direct Method to Construct Triple Systems.

J. Comb. Theory, Ser. A, 1974

1973

A Class of Merging Algorithms.

J. ACM, 1973

Hypergeometric group testing algorithms.

Proceedings of the American Federation of Information Processing Societies: 1973 National Computer Conference, 1973

1972

A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets.

SIAM J. Comput., 1972

Constructions for Balanced Howell Rotations for Bridge Tournaments.

J. Comb. Theory, Ser. A, 1972

1971

Optimal Merging of 2 Elements with n Elements.

Acta Inf., 1971