| 1996 |
|---|
| 5 | | Chong Jye Rhee,
Y. Daniel Liang,
Sudarshan K. Dhall,
S. Lakshmivarahan:
An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph.
SIAM J. Comput. 25(2): 404-419 (1996) |
| 1995 |
|---|
| 4 | | Chong Jye Rhee,
Sudarshan K. Dhall,
S. Lakshmivarahan:
The Minimum Weight Dominating Set Problem for Permutation Graphs Is in NC.
J. Parallel Distrib. Comput. 28(2): 109-112 (1995) |
| 1994 |
|---|
| 3 | | Chong Jye Rhee,
Y. Daniel Liang,
Sudarshan K. Dhall,
S. Lakshmivarahan:
Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs.
Inf. Process. Lett. 49(1): 45-50 (1994) |
| 1991 |
|---|
| 2 | | Y. Daniel Liang,
Chong Jye Rhee,
Sudarshan K. Dhall,
S. Lakshmivarahan:
A New Approach for the Domination Problem on Permutation Graphs.
Inf. Process. Lett. 37(4): 219-224 (1991) |
| 1990 |
|---|
| 1 | EE | Chong Jye Rhee,
Sudarshan K. Dhall,
S. Lakshmivarahan:
An Optimal Parallel Algorithm for the Maximal Element Problem (Abstract).
ACM Conference on Computer Science 1990: 435 |
