Toshimasa Ishii

2009
28	EE	Toshimasa Ishii: Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs. Discrete Optimization 6(1): 23-36 (2009)
2008
27	EE	Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: An Algorithm for L(2, 1)-Labeling of Trees. SWAT 2008: 185-197
26	EE	Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A linear time algorithm for L(2,1)-labeling of trees CoRR abs/0810.0906: (2008)
2007
25	EE	Toshimasa Ishii: Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs. CATS 2007: 91-100
24	EE	Toshimasa Ishii: Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs. ISAAC 2007: 29-40
23	EE	Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi: Bisecting a 4-connected graph with three resource sets. Discrete Applied Mathematics 155(11): 1441-1450 (2007)
22	EE	Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi: The source location problem with local 3-vertex-connectivity requirements. Discrete Applied Mathematics 155(18): 2523-2538 (2007)
21	EE	Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi: Minimum cost source location problem with local 3-vertex-connectivity requirements. Theor. Comput. Sci. 372(1): 81-93 (2007)
2006
20	EE	Toshimasa 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)
19	EE	Toshimasa Ishii, Masayuki Hagiwara: Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. Discrete Applied Mathematics 154(16): 2307-2329 (2006)
18	EE	Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi: Augmenting forests to meet odd diameter requirements. Discrete Optimization 3(2): 154-164 (2006)
2005
17	EE	Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi: Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. CATS 2005: 97-105
16	EE	Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi: Bisecting a Four-Connected Graph with Three Resource Sets. ISAAC 2005: 176-185
15	EE	Hiroshi 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
14	EE	Hiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii: A simple recognition of maximal planar graphs. Inf. Process. Lett. 89(5): 223-226 (2004)
2003
13	EE	Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi: Augmenting Forests to Meet Odd Diameter Requirements. ISAAC 2003: 434-443
12	EE	Toshimasa Ishii, Masayuki Hagiwara: Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs. MFCS 2003: 490-499
11	EE	Hiroshi Nagamochi, Toshimasa Ishii: On the minimum local-vertex-connectivity augmentation in graphs. Discrete Applied Mathematics 129(2-3): 475-486 (2003)
10	EE	Toshimasa 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)
2001
9	EE	Hiroshi Nagamochi, Toshimasa Ishii: On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. ISAAC 2001: 124-135
8	EE	Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks 37(3): 144-155 (2001)
2000
7	EE	Toshimasa Ishii, Hiroshi Nagamochi: Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph. ISAAC 2000: 326-337
6	EE	Toshimasa Ishii, Hiroshi Nagamochi: On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph. SWAT 2000: 286-299
5		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)
1999
4	EE	Toshimasa 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
1998
3	EE	Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. ISAAC 1998: 159-168
2		Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. SODA 1998: 280-289
1997
1		Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting Edge and Vertex Connectivities Simultaneously. ISAAC 1997: 102-111

Coauthor Index

1	Yoko Akiyama	[10]
2	Hitoshi Fujita	[17] [21] [22]
3	Masayuki Hagiwara	[12] [19]
4	Toru Hasunuma	[26] [27]
5	Toshihide Ibaraki	[1] [2] [3] [4] [5] [8] [20]
6	Kengo Iwata	[15] [16] [23]
7	Hiroshi Nagamochi	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [13] [14] [15] [16] [17] [18] [20] [21] [22] [23]
8	Hirotaka Ono	[26] [27]
9	Takahisa Suzuki	[14]
10	Yushi Uno	[26] [27]
11	Shigeyuki Yamamoto	[13] [18]

Colors in the list of coauthors