| |
| 1998 | ||
|---|---|---|
| 7 | EE | Chongkye Rhee: On the Chromatic Index of Graphs with 2m + 1 Vertices and 2m2 Edges. Inf. Process. Lett. 66(3): 115-118 (1998) |
| 1996 | ||
| 6 | EE | Chongkye Rhee, Y. Daniel Liang: An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application. Inf. Process. Lett. 57(5): 287-290 (1996) |
| 5 | EE | Y. Daniel Liang, Chongkye Rhee: Finding Biconnected Components in O(n) Time for a Class of Graphs. Inf. Process. Lett. 60(3): 159-163 (1996) |
| 1995 | ||
| 4 | EE | Y. Daniel Liang, Chongkye Rhee: An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs. ACM Conference on Computer Science 1995: 104-108 |
| 3 | Chongkye Rhee, Y. Daniel Liang: Finding a Maximum Matching in a Permutation Graph Acta Inf. 32(8): 779-792 (1995) | |
| 1994 | ||
| 2 | EE | Y. Daniel Liang, Chongkye Rhee: Linear Algorithms for Two Independent Set Problems in Permutation Graphs. ACM Conference on Computer Science 1994: 90-93 |
| 1993 | ||
| 1 | Y. Daniel Liang, Chongkye Rhee: Finding a Maximum Matching in a Circular-Arc Graph. Inf. Process. Lett. 45(4): 185-190 (1993) | |
| 1 | Y. Daniel Liang | [1] [2] [3] [4] [5] [6] |