Scholars@Duke

• Background
• 

  Education, Training, & Certifications

  • Ph.D., Massachusetts Institute of Technology 2012
• Research
• 

  Selected Grants

  • CAREER New Directions in Graph Algorithms awarded by  National Science Foundation 2018 - 2023
  • Multi-objective Optimization in Internet Advertising awarded by Google Inc. 2014 - 2022
  • AF: Small: Allocation Algorithms in Online Systems awarded by  National Science Foundation 2015 - 2019
  • AitF: FULL: Collaborative Research: Optimizing Networked Systems with Limited Information awarded by  National Science Foundation 2015 - 2019
• Publications & Artistic Works
• 

  Selected Publications

  • Book Sections

    • Panigrahi, D. "Online Node-Weighted Problems." In Encyclopedia of Algorithms, 1455-1457. 2016.  Full Text
    • Panigrahi, D. "Gomory-Hu Trees." In Encyclopedia of Algorithms, 858-861. 2016.  Full Text
    • Panigrahi, D. "Gomory-Hu Trees." In Encyclopedia of Algorithms, edited by M-Y Kao. Springer, 2008.  Full Text

  • Conference Papers

    • Im, S, Panigrahi, D, Kell, N, and Shadloo, M. "Online load balancing on related machines." June 20, 2018.  Full Text
    • Azar, Y, Cohen, IR, and Panigrahi, D. "Randomized Algorithms for Online Vector Load Balancing." : SIAM, 2018.
    • Azar, Y, Cohen, IR, and Panigrahi, D. "Randomized algorithms for online vector load balancing." January 1, 2018.  Full Text
    • Das, A, Gollapudi, S, Kim, A, Panigrahi, D, and Swamy, C. "Minimizing Latency in Online Ride and Delivery Services." : ACM, 2018.  Full Text
    • Im, S, Kell, N, Panigrahi, D, and Shadloo, M. "Online load balancing on related machines." : ACM, 2018.  Full Text
    • Gollapudi, S, Kumar, R, Panigrahi, D, and Panigrahy, R. "Partitioning orders in online shopping services." November 6, 2017.  Full Text
    • Gollapudi, S, Kollias, K, Panigrahi, D, and Pliatsika, V. "Profit sharing and efficiency in utility games." September 1, 2017.  Full Text
    • Haney, S, Maggs, B, Maiti, B, Panigrahi, D, Rajaraman, R, and Sundaram, R. "Symmetric interdiction for matching problems." August 1, 2017.  Full Text
    • Azar, Y, Ganesh, A, Ge, R, and Panigrahi, D. "Online service with delay." June 19, 2017.  Full Text
    • Gupta, A, Krishnaswamy, R, Kumar, A, and Panigrahi, D. "Online and dynamic algorithms for set cover." June 19, 2017.  Full Text
    • Agarwal, PK, Fox, K, Panigrahi, D, Varadarajan, KR, and Xiao, A. "Faster algorithms for the geometric transportation problem." June 1, 2017.  Full Text
    • Agarwal, PK, Fox, K, Panigrahi, D, Varadarajan, KR, and Xiao, A. "Faster Algorithms for the Geometric Transportation Problem." : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
    • Deng, Y, Panigrahi, D, and Waggoner, B. "The complexity of stable matchings under substitutable preferences." January 1, 2017.
    • Ghaffari, M, Karger, DR, and Panigrahi, D. "Random contractions and sampling for hypergraph and hedge connectivity." January 1, 2017.
    • Gollapudi, S, Kumar, R, Panigrahi, D, and Panigrahy, R. "Partitioning Orders in Online Shopping Services." : ACM, 2017.  Full Text
    • Gupta, A, Krishnaswamy, R, Kumar, A, and Panigrahi, D. "Online and dynamic algorithms for set cover." : ACM, 2017.  Full Text
    • Azar, Y, Buchbinder, N, Chan, THH, Chen, S, Cohen, IR, Gupta, A, Huang, Z, Kang, N, Nagarajan, V, Naor, J, and Panigrahi, D. "Online Algorithms for Covering and Packing Problems with Convex Objectives." December 14, 2016.  Full Text
    • Freeman, R, Haney, S, and Panigrahi, D. "On the price of stability of undirected multicast games." January 1, 2016.  Full Text
    • Kell, N, and Panigrahi, D. "Online Budgeted Allocation with General Budgets." : ACM, 2016.  Full Text
    • Ene, A, Chakrabarty, D, Krishnaswamy, R, and Panigrahi, D. "Online Buy-at-Bulk Network Design." December 11, 2015.  Full Text
    • Im, S, Kell, N, Kulkarni, J, and Panigrahi, D. "Tight Bounds for Online Vector Scheduling." December 11, 2015.  Full Text
    • Azar, Y, Huang, Z, Devanur, NR, and Panigrahi, D. "Speed scaling in the non-clairvoyant model." June 13, 2015.  Full Text
    • Ene, A, Chakrabarty, D, Krishnaswamy, R, and Panigrahi, D. "Online Buy-at-Bulk Network Design." IEEE Computer Society, 2015.  Full Text
    • Im, S, Kell, N, Kulkarni, J, and Panigrahi, D. "Tight Bounds for Online Vector Scheduling." IEEE Computer Society, 2015.  Full Text
    • Bhawalkar, K, Gollapudi, S, and Panigrahi, D. "Online set cover with set requests." January 1, 2014.  Full Text
    • Gollapudi, S, and Panigrahi, D. "Fair allocation in online markets." January 1, 2014.  Full Text
    • Makarychev, K, and Panigrahi, D. "Precedence-Constrained Scheduling of Malleable Jobs with Preemption." Springer, 2014.  Full Text
    • Fung, WS, Hariharan, R, Harvey, NJA, and Panigrahi, D. "A general framework for graph sparsification." ACM, 2011.  Full Text
    • Dutta, P, Jaiswal, S, Panigrahi, D, and Rastogi, R. "A New Channel Assignment Mechanism for Rural Wireless Mesh Networks." IEEE, 2008.  Full Text
    • Naidu, KVM, Panigrahi, D, and Rastogi, R. "Detecting Anomalies Using End-to-End Path Measurements." IEEE, 2008.  Full Text
    • Panigrahi, D, Dutta, P, Jaiswal, S, Naidu, KVM, and Rastogi, R. "Minimum Cost Topology Construction for Rural Wireless Mesh Networks." IEEE, 2008.  Full Text
    • Bhalgat, A, Hariharan, R, Kavitha, T, Panigrahi, D, and ACM, . "An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs." 2007.  Link to Item
    • Hariharan, R, Kavitha, T, and Panigrahi, D. "Efficient algorithms for computing all low s-t edge connectivities and related problems." January 1, 2007.

  • Journal Articles

    • Chakrabarty, D, Ene, A, Krishnaswamy, R, and Panigrahi, D. "Online buy-at-bulk network design." Siam Journal on Computing 47, no. 4 (January 1, 2018): 1505-1528.  Full Text
    • Hajiaghayi, M, Liaghat, V, and Panigrahi, D. "Online Node-weighted Steiner Forest and Extensions via Disk Paintings." SIAM Journal on Computing 46, no. 3 (January 2017): 911-935.  Full Text
    • Kell, N, and Panigrahi, D. "Online budgeted allocation with general budgets." EC 2016 - Proceedings of the 2016 ACM Conference on Economics and Computation (July 21, 2016): 419-436.  Full Text
    • Davidson, SB, Khanna, S, Panigrahi, D, and Roy, S. "Preserving Module Privacy in Workflow Provenance." CoRR abs/1005.5543 (2010).
    • Azar, Y, Cohen, IR, and Panigrahi, D. "Online Covering with Convex Objectives and Applications."  Link to Item
    • Azar, Y, and Panigrahi, D. "Online Load Balancing on Unrelated Machines with Startup Costs."  Link to Item
    • Devanur, N, Makarychev, K, Panigrahi, D, and Yaroslavtsev, G. "Online Algorithms for Machine Minimization."  Link to Item
    • Hariharan, R, and Panigrahi, D. "A Linear-time Algorithm for Sparsification of Unweighted Graphs."  Link to Item

  • Journal Issues

    • "Editorial." Edited by Andoni, A, Panigrahi, D and Pilipczuk, M. Acm Transactions on Algorithms 13, no. 2 (March 21, 2017): 1-1.  Full Text

  • Other Articles

    • Das, A, Gollapudi, S, Kim, A, Panigrahi, D, and Swamy, C. "Minimizing Latency in Online Ride and Delivery Services." Corr abs/1802.02744 (2018).
    • Azar, Y, Ganesh, A, Ge, R, and Panigrahi, D. "Online Service with Delay." Corr abs/1708.05611 (2017).
    • Chawla, S, Naor, J, Panigrahi, D, Singh, M, and Umboh, SW. "Timing Matters: Online Dynamics in Broadcast Games." Corr abs/1611.07745 (2016).
    • Freeman, R, Haney, S, and Panigrahi, D. "On the Price of Stability of Undirected Multicast Games." Corr abs/1610.06515 (2016).

  • Reports

    • Buchbinder, N, Devanur, NR, and Panigrahi, D. Algorithms and Optimization under Uncertainty (NII Shonan Meeting 2017-5). 2017.
• Teaching & Mentoring
• 

  Recent Courses

  • COMPSCI 330: Introduction to the Design and Analysis of Algorithms 2018
  • COMPSCI 590: Advanced Topics in Computer Science 2017
  • COMPSCI 632: Approximation Algorithms 2017

Some information on this profile has been compiled automatically from Duke databases and external sources. (Our About page explains how this works.) If you see a problem with the information, please write to Scholars@Duke and let us know. We will reply promptly.