Gopalakrishnan Sundaram

According to our database, Gopalakrishnan Sundaram authored at least 8 papers between 1993 and 2000.

Collaborative distances:

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

2000

Computing simple paths among obstacles.

Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram

Comput. Geom., 2000

1996

Generating Random Polygons with Given Vertices.

Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell

Comput. Geom., 1996

1995

Recognizing small subgraphs.

Gopalakrishnan Sundaram, Steven Skiena

Networks, 1995

Reconstructing Strings from Substrings.

Steven Skiena, Gopalakrishnan Sundaram

J. Comput. Biol., 1995

Counting Convex Polygons in Planar Point Sets.

Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger

Inf. Process. Lett., 1995

1994

Generating Random x-Monotone Polygons with Given Vertices.

Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Reconstructing Strings from Substrings (Extended Abstract).

Steven Skiena, Gopalakrishnan Sundaram

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

A Partial Digest Approach to Restriction Site Mapping.

Steven Skiena, Gopalakrishnan Sundaram

Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology, 1993