1. K. Takamizawa, T. Nishizeki and N. Saito, "Linear-time computability of combinatorial problems on series-parallel graphs", J. ACM, 29, 3, pp. 621-641, 1982.

2. M. Ito, A. Saito and T. Nishizeki, "Multiple assignment scheme for sharing secret", J. Cryptology, 6, pp.15-20, 1993.

3. T. Nishizeki and Md. Saidur Rahman, Planar Graph Drawing, World Scientific Pub., 295 pages, 2004.