Kimio Kawaguchi

20 papers A 1B 4Misc 1Journal 12Unranked 2
YearRankTypeTitle / Venue / Authors
2002 J jnl
Robust algorithms for constructing strongly convex hulls in parallel.
Theor. Comput. Sci.
Wei Chen, Koichi Wada, Kimio Kawaguchi
2001 J jnl
Constructing a Strongly Convex Superhull of Points.
Int. J. Comput. Geom. Appl.
Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi
2000 J jnl
Parallel Algorithms for Partitioning Sorted Sets and Related Problems.
Algorithmica
Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
1998 J jnl
Efficient Algorithms for a Mixed
Theor. Comput. Sci.
Koichi Wada, Akinari Takaki, Kimio Kawaguchi
1998 J jnl
Finding the Convex Hull of Discs in Parallel.
Int. J. Comput. Geom. Appl.
Wei Chen, Koichi Wada, Kimio Kawaguchi, Danny Z. Chen
1997 Misc conf
Constructing a Strongly Convex Superhull of Points.
COCOON
Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi
1997 J jnl
Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs.
J. Parallel Distributed Comput.
Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen
1997 B conf
Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs.
WG
Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi
1996 A conf
Parallel Algorithms for Partitioning Sorted Sets and Related Problems.
ESA
Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
1996 — conf
Parallel Robust Algorithms for Constructing Strongly Convex Hulls.
SCG
Wei Chen, Koichi Wada, Kimio Kawaguchi
1995 — conf
A Primitive Model of Language Generation by Evolution and Learning.
BIES
Takaya Arita, Keiichi Unno, Kimio Kawaguchi
1995 B conf
Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs.
WG
Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen
1994 B conf
Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases.
WG
Koichi Wada, Akinari Takaki, Kimio Kawaguchi
1993 B conf
Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs.
WG
Koichi Wada, Kimio Kawaguchi
1993 J jnl
New Results in Graph Routing
Inf. Comput.
Kimio Kawaguchi, Koichi Wada
1992 J jnl
Distributed algorithms for connectivity problem of networks with faulty elements.
Syst. Comput. Jpn.
Koichi Wada, Yukio Moritani, Kimio Kawaguchi, Masahiro Morishita
1992 J jnl
Efficient Fault-Tolerant Fixed Routings on (
Discret. Appl. Math.
Koichi Wada, Kimio Kawaguchi
1992 J jnl
Optimal Fault-Tolerant Routings for Connected Graphs.
Inf. Process. Lett.
Koichi Wada, Yupin Luo, Kimio Kawaguchi
1989 J jnl
Maximum lower bound on embedding areas of general graphs.
Syst. Comput. Jpn.
Koichi Wada, Kimio Kawaguchi, Hideyuki Fujishima
1987 J jnl
Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs.
Syst. Comput. Jpn.
Koichi Wada, Kimio Kawaguchi, Yupin Luo