 | 1997 |
|---|
| 6 |       | David R. Karger,
Rajeev Motwani,
G. D. S. Ramkumar:
On Approximating the Longest Path in a Graph.
Algorithmica 18(1): 82-98 (1997) |
| 1994 |
|---|
| 5 | | Maurice Nivat,
G. D. S. Ramkumar,
C. Pandu Rangan,
Ahmed Saoudi,
Ravi Sundaram:
Efficient Parallel Shuffle Recognition.
Parallel Processing Letters 4: 455-463 (1994) |
| 1993 |
|---|
| 4 | | David R. Karger,
Rajeev Motwani,
G. D. S. Ramkumar:
On Approximating the Longest Path in a Graph (Preliminary Version).
WADS 1993: 421-432 |
| 1992 |
|---|
| 3 | | Ahmed Saoudi,
Maurice Nivat,
C. Pandu Rangan,
Ravi Sundaram,
G. D. S. Ramkumar:
A Parallel Algorithm for Recognizing the Shuffle of Two Strings.
IPPS 1992: 112-115 |
| 1990 |
|---|
| 2 |  | Amitava Datta,
G. D. S. Ramkumar:
On Some Largest Empty Orthoconvex Polygons in a Point Set.
FSTTCS 1990: 270-285 |
| 1 | | G. D. S. Ramkumar,
C. Pandu Rangan:
Parallel Algorithms on Interval Graphs.
ICPP (3) 1990: 72-74 |
