Toshimasa Ishii

61 papers A* 1A 2B 12C 2Misc 2Journal 34Unranked 8

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