Kimio Kawaguchi

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2002
j10		Wei Chen, Koichi Wada, Kimio Kawaguchi: Robust algorithms for constructing strongly convex hulls in parallel. Theor. Comput. Sci. 289(1): 277-295 (2002)
	2001
j9		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
j8		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
j7		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)
j6		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
j5		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)
c7		Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi: Constructing a Strongly Convex Superhull of Points. COCOON 1997: 42-51
c6		Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi: Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. WG 1997: 354-367
	1996
c5		Wei Chen, Koichi Wada, Kimio Kawaguchi: Parallel Robust Algorithms for Constructing Strongly Convex Hulls. Symposium on Computational Geometry 1996: 133-140
c4		Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi: Parallel Algorithms for Partitioning Sorted Sets and Related Problems. ESA 1996: 234-245
	1995
c3		Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen: Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. WG 1995: 197-208
	1994
c2		Koichi Wada, Akinari Takaki, Kimio Kawaguchi: Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. WG 1994: 319-330
	1993
j4		Kimio Kawaguchi, Koichi Wada: New Results in Graph Routing. Inf. Comput. 106(2): 203-233 (1993)
c1		Koichi Wada, Kimio Kawaguchi: Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. WG 1993: 132-143
	1992
j3		Koichi Wada, Kimio Kawaguchi: Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs. Discrete Applied Mathematics 37/38: 539-552 (1992)
j2		Koichi Wada, Yupin Luo, Kimio Kawaguchi: Optimal Fault-Tolerant Routings for Connected Graphs. Inf. Process. Lett. 41(3): 169-174 (1992)
j1		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): 12-22 (1992)

Coauthor Index

1	Danny Z. Chen	[j8] [j7] [c4]
2	Wei Chen 0003	[j10] [j9] [j8] [j7] [j5] [c7] [c6] [c5] [c4] [c3]
3	Xiaowen Deng	[j9] [c7]
4	Takaharu Ikeo	[j5] [c3]
5	Yupin Luo	[c6] [j2]
6	Masahiro Morishita	[j1]
7	Yukio Moritani	[j1]
8	Akinari Takaki	[j6] [c2]
9	Koichi Wada	[j10] [j9] [j8] [j7] [j6] [j5] [c7] [c6] [c5] [c4] [c3] [c2] [j4] [c1] [j3] [j2] [j1]

Last update Sun May 19 16:52:29 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page