1. T. Asano, An faster algorithm for finding a maximum weight clique of a circular-arc graph, Technical Report of Institut für Operations Research, Universität Bonn, 90624-OR, 1990.
2. J.L. Bentley, Decomposable searching problems, Information Processing Letters, 8 (1979), pp. 244–251.
3. A.A. Bertossi and S. Moretti, Parallel algorithms on circular-arc graphs Information Processing Letters, 33 (1989/1990), pp. 275–281.
4. W.-L. Hsn, Maximum weight clique algorithms for circular-arc graphs and circle graphs, SIAM Journal on Computing, 14 (1985), pp. 224–231.
5. T. Kaji and A. Ohuchi, Optimal sequential partitions of graphs by branch and bound, Technical Report 90-AL-10, Information Processing Society of Japan, 1990.