Search the dblp DataBase
Kimio Kawaguchi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Wei Chen, Xiao Wen Deng, Koichi Wada, Kimio Kawaguchi
Constructing a Strongly Convex Superhull of Points. [Citation Graph (0, 0)][DBLP]
COCOON, 1997, pp:42-51 [Conf] - Wei Chen, Koichi Wada, Kimio Kawaguchi
Parallel Robust Algorithms for Constructing Strongly Convex Hulls. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1996, pp:133-140 [Conf] - Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
Parallel Algorithms for Partitioning Sorted Sets and Related Problems. [Citation Graph (0, 0)][DBLP]
ESA, 1996, pp:234-245 [Conf] - Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi
Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. [Citation Graph (0, 0)][DBLP]
WG, 1997, pp:354-367 [Conf] - Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen
Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. [Citation Graph (0, 0)][DBLP]
WG, 1995, pp:197-208 [Conf] - Koichi Wada, Kimio Kawaguchi
Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. [Citation Graph (0, 0)][DBLP]
WG, 1993, pp:132-143 [Conf] - Koichi Wada, Akinari Takaki, Kimio Kawaguchi
Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. [Citation Graph (0, 0)][DBLP]
WG, 1994, pp:319-330 [Conf] - Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
Parallel Algorithms for Partitioning Sorted Sets and Related Problems. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2000, v:28, n:2, pp:217-241 [Journal] - Koichi Wada, Kimio Kawaguchi
Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1992, v:37, n:, pp:539-552 [Journal] - Kimio Kawaguchi, Koichi Wada
New Results in Graph Routing [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1993, v:106, n:2, pp:203-233 [Journal] - Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi
Constructing a Strongly Convex Superhull of Points. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Geometry Appl., 2001, v:11, n:5, pp:487-502 [Journal] - Wei Chen, Koichi Wada, Kimio Kawaguchi, Danny Z. Chen
Finding the Convex Hull of Discs in Parallel. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Geometry Appl., 1998, v:8, n:3, pp:305-320 [Journal] - Koichi Wada, Yupin Luo, Kimio Kawaguchi
Optimal Fault-Tolerant Routings for Connected Graphs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1992, v:41, n:3, pp:169-174 [Journal] - Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen
Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1997, v:43, n:1, pp:57-62 [Journal] - Wei Chen, Koichi Wada, Kimio Kawaguchi
Robust algorithms for constructing strongly convex hulls in parallel. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2002, v:289, n:1, pp:277-295 [Journal] - Koichi Wada, Akinari Takaki, Kimio Kawaguchi
Efficient Algorithms for a Mixed k-Partition Problem of Graphs Without Specifying Bases. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1998, v:201, n:1-2, pp:233-248 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002