On Some Largest Empty Orthoconvex Polygons in a Point Set. - Amitava Datta; G. D. S. Ramkumar (FSTTCS, 1990)

Parallel Algorithms on Interval Graphs. - G. D. S. Ramkumar; C. Pandu Rangan (ICPP (3), 1990)

A Parallel Algorithm for Recognizing the Shuffle of Two Strings. - Ahmed Saoudi; Maurice Nivat; C. Pandu Rangan; Ravi Sundaram; G. D. S. Ramkumar (IPPS, 1992)

On Approximating the Longest Path in a Graph (Preliminary Version). - David R. Karger; Rajeev Motwani 001; G. D. S. Ramkumar (WADS, 1993)

Efficient Parallel Shuffle Recognition. - Maurice Nivat; G. D. S. Ramkumar; C. Pandu Rangan; Ahmed Saoudi; Ravi Sundaram (Parallel Process. Lett., 1994)

On Approximating the Longest Path in a Graph. - David R. Karger; Rajeev Motwani 001; G. D. S. Ramkumar (Algorithmica, 1997)