An Algorithm to Compute the Minkowski Sum Outer-face of Two Simple Polygons. - G. D. Ramkumar (SCG, 1996)

Sweeping Lines and Line Segments with a Heap. - Julien Basch; Leonidas J. Guibas; G. D. Ramkumar (SCG, 1997)

Algorithms for computing intersection and union of toleranced polygons with applications. - Frédéric Cazals; G. D. Ramkumar (Artif. Intell. Eng. Des. Anal. Manuf., 1997)

Clustering Data Without Distance Functions. - G. D. Ramkumar; Arun N. Swami (IEEE Data Eng. Bull., 1998)

Tracings and their convolution: theory and applications. - G. D. Ramkumar (1998)

Reporting Red - Blue Intersections between Two Sets of Connected Line Segments. - Julien Basch; Leonidas J. Guibas; G. D. Ramkumar (Algorithmica, 2003)

The Virtual Fabrics MIB. - Scott Kipp; G. D. Ramkumar; Keith McCloghrie (RFC, 2006)

Definitions of Managed Objects for iSNS (Internet Storage Name Service). - Kevin Gibbons; G. D. Ramkumar; Scott Kipp (RFC, 2007)