Panigrahi Joins Faculty

September 01, 2013

CS is delighted to welcome Debmalya Panigrahi as an assistant professor. Panigrahi comes to us from Microsoft Research in Redmond, where he spent a year as a postdoctoral researcher after receiving his PhD in Computer Science from the Massachusetts Institute of Technology in 2012. Panigrahi grew up in the eastern part of India and earned master's and bachelor's degrees in computer science from the Indian Institute of Science and Jadavpur University, respectively.

Panigrahi's research focuses on the design and analysis of efficient algorithms for fundamental problems in combinatorial optimization. His interests include graph algorithms, where his dissertation research and subsequent work have focused on optimization problems in graph connectivity, and resource allocation problems arising in modern applications (such as data centers and the Internet). Panigrahi also actively pursues collaborations outside theoretical computer science to tackle practical problems that require algorithmic solutions.

He is currently teaching the introductory graduate-level algorithms course and plans also to teach regular undergraduate and graduate courses in algorithms and theoretical computer science. In addition, he is designing new seminar-level courses on graph algorithms and combinatorial optimization.