The SCEAS System
| |||||||

## Search the dblp DataBase
Toshimasa Ishii:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
**Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements.**[Citation Graph (0, 0)][DBLP] CATS, 2005, pp:97-105 [Conf] - Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
**Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph.**[Citation Graph (0, 0)][DBLP] ESA, 1999, pp:414-425 [Conf] - Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
**Bisecting a Four-Connected Graph with Three Resource Sets.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:176-185 [Conf] - Toshimasa Ishii, Hiroshi Nagamochi
**Simultaneous Augmentation of Two Graphs to an**[Citation Graph (0, 0)][DBLP]*l*-Edge-Connected Graph and a Biconnected Graph. ISAAC, 2000, pp:326-337 [Conf] - Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
**Augmenting Edge and Vertex Connectivities Simultaneously.**[Citation Graph (0, 0)][DBLP] ISAAC, 1997, pp:102-111 [Conf] - Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
**K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph.**[Citation Graph (0, 0)][DBLP] ISAAC, 1998, pp:159-168 [Conf] - Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
**Augmenting Forests to Meet Odd Diameter Requirements.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:434-443 [Conf] - Hiroshi Nagamochi, Toshimasa Ishii
**On the Minimum Local-Vertex-Connectivity Augmentation in Graphs.**[Citation Graph (0, 0)][DBLP] ISAAC, 2001, pp:124-135 [Conf] - Toshimasa Ishii, Masayuki Hagiwara
**Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs.**[Citation Graph (0, 0)][DBLP] MFCS, 2003, pp:490-499 [Conf] - Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
**Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.**[Citation Graph (0, 0)][DBLP] SODA, 1998, pp:280-289 [Conf] - Toshimasa Ishii, Hiroshi Nagamochi
**On the Minimum Augmentation of an**[Citation Graph (0, 0)][DBLP]*l*-Connected Graph to a*k*-Connected Graph. SWAT, 2000, pp:286-299 [Conf] - Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
**Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:44, n:3, pp:257-280 [Journal] - Hiroshi Nagamochi, Toshimasa Ishii
**On the minimum local-vertex-connectivity augmentation in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:475-486 [Journal] - Toshimasa Ishii, Masayuki Hagiwara
**Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:16, pp:2307-2329 [Journal] - Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi
**Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal] - Hiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii
**A simple recognition of maximal planar graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:5, pp:223-226 [Journal] - Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
**Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2000, v:4, n:1, pp:35-77 [Journal] - Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
**Multigraph augmentation under biconnectivity and general edge-connectivity requirements.**[Citation Graph (0, 0)][DBLP] Networks, 2001, v:37, n:3, pp:144-155 [Journal] - Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii
**A robust algorithm for bisecting a triconnected graph with two resource sets.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:364-378 [Journal] - Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
**Minimum cost source location problem with local 3-vertex-connectivity requirements.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:372, n:1, pp:81-93 [Journal] - Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
**Bisecting a 4-connected graph with three resource sets.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:11, pp:1441-1450 [Journal] **Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs.**[Citation Graph (, )][DBLP]**A Linear Time Algorithm for**[Citation Graph (, )][DBLP]*L*(2, 1)-Labeling of Trees.**Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs.**[Citation Graph (, )][DBLP]**An Algorithm for L(2, 1)-Labeling of Trees.**[Citation Graph (, )][DBLP]**Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs.**[Citation Graph (, )][DBLP]**A linear time algorithm for L(2,1)-labeling of trees**[Citation Graph (, )][DBLP]**A tight upper bound on the (2,1)-total labeling number of outerplanar graphs**[Citation Graph (, )][DBLP]**The source location problem with local 3-vertex-connectivity requirements.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |