G. Ravindra

According to our database, G. Ravindra authored at least 8 papers between 1976 and 2004.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2004

Multi-document Automatic Text Summarization Using Entropy Estimates.

G. Ravindra, N. Balakrishnan, K. R. Ramakrishnan

Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

2000

Active Router Approach for Selective Packet Discard of Streamed MPEG Video under Low Bandwidth Conditions.

G. Ravindra, N. Balakrishnan, K. R. Ramakrishnan

Proceedings of the 2000 IEEE International Conference on Multimedia and Expo, 2000

1999

Some classes of strongly perfect graphs.

G. Ravindra

Discret. Math., 1999

1990

Problems 121-127. Posed by G. Rayindra.

G. Ravindra

Discret. Math., 1990

1979

The validity of the strong perfect-graph conjecture for (K₄-e)-free graphs.

K. R. Parthasarathy, G. Ravindra

J. Comb. Theory, Ser. B, 1979

1978

Perfectness of normal products of graphs.

G. Ravindra

Discret. Math., 1978

1977

Perfect product graphs.

G. Ravindra, K. R. Parthasarathy

Discret. Math., 1977

1976

The strong perfect-graph conjecture is true for K_{1, 3}-free graphs.

K. R. Parthasarathy, G. Ravindra

J. Comb. Theory, Ser. B, 1976