Anand Babu.N.B

Contact

Overview

I have submitted my Ph.D. thesis under the guidance of Prof. Sundar Vishwanathan in the Department of Computer Science & Engineering at IIT Bombay. My research interests include extremal combinatorics, graph theory, probabilistic problems on graphs and hypergraphs and applications in theoretical computer science.

Prior to my Ph.D. I was a Junior Research Fellow at Institute of Mathematical Science, Chennai (IMSc. Chennai). I did my M.Tech from IIT Kanpur. My Master's Thesis was under the guidance of Prof. Somenath Biswas, Prof.Nisheeth Vishnoi and Prof. Piyush Kurur. I have spent a brief time as a visiting student at Microsoft Research, Bangalore (MSR India).

Curriculum Vitae

Publications

Teaching

Publications

• Bounds for the Graham-Pollak theorem for hypergraphs.
  Anand Babu and Sundar Vishwanathan.
  Discrete Mathematics 342(11): 3177-3181 (2019).
  
  
  
• Multicovering hypergraphs.
  Anand Babu and Sundar Vishwanathan.
  Discrete Mathematics 344(6): 112386 (2021).



• Improved bounds for covering hypergraphs.
  Anand Babu and Sundar Vishwanathan.
  arxiv preprint - SIAM Journal on Discrete Mathematics (under review)



• Protein Folding Problem on a Grid using Randomized Metropolis Algorithm.
  Advisor: Somenath Biswas, Nisheeth Vishnoi and Piyush Kurur.
  [M.Tech Thesis].



• Covering and Partitioning hypergraphs.
  Advisor: Sundar Vishwanathan
  [Ph.D. Thesis (submitted)].

Teaching Assistant