Toshimasa Ishii

activity

20082021

most cited(Total) Vector Domination for Graphs with Bounded Branchwidth

2 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

cs.DS2021

Reallocation Problems with Minimum Completion Time

Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino +1

Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logistics, and transportation science. In this paper, we introduce…

cs.DS2014

Posimodular Function Optimization

Toshimasa Ishii, Kazuhisa Makino

Given a posimodular function $f : 2^{V} \to R$ on a finite set $V$ , we consider the problem of finding a nonempty subset $X$ of $V$ that minimizes $f (X)$ . Posimodular functio…

cs.DS2013★ 2 cited

(Total) Vector Domination for Graphs with Bounded Branchwidth

Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Given a graph $G = (V, E)$ of order $n$ and an $n$ -dimensional non-negative vector $d = (d (1), d (2), \dots, d (n))$ , called demand vector, the vector domination (resp., total vector domina…

cs.DM2009★ 1 cited

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

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono +1

A $(2, 1)$ -total labeling of a graph $G$ is an assignment $f$ from the vertex set $V (G)$ and the edge set $E (G)$ to the set ${0, 1, ..., k}$ of nonnegative integers such that $|f(x)-…

cs.DS2008

A linear time algorithm for L(2,1)-labeling of trees

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono +1

An L(2,1)-labeling of a graph $G$ is an assignment $f$ from the vertex set $V (G)$ to the set of nonnegative integers such that $∣ f (x) - f (y) ∣ \geq 2$ if $x$ and $y$ are adjacent and $|…