H. S. Chao

According to our database, H. S. Chao authored at least 4 papers between 1993 and 2005.

Collaborative distances:

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

2005

Some Optimal Parallel Algorithms on Interval and Circular-arc Graphs.

Fang-Rong Hsu, Man-Kwan Shan, H. S. Chao, Richard C. T. Lee

J. Inf. Sci. Eng., 2005

2000

An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs.

H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee

Discret. Appl. Math., 2000

1997

An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs.

H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee

Inf. Process. Lett., 1997

1993

Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications.

D. P. Wang, N. F. Huang, H. S. Chao, Richard C. T. Lee

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993