Sundar Vishwanathan 

Professor 
Department of Computer Science and Engineering 
SI-108 (101).
First floor. Opposite Dept. Library. Kresit Building.  
Indian Institute of Technology 
Powai, Mumbai 400076, India 
Telephone: (+91-22) 2576-7727; (+91-22) 2572-2545, Ext 7727. 
Fax: (+91-22) 2579-4290 E-mail: sundar (AT) cse iitb ac in 


Research Interests 
Publicationsa  
Courses I offer 
Other Interests  

 

Research interests 
  
Algorithms, Combinatorics, Complexity Theory.  

Publicationsa


DBLP List of Publications  
  1. Ashish Chiplunkar, Sundar Vishwanathan, On Randomized Memoryless Algorithms for the Weighted k-Server Problem, FOCS, 2013.
  2. Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan, Circumference, chromatic num ber and online coloring, Combinatorica, Vol 33 (3), pp 319-334, 2013.
  3. Sundar Vishwanathan, A counting proof of the Graham-Pollak Theorem, Discrete Mathematics, Vol 313 (6), pp 765-766, 2013.
  4. Ashish Chiplunkar, Sundar Vishwanathan, Metrical Service Systems with Multiple Servers, COCOON, 2013. pp 481-492.
  5. Ayush Choure, Sundar Vishwanathan, Random Walks, Electric Networks and the Transience Class Problem of Sandpiles, SODA , 2012. pp 1593-1611.
  6. Sreyash Kenkre, Sundar Vishwanathan, Approximation Algorithms for the Bipartite Multicut Problem, Information Processing Letters, Vol 110 (8-9), pp 282-287, 2010.
  7. Dhruv Mubayi, Sundar Vishwanathan, Biclique Coverings and the Chromatic Number, Electronic Journal of Combinatorics, Volume 16(1), 2009.
  8. Sundar Vishwanathan, On hard instances of approximate vertex cover, ACM Transactions on Algorithms, 5(1), 2008.
  9. Sundar Vishwanathan, A polynomial space proof of the Graham-Pollak theorem, J. Comb. Theory, Ser. A, 115(4), pp 674-676, 2008.
  10. K. S. Sudeep, Sundar Vishwanathan, Matched-Factor d-Domatic Coloring of Graphs, SIAM J. Discrete Math, 21(4), pp 1071-1082, 2008.
  11. Sreyash Kenkre, Sundar Vishwanathan, The common prefix problem on trees, Information Processing Letters, Vol 105, pp 245-248, 2008.
  12. K. S. Sudeep, Sundar Vishwanathan, Some results on square-free and strong square-free edge-colorings of graphs, Discrete Mathematics, Vol 307, pp 1818-1824, 2007.
  13. Sreyash Kenkre, Sundar Vishwanathan, A bound on the chromatic number using the longest odd cycle length, Journal of Graph Theory, Vol 54, pp 267-276, April 2007.
  14. K. S. Sudeep, Sundar Vishwanathan, A technique for multicoloring triangle-free hexagonal graphs, Discrete Mathematics, Vol 300, pp 256-259, 2005.
  15. Sundar Vishwanathan, `` An Approximation Algorithm for finding a long path in Hamiltonian Graphs,'' Journal of Algorithms, Vol 50, 2004. pp 246-256. An earlier version appeared in Proceedings of the Eleventh Annual ACM-SIAM symposium on Discrete Algorithms, jan 2000.
  16. Sundar Vishwanathan, On 2-Coloring Certain $k$-Uniform Hypergraphs, Jour. Comb. Theory( Series A), Vol 101, pp 168-172, 2003.
  17. Jaikumar Radhakrishnan, Pranab Sen and Sundar Vishwanathan, Depth-3 arithmetic circuits for S_n^2(X) and extensions of the Graham-Pollack theorem, 20th FSTTCS, Lecture Notes in CS, Vol 1974, pp 176--187, 2000.
  18. Arvind Sankar and Sundar Vishwanathan, ``Multilinear Polynomials and a Conjecture of Frankl and Furedi,'' In Journal of Combinatorial Theory A, 5, 1999.
  19. Rina Panigrahy and Sundar Vishwanathan, ``An O(log^* n) approximation algorithm for the asymmetric p-center problem,'' Journal of Algorithms, 27:259--268, 1998. 

Courses that I Generally offer 

  • CS 608  -  Approximation Algorithms 

  •  
  • CS 601 -  Algorithms and Complexity 

  •  
  • CS 614 -  Combinatorics 

  •  
  • CS 201 -  Discrete Structures 

  •  
  • CS 218 -  Design and Analysis of Algorithms 

  •  
  • CS 435 -  Linear Optimization 
Other Interests 
Indian Classical Music. 
 
 
I do not take summer interns.