G. Ravindra

List of publications from the DBLP Bibliography Server - FAQ

2004

6 EE G. Ravindra, N. Balakrishnan, K. R. Ramakrishnan: Multi-document Automatic Text Summarization Using Entropy Estimates. SOFSEM 2004: 289-300

2000

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

1999

4 EE G. Ravindra: Some classes of strongly perfect graphs. Discrete Mathematics 206(1-3): 197-203 (1999)

1990

3 EE G. Ravindra: Problems 121-127. Posed by G. Rayindra. Discrete Mathematics 80(1): 105-109 (1990)

1979

2 EE K. R. Parthasarathy, G. Ravindra: The validity of the strong perfect-graph conjecture for (K₄-e)-free graphs. J. Comb. Theory, Ser. B 26(1): 98-100 (1979)

1976

1 EE K. R. Parthasarathy, G. Ravindra: The strong perfect-graph conjecture is true for K_{1, 3}-free graphs. J. Comb. Theory, Ser. B 21(3): 212-223 (1976)

2004
6	EE	G. Ravindra, N. Balakrishnan, K. R. Ramakrishnan: Multi-document Automatic Text Summarization Using Entropy Estimates. SOFSEM 2004: 289-300
2000
5		G. Ravindra, N. Balakrishnan, K. R. Ramakrishnan: Active Router Approach for Selective Packet Discard of Streamed MPEG Video under Low Bandwidth Conditions. IEEE International Conference on Multimedia and Expo (II) 2000: 739-742
1999
4	EE	G. Ravindra: Some classes of strongly perfect graphs. Discrete Mathematics 206(1-3): 197-203 (1999)
1990
3	EE	G. Ravindra: Problems 121-127. Posed by G. Rayindra. Discrete Mathematics 80(1): 105-109 (1990)
1979
2	EE	K. R. Parthasarathy, G. Ravindra: The validity of the strong perfect-graph conjecture for (K₄-e)-free graphs. J. Comb. Theory, Ser. B 26(1): 98-100 (1979)
1976
1	EE	K. R. Parthasarathy, G. Ravindra: The strong perfect-graph conjecture is true for K_{1, 3}-free graphs. J. Comb. Theory, Ser. B 21(3): 212-223 (1976)

Coauthor Index