Arthur W. Chou Vis

*	2006
8	EE	Fuxiang Yu, Arthur W. Chou, Ker-I Ko: On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. J. Complexity 22(6): 803-817 (2006)
	2005
7		Fuxiang Yu, Arthur W. Chou, Ker-I Ko: On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. CCA 2005: 341-355
6	EE	Arthur W. Chou, Ker-I Ko: On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths. Electr. Notes Theor. Comput. Sci. 120: 45-57 (2005)
5	EE	Arthur W. Chou, Ker-I Ko: The computational complexity of distance functions of two-dimensional domains. Theor. Comput. Sci. 337(1-3): 360-369 (2005)
	2004
4	EE	Arthur W. Chou, Ker-I Ko: On the complexity of finding paths in a two-dimensional domain I: Shortest paths. Math. Log. Q. 50(6): 551-572 (2004)
	1995
3		Arthur W. Chou, Ker-I Ko: Computational Complexity of Two-Dimensional Regions. SIAM J. Comput. 24(5): 923-947 (1995)
	1993
2	EE	Arthur W. Chou, Ker-I Ko: Some complexity issues on the simply connected regions of the two-dimensional plane. STOC 1993: 1-10
	1987
1	EE	Arthur W. Chou: On the optimality of Krylov information. J. Complexity 3(1): 26-40 (1987)

Coauthor Index

1	Ker-I Ko	[2] [3] [4] [5] [6] [7] [8]
2	Fuxiang Yu	[7] [8]