Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Toshimasa Ishii
2010 – today
- 2013
[j20]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica 66(3): 654-681 (2013)- 2012
- [j19]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: The (p, q)-total labeling problem for trees. Discrete Mathematics 312(8): 1407-1420 (2012)
- [j18]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. J. Discrete Algorithms 14: 189-206 (2012)
- [c21]
- [c20]
- 2010
- [j17]Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi: Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. Algorithmica 56(4): 413-436 (2010)
- [j16]Toshimasa Ishii, Kazuhisa Makino: Posi-Modular Systems with Modulotone Requirements under Permutation Constraints. Discrete Math., Alg. and Appl. 2(1): 61-76 (2010)
- [c19]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: The (p, q)-total Labeling Problem for Trees. ISAAC (2) 2010: 49-60
- [c18]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. IWOCA 2010: 103-106
2000 – 2009
- 2009
- [j15]Toshimasa Ishii: Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs. Discrete Optimization 6(1): 23-36 (2009)
- [j14]Toshimasa Ishii: Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs. J. Discrete Algorithms 7(4): 570-578 (2009)
- [j13]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: An O(n1.75) algorithm for L(2, 1)-labeling of trees. Theor. Comput. Sci. 410(38-40): 3702-3710 (2009)
- [c17]Toshimasa Ishii, Kazuhisa Makino: Augmenting Edge-Connectivity between Vertex Subsets. CATS 2009: 43-49
- [c16]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A Linear Time Algorithm for L(2, 1)-Labeling of Trees. ESA 2009: 35-46
- [c15]Toshimasa Ishii, Kazuhisa Makino: Posi-modular Systems with Modulotone Requirements under Permutation Constraints. ISAAC 2009: 473-482
- [i2]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A tight upper bound on the (2,1)-total labeling number of outerplanar graphs. CoRR abs/0911.4590 (2009)
- 2008
- [c14]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: An Algorithm for L(2, 1)-Labeling of Trees. SWAT 2008: 185-197
- [i1]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
- [j12]Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi: Bisecting a 4-connected graph with three resource sets. Discrete Applied Mathematics 155(11): 1441-1450 (2007)
- [j11]Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi: The source location problem with local 3-vertex-connectivity requirements. Discrete Applied Mathematics 155(18): 2523-2538 (2007)
- [j10]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)
- [c13]Toshimasa Ishii: Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs. CATS 2007: 91-100
- [c12]Toshimasa Ishii: Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs. ISAAC 2007: 29-40
- 2006
- [j9]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)
- [j8]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)
- [j7]Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi: Augmenting forests to meet odd diameter requirements. Discrete Optimization 3(2): 154-164 (2006)
- 2005
- [j6]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)
- [c11]Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi: Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. CATS 2005: 97-105
- [c10]Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi: Bisecting a Four-Connected Graph with Three Resource Sets. ISAAC 2005: 176-185
- 2004
- [j5]Hiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii: A simple recognition of maximal planar graphs. Inf. Process. Lett. 89(5): 223-226 (2004)
- 2003
- [j4]Hiroshi Nagamochi, Toshimasa Ishii: On the minimum local-vertex-connectivity augmentation in graphs. Discrete Applied Mathematics 129(2-3): 475-486 (2003)
- [j3]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: 236-259 (2003)
- [c9]Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi: Augmenting Forests to Meet Odd Diameter Requirements. ISAAC 2003: 434-443
- [c8]Toshimasa Ishii, Masayuki Hagiwara: Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs. MFCS 2003: 490-499
- 2001
- [j2]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks 37(3): 144-155 (2001)
- [c7]Hiroshi Nagamochi, Toshimasa Ishii: On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. ISAAC 2001: 124-135
- 2000
- [j1]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)
- [c6]Toshimasa Ishii, Hiroshi Nagamochi: Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph. ISAAC 2000: 326-337
- [c5]Toshimasa Ishii, Hiroshi Nagamochi: On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph. SWAT 2000: 286-299
1990 – 1999
- 1999
- [c4]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
- [c3]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. ISAAC 1998: 159-168
- [c2]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. SODA 1998: 280-289
- 1997
- [c1]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting Edge and Vertex Connectivities Simultaneously. ISAAC 1997: 102-111
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-26 21:26 CEST by the dblp team