The following pages link to Frank K. Hwang (Q224543):
Displaying 50 items.
- (Q168223) (redirect page) (← links)
- Sequential construction of a circular consecutive-2 system (Q294833) (← links)
- A new approach to solve open-partition problems (Q434191) (← links)
- On the number of separable partitions (Q491209) (← links)
- Steiner minimal trees for bar waves (Q580349) (← links)
- A \(d\)-move local permutation routing for the \(d\)-cube (Q674437) (← links)
- Pooling designs for clone library screening in the inhibitor complex model (Q719023) (← links)
- Selecting k objects from a cycle with p pairs of separation s (Q797581) (← links)
- A multilication theorem for balanced Howell rotations (Q801925) (← links)
- Selecting non-consecutive balls arranged in many lines (Q802558) (← links)
- Knockout tournaments with diluted Bradley-Terry preference schemes (Q805101) (← links)
- Rearrangeability of bit permutation networks (Q818130) (← links)
- The mean-partition problem (Q857804) (← links)
- A competitive algorithm in searching for many edges in a hypergraph (Q869578) (← links)
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices (Q875600) (← links)
- Comments on Bern's probabilistic results on rectilinear Steiner trees (Q911764) (← links)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
- A new construction of \(\bar 3\)-separable matrices via an improved decoding of Macula's construction (Q955328) (← links)
- An almost-linear time and linear space algorithm for the longest common subsequence problem (Q1041737) (← links)
- A partition identity (Q1051019) (← links)
- Multiplicative magic squares (Q1055776) (← links)
- Complete balanced Howell rotations for 16k + 12 partnerships (Q1056757) (← links)
- Diagonal and pandiagonal tournament Latin squares (Q1063607) (← links)
- A linear time algorithm for full Steiner trees (Q1068839) (← links)
- Do local majorities force a global majority? (Q1089361) (← links)
- Steiner minimal trees on sets of four points (Q1091392) (← links)
- Redundant consecutive-k systems (Q1092799) (← links)
- A decomposition theorem on Euclidean Steiner minimal trees (Q1112056) (← links)
- Stronger players win more balanced knockout tournaments (Q1116595) (← links)
- The existence of symmetric skew balanced starters for odd prime powers (Q1119642) (← links)
- Localizing combinatorial properties of partitions (Q1126278) (← links)
- Optimal partitions (Q1135855) (← links)
- An explicit expression for the cost of a class of Huffman trees (Q1143320) (← links)
- Complete balanced Howell rotations for 8k+5 teams (Q1162516) (← links)
- Group testing with two defectives (Q1164364) (← links)
- A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization (Q1178735) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio (Q1186792) (← links)
- The rectilinear Steiner arborescence problem (Q1186802) (← links)
- An improved upper bound for the subarray partial concentrators (Q1199438) (← links)
- Generalization of an engineering principle (Q1200791) (← links)
- The capacity of the subarray partial concentrators (Q1201810) (← links)
- The Steiner tree problem (Q1202044) (← links)
- New constructions for balanced Howell rotations (Q1227626) (← links)
- New classes of complete balanced Howell rotations (Q1227627) (← links)
- Construction of 2-balanced \((n,k,\lambda)\) arrays (Q1232411) (← links)
- A generalization of the Karlin-McGregor theorem on coincidence probabilities and an application to clustering (Q1246200) (← links)
- Minimum range sequences of all k-subsets of a set (Q1248520) (← links)
- Distribution of integers into k-tuples with prescribed conditions (Q1257015) (← links)
- Neighbor designs (Q1257019) (← links)
