An O(n2) Algorithm for Finding the Compact Sets of a Graph. - Chiou-Kuo Liang (BIT, 1993)

A Different Approach for Solving the Specified Diameter Partition Problem. - Chiou-Kuo Liang; Chuan Yi Tang; Richard C. T. Lee (J. Inf. Sci. Eng., 1993)

An Algorithm for Finding the Compact Sets in the Plane. - Si-Tang Cheng; Chiou-Kuo Liang (ACM Conference on Computer Science, 1994)