Arthur W. Chou, Ker-I Ko On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:120, n:, pp:45-57 [Journal]

Arthur W. Chou, Ker-I Ko On the complexity of finding paths in a two-dimensional domain I: Shortest paths. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 2004, v:50, n:6, pp:551-572 [Journal]

Arthur W. Chou, Ker-I Ko The computational complexity of distance functions of two-dimensional domains. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:337, n:1-3, pp:360-369 [Journal]

Search in 0.001secs, Finished in 0.002secs

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP