Toshimasa Ishii

Publication Activity (10 Years)

Years Active: 1997-2023
Publications (10 Years): 9

Top Topics

Subgraph Isomorphism

Related Problems

Function Optimization

Top Venues

Discret. Appl. Math.

Publications

Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi, Kazuhisa Makino
Trade-offs among degree, diameter, and number of paths. Discret. Appl. Math. 327 (2023)
Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
Posimodular Function Optimization. Algorithmica 84 (4) (2022)
Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
Reallocation Problems with Minimum Completion Time. COCOON (2022)
Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
Reallocation Problems with Minimum Completion Time. CoRR (2021)
Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Settlement fund circulation problem. Discret. Appl. Math. 265 (2019)
Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
Posimodular Function Optimization. WADS (2017)
Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Settlement Fund Circulation Problem. ISAAC (2017)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
(Total) Vector domination for graphs with bounded branchwidth. Discret. Appl. Math. 207 (2016)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Subexponential fixed-parameter algorithms for partial vector domination. Discret. Optim. 22 (2016)
Toshimasa Ishii, Kazuhisa Makino
Posimodular Function Optimization. CoRR (2014)
Toshimasa Ishii, Kazuhisa Makino
Augmenting Edge-Connectivity between Vertex Subsets. Algorithmica 69 (1) (2014)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
(Total) Vector Domination for Graphs with Bounded Branchwidth. LATIN (2014)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. ISCO (2014)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. 4 (2) (2014)
Toshimasa Ishii
Augmenting Outerplanar Graphs to Meet Diameter Requirements. J. Graph Theory 74 (4) (2013)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
(Total) Vector Domination for Graphs with Bounded Branchwidth. CoRR (2013)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica 66 (3) (2013)
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 (2012)
Toshimasa Ishii
Graph Augmentation Problem with Diameter Requirements. ICNC (2012)
Toshimasa Ishii
Augmenting Outerplanar Graphs to Meet Diameter Requirements. CATS (2012)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
The (p, q)-total labeling problem for trees. Discret. Math. 312 (8) (2012)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
)-total Labeling Problem for Trees. ISAAC (2) (2010)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. IWOCA (2010)
Toshimasa Ishii, Kazuhisa Makino
Posi-Modular Systems with Modulotone Requirements under Permutation Constraints. Discret. Math. Algorithms Appl. 2 (1) (2010)
Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. Algorithmica 56 (4) (2010)
Toshimasa Ishii
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs. J. Discrete Algorithms 7 (4) (2009)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs CoRR (2009)
Toshimasa Ishii, Kazuhisa Makino
Augmenting Edge-Connectivity between Vertex Subsets. CATS (2009)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
(2, 1)-Labeling of Trees. ESA (2009)
Toshimasa Ishii
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs. Discret. Optim. 6 (1) (2009)
Toshimasa Ishii, Kazuhisa Makino
Posi-modular Systems with Modulotone Requirements under Permutation Constraints. ISAAC (2009)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
) algorithm for L(2, 1)-labeling of trees. Theor. Comput. Sci. 410 (38-40) (2009)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A linear time algorithm for L(2,1)-labeling of trees CoRR (2008)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
An Algorithm for L(2, 1)-Labeling of Trees. SWAT (2008)
Toshimasa Ishii
Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs. CATS (2007)
Toshimasa Ishii
Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs. ISAAC (2007)
Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
Minimum cost source location problem with local 3-vertex-connectivity requirements. Theor. Comput. Sci. 372 (1) (2007)
Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
Bisecting a 4-connected graph with three resource sets. Discret. Appl. Math. 155 (11) (2007)
Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
The source location problem with local 3-vertex-connectivity requirements. Discret. Appl. Math. 155 (18) (2007)
Toshimasa Ishii, Masayuki Hagiwara
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. Discret. Appl. Math. 154 (16) (2006)
Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
Augmenting forests to meet odd diameter requirements. Discret. Optim. 3 (2) (2006)
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. Algorithmica 44 (3) (2006)
Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii
A robust algorithm for bisecting a triconnected graph with two resource sets. Theor. Comput. Sci. 341 (1-3) (2005)
Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. CATS (2005)
Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
Bisecting a Four-Connected Graph with Three Resource Sets. ISAAC (2005)
Hiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii
A simple recognition of maximal planar graphs. Inf. Process. Lett. 89 (5) (2004)
Toshimasa Ishii, Masayuki Hagiwara
Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs. MFCS (2003)
Hiroshi Nagamochi, Toshimasa Ishii
On the minimum local-vertex-connectivity augmentation in graphs. Discret. Appl. Math. 129 (2-3) (2003)
Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
Augmenting Forests to Meet Odd Diameter Requirements. ISAAC (2003)
Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi
Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs. Electron. Notes Theor. Comput. Sci. 78 (2003)
Hiroshi Nagamochi, Toshimasa Ishii
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. ISAAC (2001)
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks 37 (3) (2001)
Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito
Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf. Process. Lett. 80 (6) (2001)
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) (2000)
Toshimasa Ishii, Hiroshi Nagamochi
-Edge-Connected Graph and a Biconnected Graph. ISAAC (2000)
Toshimasa Ishii, Hiroshi Nagamochi
-Connected Graph. SWAT (2000)
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)
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. SODA (1998)
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. ISAAC (1998)
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
Augmenting Edge and Vertex Connectivities Simultaneously. ISAAC (1997)