Kimio Kawaguchi

Publication Activity (10 Years)

Years Active: 1987-2002
Publications (10 Years): 0

Publications

Wei Chen, Koichi Wada, Kimio Kawaguchi
Robust algorithms for constructing strongly convex hulls in parallel. Theor. Comput. Sci. 289 (1) (2002)
Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi
Constructing a Strongly Convex Superhull of Points. Int. J. Comput. Geom. Appl. 11 (5) (2001)
Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
Parallel Algorithms for Partitioning Sorted Sets and Related Problems. Algorithmica 28 (2) (2000)
Wei Chen, Koichi Wada, Kimio Kawaguchi, Danny Z. Chen
Finding the Convex Hull of Discs in Parallel. Int. J. Comput. Geom. Appl. 8 (3) (1998)
Koichi Wada, Akinari Takaki, Kimio Kawaguchi
-Partition Problem of Graphs Without Specifying Bases. Theor. Comput. Sci. 201 (1-2) (1998)
Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi
Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. WG (1997)
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) (1997)
Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi
Constructing a Strongly Convex Superhull of Points. COCOON (1997)
Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
Parallel Algorithms for Partitioning Sorted Sets and Related Problems. ESA (1996)
Wei Chen, Koichi Wada, Kimio Kawaguchi
Parallel Robust Algorithms for Constructing Strongly Convex Hulls. SCG (1996)
Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen
Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. WG (1995)
Takaya Arita, Keiichi Unno, Kimio Kawaguchi
A Primitive Model of Language Generation by Evolution and Learning. BIES (1995)
Koichi Wada, Akinari Takaki, Kimio Kawaguchi
Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. WG (1994)
Kimio Kawaguchi, Koichi Wada
New Results in Graph Routing Inf. Comput. 106 (2) (1993)
Koichi Wada, Kimio Kawaguchi
Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. WG (1993)
Koichi Wada, Kimio Kawaguchi
+ 1)-Connected Digraphs. Discret. Appl. Math. (1992)
Koichi Wada, Yupin Luo, Kimio Kawaguchi
Optimal Fault-Tolerant Routings for Connected Graphs. Inf. Process. Lett. 41 (3) (1992)
Koichi Wada, Yukio Moritani, Kimio Kawaguchi, Masahiro Morishita
Distributed algorithms for connectivity problem of networks with faulty elements. Systems and Computers in Japan 23 (7) (1992)
Koichi Wada, Kimio Kawaguchi, Hideyuki Fujishima
Maximum lower bound on embedding areas of general graphs. Systems and Computers in Japan 20 (10) (1989)
Koichi Wada, Kimio Kawaguchi, Yupin Luo
Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs. Systems and Computers in Japan 18 (11) (1987)