Debmalya Panigrahi

Debmalya Panigrahi is a Professor of Computer Science at Duke University and serves as Associate Chair in the Department of Computer Science since 2025. He received his Ph.D. in Theoretical Computer Science from the Massachusetts Institute of Technology (MIT), advised by David Karger, and also studied at the Indian Institute of Science and Jadavpur University.

• Ph.D., MIT, 2012
• Indian Institute of Science
• Jadavpur University

His research focuses on algorithms design and analysis, particularly in graph algorithms (minimum cuts, vertex connectivity, max-flows) and algorithms under uncertainty (online algorithms, learning-augmented frameworks). He also works on approximation algorithms, algorithmic game theory, and practical applications in advertising, AI, and network design.

Recent publications address problems like network unreliability estimation, convex paging with fairness constraints, and hypergraph reliability. His work combines theoretical rigor with practical impact, including patents and prototypes.

• NSF CAREER Award

He has received grants from the National Science Foundation (including multi-objective optimization projects), Google Inc., and the Indo-US Science and Technology Forum. He mentors graduate and undergraduate students, including current PhD candidates Ruoxu Cen and Anish Hebbar.

Panigrahi is affiliated with Duke's theory group and collaborates with CS-econ, AI/ML, and database groups. He recently returned from a sabbatical at Berkeley (Simons Institute and UC Berkeley) and maintains strong ties with industry through roles at Google Research and Microsoft Research.