New ressults on server problems M Chrobak, H Karloof, T Payne, S Vishwnathan SIAM Journal on Discrete Mathematics 4 (2), 172-181, 1991 | 320 | 1991 |

Randomized online graph coloring S Vishwanathan Journal of algorithms 13 (4), 657-669, 1992 | 90 | 1992 |

Locality based graph coloring M Szegedy, S Vishwanathan Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993 | 87 | 1993 |

Competitive algorithms for layered graph traversal A Fiat, DP Foster, H Karloff, Y Rabani, Y Ravid, S Vishwanathan SIAM Journal on Computing 28 (2), 447-462, 1998 | 66 | 1998 |

AnO (log* n) Approximation Algorithm for the Asymmetricp-Center Problem R Panigrahy, S Vishwanathan Journal of Algorithms 27 (2), 259-268, 1998 | 63 | 1998 |

Query scheduling in multi query optimization A Gupta, S Sudarshan, S Vishwanathan Proceedings 2001 International Database Engineering and Applications …, 2001 | 58 | 2001 |

An approximation algorithm for the asymmetric travelling salesman problem with distances one and two S Vishwanathan Information Processing Letters 44 (6), 297-302, 1992 | 57 | 1992 |

A technique for multicoloring triangle-free hexagonal graphs KS Sudeep, S Vishwanathan Discrete Mathematics 300 (1-3), 256-259, 2005 | 33 | 2005 |

An approximation algorithm for finding a long path in Hamiltonian graphs S Vishwanathan Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000 | 28 | 2000 |

A polynomial space proof of the Graham–Pollak theorem S Vishwanathan Elsevier, 2008 | 27 | 2008 |

A counting proof of the Graham Pollak Theorem S Vishwanathan arXiv preprint arXiv:1007.1553, 2010 | 24 | 2010 |

Approximation algorithms for the achromatic number A Chaudhary, S Vishwanathan Journal of Algorithms 41 (2), 404-416, 2001 | 19 | 2001 |

Approximation algorithms for the achromatic number A Chaudhary, S Vishwanathan SODA, 558-563, 1997 | 19 | 1997 |

NP-completeness of undirected Grundy numbering and related problems N Goyal, S Vishwanathan Manuscript, Bombay, 1997 | 19 | 1997 |

An *O*(log^{*}*n*) approximation algorithm for the asymmetric *p*-center problemS Vishwanathan Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, 1-5, 1996 | 19 | 1996 |

On 2-coloring certain k-uniform hypergraphs S Vishwanathan Journal of Combinatorial Theory, Series A 101 (1), 168-172, 2003 | 18 | 2003 |

Constructing reliable communication networks of small weight online B Chandra, S Vishwanathan Journal of Algorithms 18 (1), 159-175, 1995 | 18 | 1995 |

Maximum matching in two, three, and a few more passes over graph streams S Kale, S Tirodkar arXiv preprint arXiv:1702.02559, 2017 | 15 | 2017 |

On randomized algorithms for matching in the online preemptive model A Chiplunkar, S Tirodkar, S Vishwanathan Algorithms-ESA 2015, 325-336, 2015 | 14 | 2015 |

Depth-3 Arithmetic Circuits for *S*_{inn}^{su2} (X) and Extensions of the Graham-Pollack TheoremJ Radhakrishnan, P Sen, S Vishwanathan International Conference on Foundations of Software Technology and …, 2000 | 13 | 2000 |