Overview
Research interests: design and analysis of algorithms, theoretical computer science, combinatorial optimization
Please visit Debmalya Panigrahi's homepage for up-to-date information.
Please visit Debmalya Panigrahi's homepage for up-to-date information.
Current Duke Appointments & Affiliations
Bishop-MacDermott Family Professor of Computer Science
·
2026 - Present
Computer Science,
Trinity College of Arts & Sciences
Professor of Computer Science
·
2022 - Present
Computer Science,
Trinity College of Arts & Sciences
Associate Chair in the Department of Computer Science
·
2025 - Present
Computer Science,
Trinity College of Arts & Sciences
Recent Scholarly Works
Combinatorial Optimization using Comparison Oracles
Conference Proceedings of the Annual ACM Symposium on Theory of Computing · June 9, 2026 In a linear combinatorial optimization problem, we are given a family F C 2U of feasible subsets of a ground set U of n elements, and our goal is to find S∗ = argminSeF «w,1S . Traditionally, we are either given the weight vector up-front, or else we are g ... Full text CiteAn Optimal Algorithm for Stochastic Vertex Cover
Conference Proceedings of the Annual ACM Symposium on Theory of Computing · June 9, 2026 The goal in the stochastic vertex cover problem is to obtain an approximately minimum vertex cover for a graph G∗ that is realized by sampling each edge independently with some probability p∈ (0, 1] in a base graph G = (V, E). The algorithm is given the ba ... Full text CiteFully Dynamic Set Cover: Worst-Case Recourse and Update Time
Conference Proceedings of the Annual ACM Symposium on Theory of Computing · June 9, 2026 We give the first algorithms for fully dynamic set cover with non-trivial worst-case guarantees for both recourse and update time. Specifically, we achieve O(logn) recourse and f· log(n) update time in the worst-case, for both approximation regimes: O(logn ... Full text CiteRecent Grants
Multi-objective Optimization in Internet Advertising
Institutional SupportPrincipal Investigator · Awarded by Google Inc. · 2014 - 2027AF: Small: Algorithms for Graph Cuts
ResearchPrincipal Investigator · Awarded by National Science Foundation · 2023 - 2026Collaborative Research: AF: Medium: Algorithms Meets ML: Mitigating Uncertainty in Optimization
ResearchPrincipal Investigator · Awarded by National Science Foundation · 2020 - 2026View All Grants
Education
Massachusetts Institute of Technology ·
2012
Ph.D.