Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version) - Alok Aggarwal; James K. Park (FOCS, 1988)

Parallel Searching in Generalized Monge Arrays with Applications. - Alok Aggarwal; Dina Kravets; James K. Park; Sandeep Sen (SPAA, 1990)

Improved Selection on Totally Monotone Arrays. - Yishay Mansour; James K. Park; Baruch Schieber (FSTTCS, 1991)

A Special Case of the n-Vertex Traveling-Salesman Problem that can be Solved in O(n) Time. - James K. Park (Inf. Process. Lett., 1991)

Selection and Sorting in Totally Monotone Arrays. - Dina Kravets; James K. Park (Math. Syst. Theory, 1991)

The Monge array-an abstraction and its applications. - James K. Park (1991)

Becoming a Better Host Through Origami: A Mesh Can Be More Than Rows and Columns. - David S. Greenberg; James K. Park; Eric J. Schwabe (SPDP, 1993)

Finding minimum-quotient cuts in planar graphs. - James K. Park; Cynthia A. Phillips (STOC, 1993)

Improved selection in totally monotone arrays. - Yishay Mansour; James K. Park; Baruch Schieber; Sandeep Sen (Int. J. Comput. Geom. Appl., 1993)

Improved Algorithms for Economic Lot Size Problems. - Alok Aggarwal; James K. Park (Oper. Res., 1993)

Long Tours and Short Superstrings (Preliminary Version) - S. Rao Kosaraju; James K. Park; Clifford Stein 001 (FOCS, 1994)

A Monge Property for the D-dimensional Transportation Problem. - Wolfgang W. Bein; Peter Brucker; James K. Park; Pramod K. Pathak (Discret. Appl. Math., 1995)

The Cost of Complex Communication on Simple Networks. - David S. Greenberg; James K. Park; Eric J. Schwabe (J. Parallel Distributed Comput., 1996)

Parallel Searching in Generalized Monge Arrays. - Alok Aggarwal; Dina Kravets; James K. Park; Sandeep Sen (Algorithmica, 1997)

Fast Algorithms with Algebraic Monge Properties. - Wolfgang W. Bein; Peter Brucker; Lawrence L. Larmore; James K. Park (MFCS, 2002)

The algebraic Monge property and path problems. - Wolfgang W. Bein; Peter Brucker; Lawrence L. Larmore; James K. Park (Discret. Appl. Math., 2005)