Toshimasa Ishii

发表

Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and k-Vertex-Connected Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 2005, Algorithmica.

Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs

Hiroshi Nagamochi, Toshimasa Ishii, Yoko Akiyama, 2003, Algorithmica.

Minimum cost source location problem with vertex-connectivity requirements in digraphs

Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito, 2001, Inf. Process. Lett..

Bisecting a Four-Connected Graph with Three Resource Sets

Hiroshi Nagamochi, Toshimasa Ishii, Kengo Iwata, 2005, ISAAC.

Posi-Modular Systems with Modulotone Requirements under Permutation Constraints

Kazuhisa Makino, Toshimasa Ishii, K. Makino, 2009, Discret. Math. Algorithms Appl..

On the minimum local-vertex-connectivity augmentation in graphs

Hiroshi Nagamochi, Toshimasa Ishii, 2003, Discret. Appl. Math..

Settlement fund circulation problem

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2019, Discret. Appl. Math..

Augmenting Edge-Connectivity between Vertex Subsets

Kazuhisa Makino, Toshimasa Ishii, 2012, Algorithmica.

A Linear Time Algorithm for L(2, 1)-Labeling of Trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2009, ESA.

(Total) Vector Domination for Graphs with Bounded Branchwidth

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2014, LATIN.

Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs

Hiroshi Nagamochi, Toshimasa Ishii, Yoko Akiyama, 2003, Electron. Notes Theor. Comput. Sci..

Augmenting Edge and Vertex Connectivities Simultaneously

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1997, ISAAC.

Algorithmic aspects of distance constrained labeling: a survey

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2014, Int. J. Netw. Comput..

The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2010, IWOCA.

A simple recognition of maximal planar graphs

Hiroshi Nagamochi, Toshimasa Ishii, Takahisa Suzuki, 2004, Inf. Process. Lett..

Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1999, ESA.

A Linear Time Algorithm for L(2,1)-Labeling of Trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2012, Algorithmica.

A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs pdf

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2012, J. Discrete Algorithms.

The (p, q)-total labeling problem for trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2012, Discret. Math..

Augmenting Forests to Meet Odd Diameter Requirements

Hiroshi Nagamochi, Toshimasa Ishii, Shigeyuki Yamamoto, 2003, ISAAC.

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 2000, J. Comb. Optim..

Studies on Multigraph Connectivity Augmentation Problems

Toshimasa Ishii, 2000 .

Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1997 .

(Total) Vector domination for graphs with bounded branchwidth pdf

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2013, Discret. Appl. Math..

Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs

Toshimasa Ishii, Toshimasa Ishii, 2006, Discret. Optim..

Posimodular Function Optimization

Kazuhisa Makino, Toshimasa Ishii, Magnús M. Halldórsson, 2014, Algorithmica.

Multigraph augmentation under biconnectivity and general edge-connectivity requirements

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 2001, Networks.

An O(n1.75) algorithm for L(2, 1)-labeling of trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2009, Theor. Comput. Sci..

On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph

Hiroshi Nagamochi, Toshimasa Ishii, H. Nagamochi, 2000, SWAT.

Subexponential fixed-parameter algorithms for partial vector domination

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2016, Discret. Optim..

Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs

Toshimasa Ishii, Masayuki Hagiwara, Toshimasa Ishii, 2006, Discret. Appl. Math..

Optimal augmentation to make a graph k-edge-connected and triconnected

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1998, SODA '98.

Apparatus for preparation of the data carrier card

Toshimasa Ishii, Hiroyuki Kuroki, Sigeru Toppan Insatsu Ka Fukai, 1990 .

Augmenting forests to meet odd diameter requirements

Hiroshi Nagamochi, Toshimasa Ishii, Shigeyuki Yamamoto, 2006, Discret. Optim..

A Routing Algorithm on a Storage Tank System

Hiroshi Nagamochi, Toshimasa Ishii, Makoto Takeda, 2005 .

Augmenting Outerplanar Graphs to Meet Diameter Requirements

Toshimasa Ishii, 2013, J. Graph Theory.

A robust algorithm for bisecting a triconnected graph with two resource sets

Hiroshi Nagamochi, Toshimasa Ishii, Kengo Iwata, 2005, Theor. Comput. Sci..

An Algorithm for L(2, 1)-Labeling of Trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2008, SWAT.

Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs

Toshimasa Ishii, Toshimasa Ishii, 2009, J. Discrete Algorithms.

Subexponential fixed-parameter algorithms for partial vector domination

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2014, Discret. Optim..

On the Minimum Local-Vertex-Connectivity Augmentation in Graphs

Hiroshi Nagamochi, Toshimasa Ishii, 2001, ISAAC.

Graph Augmentation Problem with Diameter Requirements

Toshimasa Ishii, 2012, 2012 Third International Conference on Networking and Computing.

Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs

Toshimasa Ishii, Masayuki Hagiwara, 2003, MFCS.

The (p, q)-total Labeling Problem for Trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2010, ISAAC.

K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph

Toshihide Ibaraki, Hiroshi Nagamochi, Toshimasa Ishii, 1998, ISAAC.

The source location problem with local 3-vertex-connectivity requirements

Hiroshi Nagamochi, Toshimasa Ishii, Hitoshi Fujita, 2007, Discret. Appl. Math..

Minimum cost source location problem with local 3-vertex-connectivity requirements

Hiroshi Nagamochi, Toshimasa Ishii, Hitoshi Fujita, 2007, Theor. Comput. Sci..

Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs

Toshimasa Ishii, Toshimasa Ishii, 2007, ISAAC.

Bisecting a 4-connected graph with three resource sets

Hiroshi Nagamochi, Toshimasa Ishii, Kengo Iwata, 2007, Discret. Appl. Math..

Posi-modular Systems with Modulotone Requirements under Permutation Constraints

Kazuhisa Makino, Toshimasa Ishii, 2009, ISAAC.

Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph

Hiroshi Nagamochi, Toshimasa Ishii, 2000, ISAAC.

Settlement Fund Circulation Problem

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2019, ISAAC.

Reallocation Problems with Minimum Completion Time pdf

Kazuhisa Makino, Toshimasa Ishii, Jun Kawahara, 2021, ArXiv.