2002 |
16 | | Wei Chen,
Koichi Wada,
Kimio Kawaguchi:
Robust algorithms for constructing strongly convex hulls in parallel.
Theor. Comput. Sci. 289(1): 277-295 (2002) |
2001 |
15 | | Wei Chen,
Xiaowen Deng,
Koichi Wada,
Kimio Kawaguchi:
Constructing a Strongly Convex Superhull of Points.
Int. J. Comput. Geometry Appl. 11(5): 487-502 (2001) |
2000 |
14 | EE | 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 |
13 | | Wei Chen,
Koichi Wada,
Kimio Kawaguchi,
Danny Z. Chen:
Finding the Convex Hull of Discs in Parallel.
Int. J. Comput. Geometry Appl. 8(3): 305-320 (1998) |
12 | EE | 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 |
11 | | Wei Chen,
Xiaowen Deng,
Koichi Wada,
Kimio Kawaguchi:
Constructing a Strongly Convex Superhull of Points.
COCOON 1997: 42-51 |
10 | | Koichi Wada,
Wei Chen,
Yupin Luo,
Kimio Kawaguchi:
Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs.
WG 1997: 354-367 |
9 | | Koichi Wada,
Takaharu Ikeo,
Kimio Kawaguchi,
Wei Chen:
Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs.
J. Parallel Distrib. Comput. 43(1): 57-62 (1997) |
1996 |
8 | | Danny Z. Chen,
Wei Chen,
Koichi Wada,
Kimio Kawaguchi:
Parallel Algorithms for Partitioning Sorted Sets and Related Problems.
ESA 1996: 234-245 |
7 | EE | Wei Chen,
Koichi Wada,
Kimio Kawaguchi:
Parallel Robust Algorithms for Constructing Strongly Convex Hulls.
Symposium on Computational Geometry 1996: 133-140 |
1995 |
6 | | Koichi Wada,
Takaharu Ikeo,
Kimio Kawaguchi,
Wei Chen:
Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs.
WG 1995: 197-208 |
1994 |
5 | | Koichi Wada,
Akinari Takaki,
Kimio Kawaguchi:
Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases.
WG 1994: 319-330 |
1993 |
4 | | Koichi Wada,
Kimio Kawaguchi:
Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs.
WG 1993: 132-143 |
3 | | Kimio Kawaguchi,
Koichi Wada:
New Results in Graph Routing
Inf. Comput. 106(2): 203-233 (1993) |
1992 |
2 | EE | Koichi Wada,
Kimio Kawaguchi:
Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs.
Discrete Applied Mathematics 37/38: 539-552 (1992) |
1 | | Koichi Wada,
Yupin Luo,
Kimio Kawaguchi:
Optimal Fault-Tolerant Routings for Connected Graphs.
Inf. Process. Lett. 41(3): 169-174 (1992) |