Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs. - Koichi Wada 001; Kimio Kawaguchi; Yupin Luo (Syst. Comput. Jpn., 1987)

Maximum lower bound on embedding areas of general graphs. - Koichi Wada 001; Kimio Kawaguchi; Hideyuki Fujishima (Syst. Comput. Jpn., 1989)

Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs. - Koichi Wada 001; Kimio Kawaguchi (Discret. Appl. Math., 1992)

Optimal Fault-Tolerant Routings for Connected Graphs. - Koichi Wada 001; Yupin Luo; Kimio Kawaguchi (Inf. Process. Lett., 1992)

Distributed algorithms for connectivity problem of networks with faulty elements. - Koichi Wada 001; Yukio Moritani; Kimio Kawaguchi; Masahiro Morishita (Syst. Comput. Jpn., 1992)

Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. - Koichi Wada 001; Kimio Kawaguchi (WG, 1993)

New Results in Graph Routing - Kimio Kawaguchi; Koichi Wada 001 (Inf. Comput., 1993)

Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. - Koichi Wada 001; Akinari Takaki; Kimio Kawaguchi (WG, 1994)

A Primitive Model of Language Generation by Evolution and Learning. - Takaya Arita; Keiichi Unno; Kimio Kawaguchi (BIES, 1995)

Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. - Koichi Wada 001; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen 003 (WG, 1995)

Parallel Robust Algorithms for Constructing Strongly Convex Hulls. - Wei Chen 003; Koichi Wada 001; Kimio Kawaguchi (SCG, 1996)

Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. - Koichi Wada 001; Wei Chen 003; Yupin Luo; Kimio Kawaguchi (WG, 1997)

Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs. - Koichi Wada 001; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen 003 (J. Parallel Distributed Comput., 1997)

Finding the Convex Hull of Discs in Parallel. - Wei Chen 003; Koichi Wada 001; Kimio Kawaguchi; Danny Z. Chen (Int. J. Comput. Geom. Appl., 1998)

Efficient Algorithms for a Mixed k-Partition Problem of Graphs Without Specifying Bases. - Koichi Wada 001; Akinari Takaki; Kimio Kawaguchi (Theor. Comput. Sci., 1998)

Parallel Algorithms for Partitioning Sorted Sets and Related Problems. - Danny Z. Chen; Wei Chen 003; Koichi Wada 001; Kimio Kawaguchi (Algorithmica, 2000)

Constructing a Strongly Convex Superhull of Points. - Wei Chen 003; Xiaowen Deng; Koichi Wada 001; Kimio Kawaguchi (Int. J. Comput. Geom. Appl., 2001)

Robust algorithms for constructing strongly convex hulls in parallel. - Wei Chen 003; Koichi Wada 001; Kimio Kawaguchi (Theor. Comput. Sci., 2002)