| |
| 1992 | ||
|---|---|---|
| 5 | Kim-Heng Teo, Tai-Ching Tuan: An Efficient One-Side Height Minimization Algorithm for Routing Around a Rectangle. Inf. Process. Lett. 44(2): 101-105 (1992) | |
| 1991 | ||
| 4 | Kim-Heng Teo, Tai-Ching Tuan: A Tight Upper Bound for the Number of Intersections Between two Rectangular Paths. BIT 31(4): 598-606 (1991) | |
| 3 | EE | Tai-Ching Tuan, Kim-Heng Teo: On river routing with minimum number of jogs. IEEE Trans. on CAD of Integrated Circuits and Systems 10(2): 271-273 (1991) |
| 2 | Kim-Heng Teo, Tai-Ching Tuan: An Improved Upper Bound on the Number of Intersections Between Two Rectangular Paths. Inf. Process. Lett. 37(6): 305-309 (1991) | |
| 1990 | ||
| 1 | Kim-Heng Teo, Tai-Ching Tuan: Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing. Inf. Process. Lett. 36(3): 167-170 (1990) | |
| 1 | Tai-Ching Tuan | [1] [2] [3] [4] [5] |