The strong perfect-graph conjecture is true for K1, 3-free graphs. - K. R. Parthasarathy; G. Ravindra (J. Comb. Theory B, 1976)

Perfect product graphs. - G. Ravindra; K. R. Parthasarathy (Discret. Math., 1977)

Perfectness of normal products of graphs. - G. Ravindra (Discret. Math., 1978)

The validity of the strong perfect-graph conjecture for (K4-e)-free graphs. - K. R. Parthasarathy; G. Ravindra (J. Comb. Theory B, 1979)

Problems 121-127. Posed by G. Rayindra. - G. Ravindra (Discret. Math., 1990)

Some classes of strongly perfect graphs. - G. Ravindra (Discret. Math., 1999)

Active Router Approach for Selective Packet Discard of Streamed MPEG Video under Low Bandwidth Conditions. - G. Ravindra; N. Balakrishnan 001; K. R. Ramakrishnan (IEEE International Conference on Multimedia and Expo (II), 2000)

Multi-document Automatic Text Summarization Using Entropy Estimates. - G. Ravindra; N. Balakrishnan 001; K. R. Ramakrishnan (SOFSEM, 2004)