Graph Algorithms

• T. Asano, H. Imai, and A. Mukaiyama: A Faster Algorithm for Finding a Maximum Weight Independent Set of a Circle Graph, IPSJ SIG Notes 89-AL-5-18, IPSJ, Jan. 1989. Abstract
• H. Imai: Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane, Information Processing Letters, Vol. 15, No. 3, pp. 125-128, Oct. 1982. Abstract
• H. Imai and T. Asano: Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane, Journal of Algorithms, Vol. 4, pp. 310-323, 1983. Abstract
• H. Imai and T. Asano: An Efficient Algorithm for Finding a Maximum Matching of an Intersection Graph of Horizontal and Vertical Line Segments, Paper of Technical Group on Circuit and Systems CAS83-143, Institute of Electronics and Communication Engineers of Japan, Nov. 1983. Abstract
• H. Imai and T. Asano: Applications of the Priority Search Tree to Circle Graph Problems, in Proceedings of 1986 Joint Technical Conference on Circuits and Systems, pp. 113-119, Seoul, Oct. 1986, KIEE and IECEJ. Abstract