G. D. S. Ramkumar

According to our database, G. D. S. Ramkumar authored at least 6 papers between 1990 and 1997.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1997

On Approximating the Longest Path in a Graph.

David R. Karger, Rajeev Motwani, G. D. S. Ramkumar

Algorithmica, 1997

1994

Efficient Parallel Shuffle Recognition.

Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram

Parallel Process. Lett., 1994

1993

On Approximating the Longest Path in a Graph (Preliminary Version).

David R. Karger, Rajeev Motwani, G. D. S. Ramkumar

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992

A Parallel Algorithm for Recognizing the Shuffle of Two Strings.

Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar

Proceedings of the 6th International Parallel Processing Symposium, 1992

1990

Parallel Algorithms on Interval Graphs.

G. D. S. Ramkumar, C. Pandu Rangan

Proceedings of the 1990 International Conference on Parallel Processing, 1990

On Some Largest Empty Orthoconvex Polygons in a Point Set.

Amitava Datta, G. D. S. Ramkumar

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990