N.Chiba, T.Nishizeki, The Hamiltonian Cycle Problem Is Linear-Time Solvable for 4-Connected, Planar Graphs Journal of Algorithms 10, pp.187-211, 1989

N.Chiba, T.Nishizeki, A Theorem on Paths in Planar Graphs, Journal of Graph Theory, Vol.10, pp.449-450, 1986

N.Chiba, T.Nishizeki, Arboricity and Subgraph Listing Algorithms, Siam J. Comput, Vol.14, No.1, pp.210-223, 1985

N.Chiba, K,Onoguchi, T.Nishizeki, Drawing Plane Graphs Nicely,Acta Informatica 22, pp.187-201, 1985

N.Chiba, T.Nishizeki, A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees, The Journal of Computer and System Science, Vol.30, No.1, pp.54-76 1985

N.Chiba, T.Yamanouchi and T.Nishizeki, Linear Algorithms for Convex Drawings of Planar Graphs, Progress in Graph Theory, pp.153-173, 1984

N.Chiba, T.Nishizeki, Embedding Planar Graphs Using PQ-Tree Algorithms, Electronics and Communications in Japan, Vol.67-A, No.7, pp.12-20, 1984

N.Chiba, T.Nishizeki, Embedding Planar Graphs Using PQ-Tree Algorithms, Electronics and Communications in Japan, Vol.67-A, No.2, pp.87-94,1984(in Japanese) PQ-木を用いた平面グラフ埋込みアルゴリズムについて

N.Chiba, T.Nishizeki and N.Saito,  An Algorithm for Finding a Large Independent Set in Planar Graphs, Networks, Vol.13, pp.247-252, 1983

N.Chiba, T.Nishizeki and N.Saito,  An Approximation Algorithm for The Maximum Independent set Problem on Planar, Graphs Siam J. Comput, Vol.11, No4, pp.663-675, 1982

N.Chiba, T.Nishizeki and N.Saito,  Efficient Algorithms for Graph Alterations, Systems Computers Controls, Vol.12, No.5, pp.72-78, 1981

N.Chiba, T.Nishizeki and N.Saito,  Efficient Algorithms for Graph Alterations, The Transactions of IEICE, Vol.J64-D, No10, pp.934-939, 1981

N.Chiba, T.Nishizeki and N.Saito,  A Linear 5-Coloring Algorithm of Planar Graphs, The Journal of Algorithms 2, pp.317-327, 1981

N.Chiba, T.Nishizeki and N.Saito,  Applications of the Lipton and Tarjan’s Planar Separator Theorem, Journal of Information Processing,Vol.4, No.4, pp.203-207, 1981