Kimio Kawaguchi

According to our database, Kimio Kawaguchi authored at least 18 papers between 1987 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2002

Robust algorithms for constructing strongly convex hulls in parallel.

Wei Chen, Koichi Wada, Kimio Kawaguchi

Theor. Comput. Sci., 2002

1998

Efficient Algorithms for a Mixed <i>k</i>-Partition Problem of Graphs Without Specifying Bases.

Koichi Wada, Akinari Takaki, Kimio Kawaguchi

Theor. Comput. Sci., 1998

Finding the Convex Hull of Discs in Parallel.

Wei Chen, Koichi Wada, Kimio Kawaguchi, Danny Z. Chen

Int. J. Comput. Geom. Appl., 1998

1997

Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs.

Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen

J. Parallel Distributed Comput., 1997

Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs.

Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Constructing a Strongly Convex Superhull of Points.

Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Parallel Algorithms for Partitioning Sorted Sets and Related Problems.

Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi

Proceedings of the Algorithms, 1996

Parallel Robust Algorithms for Constructing Strongly Convex Hulls.

Wei Chen, Koichi Wada, Kimio Kawaguchi

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs.

Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

A Primitive Model of Language Generation by Evolution and Learning.

Takaya Arita, Keiichi Unno, Kimio Kawaguchi

Proceedings of the 1995 International Workshop on Biologically Inspired Evolutionary Systems, 1995

1994

Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases.

Koichi Wada, Akinari Takaki, Kimio Kawaguchi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993

New Results in Graph Routing

Kimio Kawaguchi, Koichi Wada

Inf. Comput., October, 1993

Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs.

Koichi Wada, Kimio Kawaguchi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

Distributed algorithms for connectivity problem of networks with faulty elements.

Koichi Wada, Yukio Moritani, Kimio Kawaguchi, Masahiro Morishita

Syst. Comput. Jpn., 1992

Optimal Fault-Tolerant Routings for Connected Graphs.

Koichi Wada, Yupin Luo, Kimio Kawaguchi

Inf. Process. Lett., 1992

Efficient Fault-Tolerant Fixed Routings on (<i>k</i> + 1)-Connected Digraphs.

Koichi Wada, Kimio Kawaguchi

Discret. Appl. Math., 1992

1989

Maximum lower bound on embedding areas of general graphs.

Koichi Wada, Kimio Kawaguchi, Hideyuki Fujishima

Syst. Comput. Jpn., 1989

1987

Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs.

Koichi Wada, Kimio Kawaguchi, Yupin Luo

Syst. Comput. Jpn., 1987