-
[文献書誌] 永持,牧野,曽,村田,茨木: "初等的フローゲームの凸性について" 電子情報通信学会論文誌. J81-D-I. 666-676 (1998)
-
[文献書誌] A.Frank,T.Ibaraki,H.Nagamochi: "Two Arc-Disjoint Paths in Eularian Digraphs" SIAM J.Dicrete Mathematics. 11. 557-589 (1998)
-
[文献書誌] T.Ibaraki,A.Karzanov,H.Nagamochi: "A Fast Algorithm for Finding a Maximum Free Multiflow in an Inner Eulerian Network and Some Generalizations" Combinatorica. 18. 61-83 (1998)
-
[文献書誌] H.Nagamochi,T.Ibaraki: "A Note on Minimizing Submodular Functions" Information Processing Letters. 67. 239-244 (1998)
-
[文献書誌] T.Ishii,H.Nagamochi,T.Ibaraki: "Optimal Augmentation of a Biconnected Graph to nk-Edge-Connected an Tri-Conne grup〓" Proc.9th ACM-SIAM Symp.on Discrete Algorithms. 280-289 (1998)
-
[文献書誌] T.Hasunuma,H.Nagamochi: "Independent Spanning Trees with Small Depths in Iterated Line Digraphs" Australian Computer Science Communications,Computing Theory. 20. 21-35 (1998)
-
[文献書誌] H.Nagamochi,P.Eades: "Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs" Lecture Notes in Computer Science. 1412. 96-111 (1998)
-
[文献書誌] Y.Karuno,H.Nagamochi,T.Ibaraki: "A 1.5-Approxination for Single-Vehicle Scheduling Problem on a Line with Release and Handling Times" Proc.Japan-U.S.A.Symp.on Flexible Automation. 1363-1366 (1998)
-
[文献書誌] T.Ishii,H.Nagamochi,T.Ibaraki: "k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph" Lecture Notes in Computer Science. 1533. 159-168 (1998)
-
[文献書誌] H.Nagamochi,T.Ibaraki: "Polyhedral Structure of Submodular and Posi-modular Systems" Lecture Notes in Computer Science. 1533. 169-178 (1998)
-
[文献書誌] H.Nagamochi,T.Hasunuma: "An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate" Lecture Notes in Computer Science. 1533. 447-456 (1998)
-
[文献書誌] H.Nagamochi,T.Ibaraki: "A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts" Lecture Note in Computer Science,IPC099. (発表予定). (1999)
-
[文献書誌] H.Nagamochi,T.Ibaraki: "Augmenting Edge-Connectivity over the Entite Range in O(nm) Time" J.Algorithms. 30. 253-301 (1999)
-
[文献書誌] H.Nagamochi,T.Ibaraki: "An Approximation of the Minimum Vertex Cover in a Graph" J.Japan Society for Industrial and Applied Math.(掲載予定). (1999)
-
[文献書誌] 岩野和生,加藤直樹,永持 仁: "アルゴリズム入門-設計と解析-(Computer Algorithms,sara Baaseの訳書)" アジソン・ウエスレイ社, 439 (1998)