On the optimality of Krylov information. - Arthur W. Chou (J. Complex., 1987)

Some complexity issues on the simply connected regions of the two-dimensional plane. - Arthur W. Chou; Ker-I Ko (STOC, 1993)

Computational Complexity of Two-Dimensional Regions. - Arthur W. Chou; Ker-I Ko (SIAM J. Comput., 1995)

On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths. - Arthur W. Chou; Ker-I Ko (CCA, 2004)

On the complexity of finding paths in a two-dimensional domain I: Shortest paths. - Arthur W. Chou; Ker-I Ko (Math. Log. Q., 2004)

On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. - Fuxiang Yu; Arthur W. Chou; Ker-I Ko (CCA, 2005)

The computational complexity of distance functions of two-dimensional domains. - Arthur W. Chou; Ker-I Ko (Theor. Comput. Sci., 2005)

On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. - Fuxiang Yu; Arthur W. Chou; Ker-I Ko (J. Complex., 2006)