 | 2010 |
| 12 |  | Tayuan Huang,
Kaishun Wang,
Chih-wen Weng:
A class of error-correcting pooling designs over complexes.
J. Comb. Optim. 19(4): 486-491 (2010) |
| 2009 |
| 11 |  | Yujuan Bai,
Tayuan Huang,
Kaishun Wang:
Error-correcting pooling designs associated with some distance-regular graphs.
Discrete Applied Mathematics 157(14): 3038-3045 (2009) |
| 2008 |
| 10 |  | Tayuan Huang,
Kaishun Wang,
Chih-wen Weng:
Pooling spaces associated with finite geometry.
Eur. J. Comb. 29(6): 1483-1491 (2008) |
| 2004 |
| 9 |  | Tayuan Huang,
Kuei-Hung You:
Strongly Regular Graphs associated with Bent Functions.
ISPAN 2004: 380-384 |
| 8 |  | Tayuan Huang,
Chih-wen Weng:
Pooling spaces and non-adaptive pooling designs.
Discrete Mathematics 282(1-3): 163-169 (2004) |
| 2003 |
| 7 |  | Tayuan Huang,
Chih-wen Weng:
A Note on Decoding of Superimposed Codes.
J. Comb. Optim. 7(4): 381-384 (2003) |
| 1999 |
| 6 |  | Tayuan Huang,
Chao-Rong Liu:
Spectral Characterization of Some Generalized Odd Graphs.
Graphs and Combinatorics 15(2): 195-209 (1999) |
| 1995 |
| 5 |  | Michel Deza,
Tayuan Huang:
Complementary l1-Graphs and Related Combinatorial Structures.
Combinatorics and Computer Science 1995: 74-90 |
| 1994 |
| 4 |  | Tung-Shan Fu,
Tayuan Huang:
A Unified Approach to a Characterization of Grassmann Graphs and Bilinear Forms Graphs.
Eur. J. Comb. 15(4): 363-373 (1994) |
| 3 |  | Tayuan Huang:
Spectral Characterization of Odd Graphs Ok, k ≤ 6.
Graphs and Combinatorics 10(2-4): 235-240 (1994) |
| 1993 |
| 2 |  | Tayuan Huang,
Monique Laurent:
(s, r; mu)-nets and alternating forms graphs.
Discrete Mathematics 114(1-3): 237-252 (1993) |
| 1987 |
| 1 |  | Tayuan Huang:
An analogue of the Erdös-Ko-Rado theorem for the distance-regular graphs of bilinear forms.
Discrete Mathematics 64(2-3): 191-198 (1987) |