default search action
Toshiya Mashima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j6]Satoshi Taoka, Tadachika Oki, Toshiya Mashima, Toshimasa Watanabe:
Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(2): 357-366 (2018) - 2012
- [j5]Tadachika Oki, Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe:
A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints. IEICE Trans. Inf. Syst. 95-D(3): 769-777 (2012)
2000 – 2009
- 2009
- [c8]Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree. ISCAS 2009: 2934-2937 - 2006
- [j4]Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe:
Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase. IEICE Trans. Inf. Syst. 89-D(2): 751-762 (2006) - [j3]Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(4): 1042-1048 (2006) - 2005
- [j2]Takanori Fukuoka, Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(4): 954-963 (2005) - [j1]Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
A 2-Approximation Algorithm to (k + 1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1290-1300 (2005) - [c7]Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe:
Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree. ISCAS (1) 2005: 752-755 - [c6]Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima:
Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph. ISCAS (3) 2005: 2231-2234 - 2003
- [c5]Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe:
A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph. ISCAS (3) 2003: 236-239
1990 – 1999
- 1995
- [c4]Toshiya Mashima, Toshimasa Watanabe:
Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem. ISCAS 1995: 155-158 - 1993
- [c3]Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima:
Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph. ISCAS 1993: 2311-2314 - [c2]Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka:
Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph. ISCAS 1993: 2556-2559 - 1992
- [c1]Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka:
The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. ISAAC 1992: 31-40
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-25 05:43 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: