default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDToshimasa Ishii
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi
, Kazuhisa Makino:
Trade-offs among degree, diameter, and number of paths. Discret. Appl. Math. 327: 96-100 (2023)- 2022
- [j27]Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa:
Posimodular Function Optimization. Algorithmica 84(4): 1107-1131 (2022) - [c27]Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. COCOON 2022: 292-304 - 2021
- [i5]Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. CoRR abs/2111.02579 (2021)
2010 – 2019
- 2019
- [j26]Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Settlement fund circulation problem. Discret. Appl. Math. 265: 86-103 (2019) - 2017
- [c26]Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Settlement Fund Circulation Problem. ISAAC 2017: 46:1-46:13 - [c25]Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa:
Posimodular Function Optimization. WADS 2017: 437-448 - 2016
- [j25]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector domination for graphs with bounded branchwidth. Discret. Appl. Math. 207: 80-89 (2016) - [j24]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Subexponential fixed-parameter algorithms for partial vector domination. Discret. Optim. 22: 111-121 (2016) - 2014
- [j23]Toshimasa Ishii, Kazuhisa Makino:
Augmenting Edge-Connectivity between Vertex Subsets. Algorithmica 69(1): 130-147 (2014) - [j22]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. 4(2): 251-259 (2014) - [c24]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. ISCO 2014: 292-304 - [c23]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector Domination for Graphs with Bounded Branchwidth. LATIN 2014: 238-249 - [i4]Toshimasa Ishii, Kazuhisa Makino:
Posimodular Function Optimization. CoRR abs/1410.6030 (2014) - 2013
- [j21]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica 66(3): 654-681 (2013) - [j20]Toshimasa Ishii:
Augmenting Outerplanar Graphs to Meet Diameter Requirements. J. Graph Theory 74(4): 392-416 (2013) - [i3]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector Domination for Graphs with Bounded Branchwidth. CoRR abs/1306.5041 (2013) - 2012
- [j19]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (p, q)-total labeling problem for trees. Discret. Math. 312(8): 1407-1420 (2012) - [j18]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: 189-206 (2012) - [c22]Toshimasa Ishii:
Augmenting Outerplanar Graphs to Meet Diameter Requirements. CATS 2012: 123-132 - [c21]Toshimasa Ishii:
Graph Augmentation Problem with Diameter Requirements. ICNC 2012: 393-398 - 2010
- [j17]Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi:
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. Algorithmica 56(4): 413-436 (2010) - [j16]Toshimasa Ishii, Kazuhisa Makino:
Posi-Modular Systems with Modulotone Requirements under Permutation Constraints. Discret. Math. Algorithms Appl. 2(1): 61-76 (2010) - [c20]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (p, q)-total Labeling Problem for Trees. ISAAC (2) 2010: 49-60 - [c19]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. IWOCA 2010: 103-106
2000 – 2009
- 2009
- [j15]Toshimasa Ishii:
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs. Discret. Optim. 6(1): 23-36 (2009) - [j14]Toshimasa Ishii:
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs. J. Discrete Algorithms 7(4): 570-578 (2009) - [j13]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
An O(n1.75) algorithm for L(2, 1)-labeling of trees. Theor. Comput. Sci. 410(38-40): 3702-3710 (2009) - [c18]Toshimasa Ishii, Kazuhisa Makino:
Augmenting Edge-Connectivity between Vertex Subsets. CATS 2009: 43-49 - [c17]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. ESA 2009: 35-46 - [c16]Toshimasa Ishii, Kazuhisa Makino:
Posi-modular Systems with Modulotone Requirements under Permutation Constraints. ISAAC 2009: 473-482 - [i2]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs. CoRR abs/0911.4590 (2009) - 2008
- [c15]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
An Algorithm for L(2, 1)-Labeling of Trees. SWAT 2008: 185-197 - [i1]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A linear time algorithm for L(2,1)-labeling of trees. CoRR abs/0810.0906 (2008) - 2007
- [j12]Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi:
Bisecting a 4-connected graph with three resource sets. Discret. Appl. Math. 155(11): 1441-1450 (2007) - [j11]Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi:
The source location problem with local 3-vertex-connectivity requirements. Discret. Appl. Math. 155(18): 2523-2538 (2007) - [j10]Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi:
Minimum cost source location problem with local 3-vertex-connectivity requirements. Theor. Comput. Sci. 372(1): 81-93 (2007) - [c14]Toshimasa Ishii:
Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs. CATS 2007: 91-100 - [c13]Toshimasa Ishii:
Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs. ISAAC 2007: 29-40 - 2006
- [j9]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. Algorithmica 44(3): 257-280 (2006) - [j8]Toshimasa Ishii, Masayuki Hagiwara:
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. Discret. Appl. Math. 154(16): 2307-2329 (2006) - [j7]Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi:
Augmenting forests to meet odd diameter requirements. Discret. Optim. 3(2): 154-164 (2006) - 2005
- [j6]Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii:
A robust algorithm for bisecting a triconnected graph with two resource sets. Theor. Comput. Sci. 341(1-3): 364-378 (2005) - [c12]Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi:
Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. CATS 2005: 97-105 - [c11]Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi:
Bisecting a Four-Connected Graph with Three Resource Sets. ISAAC 2005: 176-185 - 2004
- [j5]Hiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii:
A simple recognition of maximal planar graphs. Inf. Process. Lett. 89(5): 223-226 (2004) - 2003
- [j4]Hiroshi Nagamochi, Toshimasa Ishii:
On the minimum local-vertex-connectivity augmentation in graphs. Discret. Appl. Math. 129(2-3): 475-486 (2003) - [c10]Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi:
Augmenting Forests to Meet Odd Diameter Requirements. ISAAC 2003: 434-443 - [c9]Toshimasa Ishii, Masayuki Hagiwara:
Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs. MFCS 2003: 490-499 - [c8]Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi:
Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs. CATS 2003: 236-259 - 2001
- [j3]Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito:
Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf. Process. Lett. 80(6): 287-293 (2001) - [j2]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks 37(3): 144-155 (2001) - [c7]Hiroshi Nagamochi, Toshimasa Ishii:
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. ISAAC 2001: 124-135 - 2000
- [j1]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): 35-77 (2000) - [c6]Toshimasa Ishii, Hiroshi Nagamochi:
Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph. ISAAC 2000: 326-337 - [c5]Toshimasa Ishii, Hiroshi Nagamochi:
On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph. SWAT 2000: 286-299
1990 – 1999
- 1999
- [c4]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: 414-425 - 1998
- [c3]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. ISAAC 1998: 159-168 - [c2]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. SODA 1998: 280-289 - 1997
- [c1]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Augmenting Edge and Vertex Connectivities Simultaneously. ISAAC 1997: 102-111
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
