dblp.uni-trier.dewww.uni-trier.de

Hiroshi Nagamochi Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
151EEHiroshi Nagamochi: Cop-Robber Guarding Game with Cycle Robber Region. FAW 2009: 74-84
150EEKazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi: Bipartite Graph Representation of Multiple Decision Table Classifiers. SAGA 2009: 46-60
149EESeigo Karakawa, Ehab Morsy, Hiroshi Nagamochi: Minmax Tree Cover in the Euclidean Space. WALCOM 2009: 202-213
148EETakuro Fukunaga, Hiroshi Nagamochi: Network Design with Weighted Degree Constraints. WALCOM 2009: 214-225
147EEHiroshi Nagamochi: A Detachment Algorithm for Inferring a Graph from Path Frequency. Algorithmica 53(2): 207-224 (2009)
146EETakuro Fukunaga, Hiroshi Nagamochi: Eulerian detachments with local edge-connectivity. Discrete Applied Mathematics 157(4): 691-698 (2009)
145EEMitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi: Exact algorithms for the two-dimensional strip packing problem with and without rotations. European Journal of Operational Research 198(1): 73-83 (2009)
144EEAkifumi Kawaguchi, Hiroshi Nagamochi: Drawing slicing graphs with face areas. Theor. Comput. Sci. 410(11): 1061-1072 (2009)
2008
143EESeok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings Springer 2008
142EESeok-Hee Hong, Hiroshi Nagamochi: Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. COCOON 2008: 405-414
141EEEhab Morsy, Hiroshi Nagamochi: Approximating the Generalized Capacitated Tree-Routing Problem. COCOON 2008: 621-630
140EETakashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi: Removing Node Overlaps Using Multi-sphere Scheme. Graph Drawing 2008: 296-301
139EESeok-Hee Hong, Hiroshi Nagamochi: Approximating Crossing Minimization in Radial Layouts. LATIN 2008: 461-472
138EETakuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi: Robust cost colorings. SODA 2008: 1204-1212
137EESeok-Hee Hong, Hiroshi Nagamochi: Convex drawings of graphs with non-convex boundary constraints. Discrete Applied Mathematics 156(12): 2368-2380 (2008)
136EETakashi Imamichi, Hiroshi Nagamochi: Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning. IEICE Transactions 91-A(9): 2308-2313 (2008)
135EEYoshitaka Nakao, Hiroshi Nagamochi: Worst Case Analysis for Pickup and Delivery Problems with Transfer. IEICE Transactions 91-A(9): 2328-2334 (2008)
134EEEhab Morsy, Hiroshi Nagamochi: An improved approximation algorithm for capacitated multicast routings in networks. Theor. Comput. Sci. 390(1): 81-91 (2008)
133EEHiroshi Nagamochi, Takaharu Ohnishi: Approximating a vehicle scheduling problem with time windows and handling times. Theor. Comput. Sci. 393(1-3): 133-146 (2008)
2007
132EEMorihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi: A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs. APBC 2007: 257-266
131 Liang Zhao, A. Shimae, Hiroshi Nagamochi: Linear-tree rule structure for firewall optimization. Communications, Internet, and Information Technology 2007: 67-72
130EETakuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi: "Rent-or-Buy" Scheduling and Cost Coloring Problems. FSTTCS 2007: 84-95
129EEKazuya Haraguchi, Hiroshi Nagamochi: Extension of ICF Classifiers to Real World Data Sets. IEA/AIE 2007: 776-785
128EETakuro Fukunaga, Hiroshi Nagamochi: The Set Connector Problem in Graphs. IPCO 2007: 484-498
127EEHiroshi Nagamochi: Minimum Degree Orderings. ISAAC 2007: 17-28
126EEEhab Morsy, Hiroshi Nagamochi: Approximation to the Minimum Cost Edge Installation Problem. ISAAC 2007: 292-303
125EEMutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover: A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. SLS 2007: 121-135
124EETakashi Imamichi, Hiroshi Nagamochi: A Multi-sphere Scheme for 2D and 3D Packing Problems. SLS 2007: 207-211
123EEEhab Morsy, Hiroshi Nagamochi: Approximating Capacitated Tree-Routings in Networks. TAMC 2007: 342-353
122EEJiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu: An Efficient Algorithm for Generating Colored Outerplanar Graphs. TAMC 2007: 573-583
121EEAkifumi Kawaguchi, Hiroshi Nagamochi: Orthogonal Drawings for Plane Graphs with Specified Face Areas. TAMC 2007: 584-594
120EEToshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi: Bisecting a 4-connected graph with three resource sets. Discrete Applied Mathematics 155(11): 1441-1450 (2007)
119EEToshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi: The source location problem with local 3-vertex-connectivity requirements. Discrete Applied Mathematics 155(18): 2523-2538 (2007)
118EEHiroshi Nagamochi, Yuusuke Abe: An approximation algorithm for dissecting a rectangle into rectangles with specified areas. Discrete Applied Mathematics 155(4): 523-537 (2007)
117EEHiroshi Nagamochi, Katsutoshi Kuroya: Drawing c-planar biconnected clustered graphs. Discrete Applied Mathematics 155(9): 1155-1174 (2007)
116EETakuro Fukunaga, Hiroshi Nagamochi: Generalizing the induced matching by edge capacity constraints. Discrete Optimization 4(2): 198-205 (2007)
115EEEhab Morsy, Hiroshi Nagamochi: Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. IEICE Transactions 90-A(5): 900-906 (2007)
114EEKouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine: Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks. IEICE Transactions 90-B(9): 2524-2531 (2007)
113EEHiroshi Nagamochi: Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex. IEICE Transactions 90-D(2): 428-431 (2007)
112EETakuro Fukunaga, Hiroshi Nagamochi: Approximating a Generalization of Metric TSP. IEICE Transactions 90-D(2): 432-439 (2007)
111EEHiroshi Nagamochi, Yoko Kamidoi: Minimum cost subpartitions in graphs. Inf. Process. Lett. 102(2-3): 79-84 (2007)
110EEHiroshi Nagamochi, Kohei Okada: Approximating the minmax rooted-tree cover in a tree. Inf. Process. Lett. 104(5): 173-178 (2007)
109EEYoko Kamidoi, Noriyoshi Yoshida, Hiroshi Nagamochi: A Deterministic Algorithm for Finding All Minimum k-Way Cuts. SIAM J. Comput. 36(5): 1329-1341 (2007)
108EEToshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi: Minimum cost source location problem with local 3-vertex-connectivity requirements. Theor. Comput. Sci. 372(1): 81-93 (2007)
107EEAndré Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh: Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci. 385(1-3): 202-213 (2007)
2006
106EEHiroshi Nagamochi: A Detachment Algorithm for Inferring a Graph from Path Frequency. COCOON 2006: 274-283
105EEMariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige: Minimum Transversals in Posi-modular Systems. ESA 2006: 576-587
104EEKouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine: Contention-Free l-Planes in Optically Burst-Switched WDM Networks. GLOBECOM 2006
103EETakuro Fukunaga, Hiroshi Nagamochi: Network Design with Edge-Connectivity and Degree Constraints. WAOA 2006: 188-201
102EESeok-Hee Hong, Hiroshi Nagamochi: Convex Drawings of Graphs with Non-convex Boundary. WG 2006: 113-124
101EEPeter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Algorithmica 44(1): 1-32 (2006)
100EEToshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. Algorithmica 44(3): 257-280 (2006)
99EEHiro Ito, Hiroshi Nagamochi: Two equivalent measures on weighted hypergraphs. Discrete Applied Mathematics 154(16): 2330-2334 (2006)
98EEHiroshi Nagamochi: Sparse connectivity certificates via MA orderings in graphs. Discrete Applied Mathematics 154(16): 2411-2417 (2006)
97EEHiroshi Nagamochi, Taizo Kawada: Minmax subtree cover problem on cacti. Discrete Applied Mathematics 154(8): 1254-1263 (2006)
96EEToshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi: Augmenting forests to meet odd diameter requirements. Discrete Optimization 3(2): 154-164 (2006)
95EETakuro Fukunaga, Hiroshi Nagamochi: Some Theorems on Detachments Preserving Local-Edge-Connectivity. Electronic Notes in Discrete Mathematics 24: 173-180 (2006)
94EEHiroshi Nagamochi: A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs. IEICE Transactions 89-A(5): 1263-1268 (2006)
93EEHiroshi Nagamochi: Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs. IEICE Transactions 89-D(2): 744-750 (2006)
92EEHiroshi Nagamochi: Packing Soft Rectangles. Int. J. Found. Comput. Sci. 17(5): 1165-1178 (2006)
2005
91EEToshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi: Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. CATS 2005: 97-105
90EETakuro Fukunaga, Hiroshi Nagamochi: Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems. COCOON 2005: 747-756
89EEToshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi: Bisecting a Four-Connected Graph with Three Resource Sets. ISAAC 2005: 176-185
88EEHiroshi Nagamochi: An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings. Discrete & Computational Geometry 33(4): 569-591 (2005)
87EEHiroshi Nagamochi: Packing Unit Squares in a Rectangle. Electr. J. Comb. 12: (2005)
86EEHiroshi Nagamochi: Approximating the Minmax Rooted-Subtree Cover Problem. IEICE Transactions 88-A(5): 1335-1338 (2005)
85EEHiroshi Nagamochi: On 2-Approximation to the Vertex-Connectivity in Graphs. IEICE Transactions 88-D(1): 12-16 (2005)
84EEHiroshi Nagamochi: On computing minimum (s, t)-cuts in digraphs. Inf. Process. Lett. 93(5): 231-237 (2005)
83EEHiroshi Nagamochi: A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph. J. Algorithms 56(2): 77-95 (2005)
82EELiang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: Greedy splitting algorithms for approximating multiway partition problems. Math. Program. 102(1): 167-183 (2005)
81EEHiroshi Nagamochi: On the one-sided crossing minimization in a bipartite graph with large degrees. Theor. Comput. Sci. 332(1-3): 417-446 (2005)
80EEHiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii: A robust algorithm for bisecting a triconnected graph with two resource sets. Theor. Comput. Sci. 341(1-3): 364-378 (2005)
2004
79EEHiroshi Nagamochi, Taizo Kawada: Approximating the Minmax Subtree Cover Problem in a Cactus. ISAAC 2004: 705-716
78EEHiroshi Nagamochi, Kohei Okada: A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. Discrete Applied Mathematics 140(1-3): 103-114 (2004)
77EELiang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: On generalized greedy splitting algorithms for multiway partition problems. Discrete Applied Mathematics 143(1-3): 130-143 (2004)
76EEHiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii: A simple recognition of maximal planar graphs. Inf. Process. Lett. 89(5): 223-226 (2004)
75EEHiroshi Nagamochi, Nobuyasu Yamada: Counting edge crossings in a 2-layered drawing. Inf. Process. Lett. 91(5): 221-225 (2004)
74EEYoshiyuki Karuno, Hiroshi Nagamochi: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. Theor. Comput. Sci. 312(2-3): 267-280 (2004)
2003
73EEHiroshi Nagamochi, Katsutoshi Kuroya: Convex Drawing for c-Planar Biconnected Clustered Graphs. Graph Drawing 2003: 369-380
72EEHiroshi Nagamochi: An Improved Approximation to the One-Sided Bilayer Drawing. Graph Drawing 2003: 406-418
71EEHiroshi Nagamochi, Kohei Okada: Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. ISAAC 2003: 138-147
70EEHiroshi Nagamochi, Yuusuke Abe: An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas. ISAAC 2003: 280-289
69EEYoshiyuki Karuno, Hiroshi Nagamochi: A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags. ISAAC 2003: 309-318
68EEToshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi: Augmenting Forests to Meet Odd Diameter Requirements. ISAAC 2003: 434-443
67 Hiroshi Nagamochi: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Discrete Applied Mathematics 126(1): 83-113 (2003)
66 Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. Discrete Applied Mathematics 126(2-3): 275-289 (2003)
65EEYoshiyuki Karuno, Hiroshi Nagamochi: 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Discrete Applied Mathematics 129(2-3): 433-447 (2003)
64EEHiroshi Nagamochi, Toshimasa Ishii: On the minimum local-vertex-connectivity augmentation in graphs. Discrete Applied Mathematics 129(2-3): 475-486 (2003)
63EEToshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi: Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs. Electr. Notes Theor. Comput. Sci. 78: (2003)
62EELiang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. Inf. Process. Lett. 86(2): 63-70 (2003)
61EEHiroshi Nagamochi, Peter Eades: An Edge-Splitting Algorithm in Planar Graphs. J. Comb. Optim. 7(2): 137-159 (2003)
2002
60EEYoshiyuki Karuno, Hiroshi Nagamochi: A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage. ISAAC 2002: 199-210
59EEHiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita: File Transfer Tree Problems. ISAAC 2002: 441-452
58EEHiro Ito, Hiroshi Nagamochi: Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. JCDCG 2002: 176-181
57EEHiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki: Convex Embeddings and Bisections of 3-Connected Graphs 1. Combinatorica 22(4): 537-554 (2002)
56 Toshihiro Fujito, Hiroshi Nagamochi: A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Applied Mathematics 118(3): 199-207 (2002)
55 Hiroshi Nagamochi, Toshihide Ibaraki: Graph connectivity and its augmentation: applications of MA orderings. Discrete Applied Mathematics 123(1-3): 447-472 (2002)
54EEYoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks 39(4): 203-209 (2002)
2001
53EEYoshiyuki Karuno, Hiroshi Nagamochi: A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. ESA 2001: 218-229
52EEHiroshi Nagamochi, Toshimasa Ishii: On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. ISAAC 2001: 124-135
51EEYoshiyuki Karuno, Hiroshi Nagamochi: A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. ISAAC 2001: 36-47
50EELiang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: A Unified Framework for Approximating Multiway Partition Problems. ISAAC 2001: 682-694
49EELiang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. STACS 2001: 478-489
48 Toru Hasunuma, Hiroshi Nagamochi: Independent spanning trees with small depths in iterated line digraphs. Discrete Applied Mathematics 110(2-3): 189-211 (2001)
47EEHiroshi Nagamochi, Mirka Miller, Slamin: Bounds on the number of isolates in sum graph labeling. Discrete Mathematics 240(1-3): 175-185 (2001)
46 Hiroshi Nagamochi, Toru Hasunuma: An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. J. Algorithms 38(2): 354-373 (2001)
45 Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki: Augmenting a Submodular and Posi-modular Set Function by a Multigraph. J. Comb. Optim. 5(2): 175-212 (2001)
44 Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. J. Comb. Optim. 5(4): 397-410 (2001)
43EEToshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks 37(3): 144-155 (2001)
2000
42EEToshimasa Ishii, Hiroshi Nagamochi: Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph. ISAAC 2000: 326-337
41EEToshimasa Ishii, Hiroshi Nagamochi: On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph. SWAT 2000: 286-299
40EEHiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki: A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. Algorithmica 26(1): 50-67 (2000)
39 Hiroshi Nagamochi, Toshihide Ibaraki: Polyhedral structure of submodular and posi-modular systems. Discrete Applied Mathematics 107(1-3): 165-189 (2000)
38 Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. J. Comb. Optim. 4(1): 35-77 (2000)
37 Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki: A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. J. Comb. Optim. 4(2): 151-169 (2000)
1999
36EEHiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki: A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. COCOON 1999: 164-173
35EEHiroshi Nagamochi, Toshihide Ibaraki: An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. COCOON 1999: 31-40
34EEToshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. ESA 1999: 414-425
33EEHiroshi Nagamochi, Toshihide Ibaraki: A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. IPCO 1999: 377-390
32EELiang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. ISAAC 1999: 373-382
31EEHiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki: Bisecting Two Subsets in 3-Connected Graphs. ISAAC 1999: 425-434
30 Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. J. Algorithms 30(2): 253-301 (1999)
29EEPeter Eades, Qing-Wen Feng, Hiroshi Nagamochi: Drawing Clustered Graphs on an Orthogonal Grid. J. Graph Algorithms Appl. 3(4): 3-29 (1999)
1998
28 Toru Hasunuma, Hiroshi Nagamochi: Independent Spanning Trees with Small Depths in Iterated Line Digraphs. CATS 1998: 21-36
27EEHiroshi Nagamochi, Peter Eades: Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. IPCO 1998: 96-111
26EEToshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. ISAAC 1998: 159-168
25EEHiroshi Nagamochi, Toshihide Ibaraki: Polyhedral Structure of Submodular and Posi-modular Systems. ISAAC 1998: 169-178
24EEHiroshi Nagamochi, Toru Hasunuma: An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. ISAAC 1998: 447-456
23 Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. SODA 1998: 280-289
22EEToshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi: A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. Combinatorica 18(1): 61-83 (1998)
21EEHiroshi Nagamochi, Toshihide Ibaraki: A Note on Minimizing Submodular Functions. Inf. Process. Lett. 67(5): 239-244 (1998)
20EEAndrás Frank, Toshihide Ibaraki, Hiroshi Nagamochi: Two Arc-Disjoint Paths in Eulerian Digraphs. SIAM J. Discrete Math. 11(4): 557-589 (1998)
1997
19EEToshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting Edge and Vertex Connectivities Simultaneously. ISAAC 1997: 102-111
18 Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki: Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. SODA 1997: 649-658
17 Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi: Combinatorial Optimization Games. SODA 1997: 720-729
16 Hiroshi Nagamochi, Toshihide Ibaraki: Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. J. Comb. Optim. 1(1): 5-46 (1997)
15EEHiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki: Computing All Small Cuts in an Undirected Network. SIAM J. Discrete Math. 10(3): 469-481 (1997)
1996
14 Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings Springer 1996
13EEHiroshi Nagamochi, Toshihide Ibaraki: Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. STOC 1996: 64-73
1995
12EEHiroshi Nagamochi, Toshihide Ibaraki: A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. IPCO 1995: 403-413
11EEAndrás Frank, Toshihide Ibaraki, Hiroshi Nagamochi: Two Arc Disjoint Paths in Eulerian Diagraphs. ISAAC 1995: 92-101
10 Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda: Optimal Coteries for Rings and Related Networks. Distributed Computing 8(4): 191-201 (1995)
1994
9EEHiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki: Computing All Small Cuts in Undirected Networks. ISAAC 1994: 190-198
8 Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki: Implementing an efficient minimum capacity cut algorithm. Math. Program. 67: 325-341 (1994)
1993
7EEYoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki: Vehicle Scheduling on a Tree with Release and Handling Times. ISAAC 1993: 486-495
1992
6 Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda: Optimal Coteries for Rings and Related Networks. ICDCS 1992: 650-656
5 Hiroshi Nagamochi, Toshihide Ibaraki: A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. Algorithmica 7(5&6): 583-596 (1992)
4 Hiroshi Nagamochi, Toshihide Ibaraki: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. SIAM J. Discrete Math. 5(1): 54-66 (1992)
1990
3EEHiroshi Nagamochi, Toshihide Ibaraki: Computing Edge-Connectivity in Multiple and Capacitated Graphs. SIGAL International Symposium on Algorithms 1990: 12-20
2EEHiroshi Nagamochi, Toshihide Ibaraki: Multicommodity flows in certain planar directed networks. Discrete Applied Mathematics 27(1-2): 125-145 (1990)
1989
1 Hiroshi Nagamochi, Toshihide Ibaraki: On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. Inf. Process. Lett. 31(6): 279-285 (1989)

Coauthor Index

1Yuusuke Abe [70] [118]
2Yoko Akiyama [63]
3Tatsuya Akutsu [122] [132]
4Yohei Arahori [140]
5Tetsuo Asano [14]
6André Berger [107]
7Xiaotie Deng [17]
8Peter Eades [27] [29] [61] [101]
9Qing-Wen Feng [29] [101]
10András Frank [11] [20]
11Satoru Fujishige [105]
12Hitoshi Fujita [91] [108] [119]
13Masato Fujita [59]
14Toshihiro Fujito [56]
15Takuro Fukunaga [90] [95] [103] [107] [112] [116] [128] [130] [138] [143] [146] [148]
16Jaeseong Gim [140]
17Fred Glover [125]
18Magnús M. Halldórsson [130] [138]
19Kazuya Haraguchi [129] [150]
20Toru Hasunuma [24] [28] [46] [48]
21Morihiro Hayashida [132]
22Kouji Hirata [104] [114]
23Seok-Hee Hong [102] [137] [139] [140] [142] [143] [150]
24Toshihide Ibaraki [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [15] [16] [17] [18] [19] [20] [21] [22] [23] [25] [26] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [43] [44] [45] [49] [50] [54] [55] [57] [62] [66] [77] [82] [100] [125]
25Yoshihide Igarashi [14]
26Takashi Imamichi [124] [136] [140] [145]
27Toshimasa Ishii [19] [23] [26] [34] [38] [41] [42] [43] [52] [63] [64] [68] [76] [80] [89] [91] [96] [100] [108] [119] [120]
28Hiro Ito [58] [59] [99]
29Kengo Iwata [80] [89] [120]
30Tibor Jordán [31] [57]
31Tiko Kameda [6]
32Tsunehiko Kameda [10]
33Yoko Kamidoi [109] [111]
34Seigo Karakawa [149]
35Yoshiyuki Karuno [7] [51] [53] [54] [60] [65] [69] [74]
36Alexander V. Karzanov [22]
37Shigeki Katayama [36] [37]
38Taizo Kawada [79] [97]
39Akifumi Kawaguchi [121] [144]
40Mitsutoshi Kenmochi [145]
41Kenya Kojima [125]
42Akira Komiya [125]
43Katsutoshi Kuroya [73] [117]
44Xuemin Lin [101]
45Kazuhisa Makino [105]
46Takahiro Matsuda [104] [114]
47Mirka Miller [47]
48Satoru Miyano [14]
49Ehab Morsy [115] [123] [126] [134] [141] [149]
50S. Nakamura [40]
51Yoshitaka Nakao [31] [57] [135]
52Kazuhiro Nishimura [9] [15]
53Koji Nonobe [125] [145]
54Takaharu Ohnishi [133]
55Kohei Okada [71] [78] [110]
56Tadashi Ono [8]
57Ojas Parekh [107]
58Mariko Sakashita [105]
59A. Shimae [131]
60Takashi Shiraki [18] [45]
61 Slamin [47]
62Yosuke Sugiyama [59]
63Subhash Suri [14]
64Takahisa Suzuki [76]
65Tetsuya Takine [104] [114]
66Jiexun Wang [122]
67Mutsunori Yagiura [125] [145]
68Nobuyasu Yamada [75]
69Shigeyuki Yamamoto [68] [96]
70Noriyoshi Yoshida [109]
71Liang Zhao [32] [44] [49] [50] [62] [66] [77] [82] [122] [131]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)