| 2005 |
|---|
| 5 | EE | Fang-Rong Hsu,
M. K. Shan,
H. S. Chao,
Richard C. T. Lee:
Some Optimal Parallel Algorithms on Interval and Circular-arc Graphs.
J. Inf. Sci. Eng. 21(3): 627-642 (2005) |
| 2000 |
|---|
| 4 | | H. S. Chao,
Fang-Rong Hsu,
Richard C. T. Lee:
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs.
Discrete Applied Mathematics 102(3): 159-173 (2000) |
| 1998 |
|---|
| 3 | EE | H. S. Chao,
Fang-Rong Hsu,
Richard C. T. Lee:
An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs.
COCOON 1998: 309-318 |
| 1997 |
|---|
| 2 | EE | H. S. Chao,
Fang-Rong Hsu,
Richard C. T. Lee:
An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs.
Inf. Process. Lett. 61(6): 311-316 (1997) |
| 1993 |
|---|
| 1 | | D. P. Wang,
N. F. Huang,
H. S. Chao,
Richard C. T. Lee:
Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications.
ISAAC 1993: 515-522 |
