Combinatorial Optimization: Network Flow

• H. Imai: State-of-the-Art Survey of Network Flow Theory, in Proceedings of the 3rd Mathematical Symposium of Japan, pp. 31-44, Oct. 1982, (In Japanese). Abstract
• H. Imai: On the Practical Efficiency of Various Maximum Flow Algorithms, Journal of the Operations Research Society of Japan, Vol. 26, No. 1, pp. 61-82, Mar. 1983. Abstract
• H. Imai: Network-Flow Algorithms for Lower-Truncated Transversal Polymatroids, Journal of the Operations Research Society of Japan, Vol. 26, No. 3, pp. 186-210, Sept. 1983. Abstract
• H. Imai: Notes on the One-Dimensional Compaction Problem of LSI Layouts Viewed from Network Flow Theory and Algorithms, Transactions of the Institute of Electronics and Communication Engineers of Japan, Vol. E69, No. 10, pp. 1080-1083, Oct. 1986. Abstract
• H. Imai: A Note on Implementing Interior Methods for Planar Minimum Cost Flow Problem, IPSJ SIG Notes 89-AL-9-1, IPSJ, July 1989. Abstract
• H. Imai and K. Iwano: Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow, in T. Asano, T. Ibaraki, H. Imai, and T. Nishizeki, eds.,Proceedings of the SIGAL International Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 450, pp. 21-30, Heidelberg, 1990, Springer-Verlag. Abstract