Kim-Heng Teo

According to our database, Kim-Heng Teo authored at least 5 papers between 1990 and 1992.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1992

An Efficient One-Side Height Minimization Algorithm for Routing Around a Rectangle.

Kim-Heng Teo, Tai-Ching Tuan

Inf. Process. Lett., 1992

1991

On river routing with minimum number of jogs.

Tai-Ching Tuan, Kim-Heng Teo

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1991

An Improved Upper Bound on the Number of Intersections Between Two Rectangular Paths.

Kim-Heng Teo, Tai-Ching Tuan

Inf. Process. Lett., 1991

A Tight Upper Bound for the Number of Intersections Between two Rectangular Paths.

Kim-Heng Teo, Tai-Ching Tuan

BIT, 1991

1990

Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing.

Kim-Heng Teo, Tai-Ching Tuan

Inf. Process. Lett., 1990