default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKimio Kawaguchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2002
[j12]Wei Chen, Koichi Wada, Kimio Kawaguchi:
Robust algorithms for constructing strongly convex hulls in parallel. Theor. Comput. Sci. 289(1): 277-295 (2002)- 2001
- [j11]Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi:
Constructing a Strongly Convex Superhull of Points. Int. J. Comput. Geom. Appl. 11(5): 487-502 (2001) - 2000
- [j10]Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi:
Parallel Algorithms for Partitioning Sorted Sets and Related Problems. Algorithmica 28(2): 217-241 (2000) - 1998
- [j9]Wei Chen, Koichi Wada, Kimio Kawaguchi, Danny Z. Chen:
Finding the Convex Hull of Discs in Parallel. Int. J. Comput. Geom. Appl. 8(3): 305-320 (1998) - [j8]Koichi Wada, Akinari Takaki, Kimio Kawaguchi:
Efficient Algorithms for a Mixed k-Partition Problem of Graphs Without Specifying Bases. Theor. Comput. Sci. 201(1-2): 233-248 (1998) - 1997
- [j7]Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen:
Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs. J. Parallel Distributed Comput. 43(1): 57-62 (1997) - 1993
- [j6]Kimio Kawaguchi, Koichi Wada:
New Results in Graph Routing. Inf. Comput. 106(2): 203-233 (1993) - 1992
- [j5]Koichi Wada, Kimio Kawaguchi:
Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs. Discret. Appl. Math. 37/38: 539-552 (1992) - [j4]Koichi Wada, Yupin Luo, Kimio Kawaguchi:
Optimal Fault-Tolerant Routings for Connected Graphs. Inf. Process. Lett. 41(3): 169-174 (1992) - [j3]Koichi Wada, Yukio Moritani, Kimio Kawaguchi, Masahiro Morishita:
Distributed algorithms for connectivity problem of networks with faulty elements. Syst. Comput. Jpn. 23(7): 12-22 (1992) - 1989
- [j2]Koichi Wada, Kimio Kawaguchi, Hideyuki Fujishima:
Maximum lower bound on embedding areas of general graphs. Syst. Comput. Jpn. 20(10): 39-52 (1989) - 1987
- [j1]Koichi Wada, Kimio Kawaguchi, Yupin Luo:
Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs. Syst. Comput. Jpn. 18(11): 50-60 (1987)
Conference and Workshop Papers
- 1997
- [c8]Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi:
Constructing a Strongly Convex Superhull of Points. COCOON 1997: 42-51 - [c7]Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi:
Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. WG 1997: 354-367 - 1996
- [c6]Wei Chen, Koichi Wada, Kimio Kawaguchi:
Parallel Robust Algorithms for Constructing Strongly Convex Hulls. SCG 1996: 133-140 - [c5]Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi:
Parallel Algorithms for Partitioning Sorted Sets and Related Problems. ESA 1996: 234-245 - 1995
- [c4]Takaya Arita, Keiichi Unno, Kimio Kawaguchi:
A Primitive Model of Language Generation by Evolution and Learning. BIES 1995: 163-170 - [c3]Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen:
Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. WG 1995: 197-208 - 1994
- [c2]Koichi Wada, Akinari Takaki, Kimio Kawaguchi:
Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. WG 1994: 319-330 - 1993
- [c1]Koichi Wada, Kimio Kawaguchi:
Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. WG 1993: 132-143
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 2025-01-09 12:49 CET 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:
