|
Search the dblp DataBase
G. D. S. Ramkumar:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- David R. Karger, Rajeev Motwani, G. D. S. Ramkumar
On Approximating the Longest Path in a Graph. [Citation Graph (1, 0)][DBLP] Algorithmica, 1997, v:18, n:1, pp:82-98 [Journal]
- Amitava Datta, G. D. S. Ramkumar
On Some Largest Empty Orthoconvex Polygons in a Point Set. [Citation Graph (0, 0)][DBLP] FSTTCS, 1990, pp:270-285 [Conf]
- G. D. S. Ramkumar, C. Pandu Rangan
Parallel Algorithms on Interval Graphs. [Citation Graph (0, 0)][DBLP] ICPP (3), 1990, pp:72-74 [Conf]
- Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar
A Parallel Algorithm for Recognizing the Shuffle of Two Strings. [Citation Graph (0, 0)][DBLP] IPPS, 1992, pp:112-115 [Conf]
- David R. Karger, Rajeev Motwani, G. D. S. Ramkumar
On Approximating the Longest Path in a Graph (Preliminary Version). [Citation Graph (0, 0)][DBLP] WADS, 1993, pp:421-432 [Conf]
- Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram
Efficient Parallel Shuffle Recognition. [Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1994, v:4, n:, pp:455-463 [Journal]
Search in 0.002secs, Finished in 0.002secs
|