Finding a Maximum Matching in a Circular-Arc Graph. - Y. Daniel Liang; Chongkye Rhee (Inf. Process. Lett., 1993)

Linear Algorithms for Two Independent Set Problems in Permutation Graphs. - Y. Daniel Liang; Chongkye Rhee (ACM Conference on Computer Science, 1994)

An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs. - Y. Daniel Liang; Chongkye Rhee (ACM Conference on Computer Science, 1995)

Finding a Maximum Matching in a Permutation Graph. - Chongkye Rhee; Y. Daniel Liang (Acta Informatica, 1995)

Finding Biconnected Components in O(n) Time for a Class of Graphs. - Y. Daniel Liang; Chongkye Rhee (Inf. Process. Lett., 1996)

An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application. - Chongkye Rhee; Y. Daniel Liang (Inf. Process. Lett., 1996)

On the Chromatic Index of Graphs with 2m + 1 Vertices and 2m2 Edges. - Chongkye Rhee (Inf. Process. Lett., 1998)