A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex Polygon. - Alok Aggarwal; Dina Kravets (Inf. Process. Lett., 1989)

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

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

Efficient Minimum Cost Matching Using Quadrangle Inequality - Alok Aggarwal; Amotz Bar-Noy; Samir Khuller; Dina Kravets; Baruch Schieber (FOCS, 1992)

An optimal hypercube algorithm for the all nearest smaller values problem. - Dina Kravets; C. Greg Plaxton (SPDP, 1994)

Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. - Alok Aggarwal; Amotz Bar-Noy; Samir Khuller; Dina Kravets; Baruch Schieber (J. Algorithms, 1995)

All Nearest Smaller Values on the Hypercube. - Dina Kravets; C. Greg Plaxton (IEEE Trans. Parallel Distributed Syst., 1996)

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

Geometric Pattern Matching Under Euclidean Motion. - L. Paul Chew; Michael T. Goodrich; Daniel P. Huttenlocher; Klara Kedem; Jon M. Kleinberg; Dina Kravets (Comput. Geom., 1997)

Discrete And Computational Geometry. - Ileana Streinu; Károly Bezdek; János Pach; Tamal K. Dey; Jianer Chen; Dina Kravets; Nancy M. Amato; W. Randolph Franklin (Handbook of Discrete and Combinatorial Mathematics, 1999)