 | 2005 |
|---|
| 13 |       | Tsan-sheng Hsu,
Kuo-Hui Tsai,
Da-Wei Wang,
D. T. Lee:
Two Variations of the Minimum Steiner Problem.
J. Comb. Optim. 9(1): 101-120 (2005) |
| 2001 |
|---|
| 12 | | 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) |
| 1999 |
|---|
| 11 |  | Kuo-Hui Tsai,
Tompson,
Janusz Rajski,
Malgorzata Marek-Sadowska:
STAR-ATPG: a high speed test pattern generator for large scan designs.
ITC 1999: 1021-1030 |
| 1998 |
|---|
| 10 | | Kuo-Hui Tsai,
Da-Wei Wang:
Lower Bounds for Wide-Sense Non-blocking Clos Network.
COCOON 1998: 213-218 |
| 1997 |
|---|
| 9 | | Kuo-Hui Tsai,
Da-Wei Wang:
Optimal Algorithms for Circle Partitioning.
COCOON 1997: 304-310 |
| 8 | | Kuo-Hui Tsai,
D. T. Lee:
k Best Cuts for Circular-Arc Graphs.
Algorithmica 18(2): 198-216 (1997) |
| 7 | | Jan-Ming Ho,
De-Ron Liang,
Kuo-Hui Tsai:
On Multicast Routing in Clos Networks.
J. Inf. Sci. Eng. 13(3): 417-429 (1997) |
| 1996 |
|---|
| 6 | | Tsan-sheng Hsu,
Kuo-Hui Tsai,
Da-Wei Wang,
D. T. Lee:
Steiner Problems on Directed Acyclic Graphs.
COCOON 1996: 21-30 |
| 5 | | Jan-Ming Ho,
De-Ron Liang,
Kuo-Hui Tsai:
On multicast routing in Clos networks.
ISPAN 1996: 394-400 |
| 1994 |
|---|
| 4 | | Kuo-Hui Tsai,
D. T. Lee:
k-Best Cuts for Circular-Arc Graphs.
ISAAC 1994: 550-558 |
| 1993 |
|---|
| 3 | | Kuo-Hui Tsai,
Wen-Lian Hsu:
Fast Algorithms for the Dominating Set Problem on Permutation Graphs.
Algorithmica 9(6): 601-614 (1993) |
| 1991 |
|---|
| 2 | | Wen-Lian Hsu,
Kuo-Hui Tsai:
Linear Time Algorithms on Circular-Arc Graphs.
Inf. Process. Lett. 40(3): 123-129 (1991) |
| 1990 |
|---|
| 1 | | Kuo-Hui Tsai,
Wen-Lian Hsu:
Fast Algorithms for the Dominating Set Problem on Permutation Graphs.
SIGAL International Symposium on Algorithms 1990: 109-117 |
