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.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2005

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

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2005

1998

An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs.

[BibT_eX]

[DOI]

H. S. Chao

Fang-Rong Hsu

Richard C. T. Lee

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

H. S. Chao

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...