1. T. Ishii, H. Nagamochi and T. Ibaraki, Augmenting edge and vertex connectivities simultaneously, Lecture Notes in Computer Science, 1350, the Proceedings of Algorithms and Computation, 8th International Symposium, ISAAC'97 Singapore, December 17-19, 1997 pp. 102-111.

2. T. Ishii, H. Nagamochi and T. Ibaraki, Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph, Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California January 1998 pp.280-289.

3. T. Ishii, H. Nagamochi and T. Ibaraki, k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph, Lecture Notes in Computer Science 1533, the Proceedings of Algorithms and Computation, 9th International Symposium, ISAAC'98 Taejon, Korea, December 14-16, 1998 pp.159-168.

4. T. Ishii, H. Nagamochi and T. Ibaraki, Augmenting an (l-1)-vertex-connected multigraph to a k-edge-connected and l-vertex-connected multigraph, Lecture Notes in Computer Science, Springer-Verlag, vol. 1643, 7th Annual European Symposium on Algorithms, July 16-18, Prague, Czech Republic, 1999, pp.414-425.

5. T. Ishii, H. Nagamochi and T. Ibaraki, Optimal augmentation of a 2-vertex-connected multigraph to a $k$-edge-connected and 3-vertex-connected multigraph, J. Combinatorial Optimization, Vol.4, 2000, pp.35-78.

6. H. Nagamochi, T. Ishii and T. Ibaraki, A simple proof of a minimum cut algorithm and its applications, Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals, vol.E82-A, no.10, Oct. 1999, pp.2231-2236.