Nagamochi, Hiroshi; Nakao, Yoshitaka; Ibaraki, Toshihide A fast algorithm for cactus representations of minimum cuts. (English) Zbl 1306.90165 Japan J. Ind. Appl. Math. 17, No. 2, 245-264 (2000). MSC: 90C35 05C85 PDFBibTeX XMLCite \textit{H. Nagamochi} et al., Japan J. Ind. Appl. Math. 17, No. 2, 245--264 (2000; Zbl 1306.90165) Full Text: DOI
Nagamochi, Hiroshi; Ibaraki, Toshihide An approximation of the minimum vertex cover in a graph. (English) Zbl 1306.05193 Japan J. Ind. Appl. Math. 16, No. 3, 369-375 (1999). MSC: 05C70 05C35 05C85 PDFBibTeX XMLCite \textit{H. Nagamochi} and \textit{T. Ibaraki}, Japan J. Ind. Appl. Math. 16, No. 3, 369--375 (1999; Zbl 1306.05193) Full Text: DOI
Nagamochi, Hiroshi; Ibaraki, Toshihide A linear time algorithm for computing 3-edge-connected components in a multigraph. (English) Zbl 0761.05089 Japan J. Ind. Appl. Math. 9, No. 2, 163-180 (1992). Reviewer: B.K.Dass (Delhi) MSC: 05C85 05C40 PDFBibTeX XMLCite \textit{H. Nagamochi} and \textit{T. Ibaraki}, Japan J. Ind. Appl. Math. 9, No. 2, 163--180 (1992; Zbl 0761.05089) Full Text: DOI
Fukushima, Masao; Takazawa, Keiichi; Ohsaki, Shuichi; Ibaraki, Toshihide Successive linearization methods for large-scale nonlinear programming problems. (English) Zbl 0773.90067 Japan J. Ind. Appl. Math. 9, No. 1, 117-132 (1992). Reviewer: M.Gaviano (Cagliari) MSC: 90C30 90-08 PDFBibTeX XMLCite \textit{M. Fukushima} et al., Japan J. Ind. Appl. Math. 9, No. 1, 117--132 (1992; Zbl 0773.90067) Full Text: DOI
Namikawa, Kenji; Ibaraki, Toshihide An algorithm for the fair resource allocation problem with a submodular constraint. (English) Zbl 0747.90070 Japan J. Ind. Appl. Math. 8, No. 3, 377-387 (1991). Reviewer: J.Terno (Dresden) MSC: 90C10 91B32 90C60 90C27 90-08 PDFBibTeX XMLCite \textit{K. Namikawa} and \textit{T. Ibaraki}, Japan J. Ind. Appl. Math. 8, No. 3, 377--387 (1991; Zbl 0747.90070) Full Text: DOI