Ito, Hiro; Nagamochi, Hiroshi Two equivalent measures on weighted hypergraphs. (English) Zbl 1108.05067 Discrete Appl. Math. 154, No. 16, 2330-2334 (2006). Reviewer: Péter L. Erdős (Budapest) MSC: 05C65 PDFBibTeX XMLCite \textit{H. Ito} and \textit{H. Nagamochi}, Discrete Appl. Math. 154, No. 16, 2330--2334 (2006; Zbl 1108.05067) Full Text: DOI
Ito, Hiro; Nagamochi, Hiroshi Comparing hypergraphs by areas of hyperedges drawn on a convex polygon. (English) Zbl 1179.05079 Akiyama, Jin (ed.) et al., Discrete and computational geometry. Japanese conference, JCDCG 2002, Tokyo, Japan, December 6–9, 2002. Revised papers. Berlin: Springer (ISBN 3-540-20776-7/pbk). Lect. Notes Comput. Sci. 2866, 176-181 (2003). MSC: 05C65 52B05 PDFBibTeX XMLCite \textit{H. Ito} and \textit{H. Nagamochi}, Lect. Notes Comput. Sci. 2866, 176--181 (2003; Zbl 1179.05079) Full Text: DOI
Ito, Hiro; Nagamochi, Hiroshi; Sugiyama, Yosuke; Fujita, Masato File transfer tree problems. (English) Zbl 1019.68078 Bose, Prosenjit (ed.) et al., Algorithms and computation. 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2518, 441-452 (2002). MSC: 68R10 68W05 68Q17 PDFBibTeX XMLCite \textit{H. Ito} et al., Lect. Notes Comput. Sci. 2518, 441--452 (2002; Zbl 1019.68078) Full Text: Link
Nagamochi, Hiroshi; Ishii, Toshimasa; Ito, Hiro Minimum cost source location problem with vertex-connectivity requirements in digraphs. (English) Zbl 1003.68110 Inf. Process. Lett. 80, No. 6, 287-293 (2001). MSC: 68R10 05C35 05C85 05C20 PDFBibTeX XMLCite \textit{H. Nagamochi} et al., Inf. Process. Lett. 80, No. 6, 287--293 (2001; Zbl 1003.68110) Full Text: DOI
Ito, Hiro; Nagamochi, Hiroshi A tournament representation of the scissors, paper, and stone game and meaningful extensions. (Japanese) Zbl 0941.05505 RIMS Kokyuroku 906, 14-23 (1995). MSC: 05C20 PDFBibTeX XMLCite \textit{H. Ito} and \textit{H. Nagamochi}, RIMS Kokyuroku 906, 14--23 (1995; Zbl 0941.05505)