Augmenting Edge and Vertex Connectivities Simultaneously. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (ISAAC, 1997)

K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (ISAAC, 1998)

Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (SODA, 1998)

Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (ESA, 1999)

Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph. - Toshimasa Ishii; Hiroshi Nagamochi (ISAAC, 2000)

On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph. - Toshimasa Ishii; Hiroshi Nagamochi (SWAT, 2000)

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (J. Comb. Optim., 2000)

Minimum cost source location problem with vertex-connectivity requirements in digraphs. - Hiroshi Nagamochi; Toshimasa Ishii; Hiro Ito (Inf. Process. Lett., 2001)

Multigraph augmentation under biconnectivity and general edge-connectivity requirements. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (Networks, 2001)

Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs. - Toshimasa Ishii; Masayuki Hagiwara (MFCS, 2003)

On the minimum local-vertex-connectivity augmentation in graphs. - Hiroshi Nagamochi; Toshimasa Ishii (Discret. Appl. Math., 2003)

A simple recognition of maximal planar graphs. - Hiroshi Nagamochi; Takahisa Suzuki; Toshimasa Ishii (Inf. Process. Lett., 2004)

Bisecting a Four-Connected Graph with Three Resource Sets. - Toshimasa Ishii; Kengo Iwata; Hiroshi Nagamochi (ISAAC, 2005)

A robust algorithm for bisecting a triconnected graph with two resource sets. - Hiroshi Nagamochi; Kengo Iwata; Toshimasa Ishii (Theor. Comput. Sci., 2005)

Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. - Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki (Algorithmica, 2006)

Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. - Toshimasa Ishii; Masayuki Hagiwara (Discret. Appl. Math., 2006)

Augmenting forests to meet odd diameter requirements. - Toshimasa Ishii; Shigeyuki Yamamoto; Hiroshi Nagamochi (Discret. Optim., 2006)

The source location problem with local 3-vertex-connectivity requirements. - Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi (Discret. Appl. Math., 2007)

Bisecting a 4-connected graph with three resource sets. - Toshimasa Ishii; Kengo Iwata; Hiroshi Nagamochi (Discret. Appl. Math., 2007)

Minimum cost source location problem with local 3-vertex-connectivity requirements. - Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi (Theor. Comput. Sci., 2007)

An Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (SWAT, 2008)

A linear time algorithm for L(2,1)-labeling of trees - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (CoRR, 2008)

A Linear Time Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (ESA, 2009)

A tight upper bound on the (2,1)-total labeling number of outerplanar graphs - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (CoRR, 2009)

Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs. - Toshimasa Ishii (Discret. Optim., 2009)

Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs. - Toshimasa Ishii (J. Discrete Algorithms, 2009)

An O(n1.75) algorithm for L(2, 1)-labeling of trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Theor. Comput. Sci., 2009)

The (p, q)-total Labeling Problem for Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (ISAAC (2), 2010)

The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (IWOCA, 2010)

Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. - Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi (Algorithmica, 2010)

Posi-Modular Systems with Modulotone Requirements under Permutation Constraints. - Toshimasa Ishii; Kazuhisa Makino (Discret. Math. Algorithms Appl., 2010)

Graph Augmentation Problem with Diameter Requirements. - Toshimasa Ishii (ICNC, 2012)

The (p, q)-total labeling problem for trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Math., 2012)

A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (J. Discrete Algorithms, 2012)

A Linear Time Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Algorithmica, 2013)

Augmenting Outerplanar Graphs to Meet Diameter Requirements. - Toshimasa Ishii (J. Graph Theory, 2013)

Augmenting Edge-Connectivity between Vertex Subsets. - Toshimasa Ishii; Kazuhisa Makino (Algorithmica, 2014)

Posimodular Function Optimization. - Toshimasa Ishii; Kazuhisa Makino (CoRR, 2014)

Algorithmic aspects of distance constrained labeling: a survey. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Int. J. Netw. Comput., 2014)

(Total) Vector domination for graphs with bounded branchwidth. - Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Appl. Math., 2016)

Subexponential fixed-parameter algorithms for partial vector domination. - Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Optim., 2016)

Settlement fund circulation problem. - Hitoshi Hayakawa; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Appl. Math., 2019)

Reallocation Problems with Minimum Completion Time. - Toshimasa Ishii; Jun Kawahara; Kazuhisa Makino; Hirotaka Ono 001 (COCOON, 2022)

Posimodular Function Optimization. - Magnús M. Halldórsson; Toshimasa Ishii; Kazuhisa Makino; Kenjiro Takazawa (Algorithmica, 2022)

Trade-offs among degree, diameter, and number of paths. - Toshimasa Ishii; Akitoshi Kawamura; Yusuke Kobayashi 001; Kazuhisa Makino (Discret. Appl. Math., 2023)