Debmalya Panigrahi

Graduate Student
Theory of Computation Group
Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology

Office Address
32 Vassar Street
The Stata Center, G-696
Cambridge MA 02139
(617)-258-5791

Home Address
235 Albany Street
Ashdown House #2091 C
Cambridge MA 02139

E-mail: my_first_name AT mit DOT edu

About me

I am a fifth-year graduate student in the theory of computation group at CSAIL, MIT where I am advised by Prof. David Karger. I obtained my master's and bachelor's degrees, both in computer science, from the Indian Institute of Science and Jadavpur University respectively. I have also worked in Bell Labs as a researcher for one year, and have done summer internships at Microsoft Research (Redmond and Silicon Valley) and Google Research (Mountain View). I was born and brought up in India, and did my schooling in the tranquil city of Durgapur and the bustling metropolis of Kolkata, where I went to St. Xavier's School and St. Xavier's College respectively.

I will be graduating in summer 2012.

Update: I will be joining the faculty at Duke University as an Assistant Professor of Computer Science in July 2013 after a postdoctoral stint in the Theory group at Microsoft Research, Redmond.

Resume

[ps, pdf] (last updated on January 16, 2012)

Research

Research Interests

I am interested in theoretical computer science, particularly in the design and analysis of algorithms. I like algorithmic problems with a combinatorial flavor, such as algorithmic graph theory (particularly related to connectivity), resource allocation and scheduling, online and approximation algorithms, and combinatorial optimization.

I also enjoy working on algorithmic problems arising in other areas of computer science such as in web-based applications (e.g. social networks, web search), in wired/wireless networks, database management systems, distributed systems, etc.

Book Chapter

Debmalya Panigrahi.
Gomory-Hu trees.
Encyclopedia of Algorithms 2008.

Journal Article

Yossi Azar, Aleksander Mądry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan.
Maximum Bipartite Flow in Networks with Adaptive Channel Width. [pdf]
Theoretical Computer Science 412(24).
(Special issue for ICALP 2009.)

Conference Publications

Theory

Aleksander Mądry, Debmalya Panigrahi.
The Semi-stochastic Ski-rental Problem. [pdf]
FSTTCS 2011.
Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh.
Online Node-weighted Steiner Tree and Related Problems. [pdf, ppt]
FOCS 2011.
Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi.
A General Framework for Graph Sparsification. [pdf, ppt]
STOC 2011.
Debmalya Panigrahi.
Survivable Network Design Problems in Wireless Networks. [pdf, ppt]
SODA 2011.
Yossi Azar, Aleksander Mądry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan.
Maximum Bipartite Flow in Networks with Adaptive Channel Width. [pdf, ppt]
ICALP 2009.
Invited to special issue of Theoretical Computer Science for ICALP 2009.
David R. Karger, Debmalya Panigrahi.
A Near-Linear Time Algorithm for Constructing a Cactus Representation of Minimum Cuts. [pdf, ppt]
SODA 2009.
Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi.
Fast Edge Splitting and Edmonds' Arborescence Construction for Unweighted Graphs. [pdf, ppt]
SODA 2008.
Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi.
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. [pdf, ppt]
STOC 2007.
Invited to special issue of SIAM Journal of Computing for STOC 2007.
Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi.
Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems. [pdf, ppt]
SODA 2007.

Applied Algorithms

Debmalya Panigrahi, Atish Das Sarma, Gagan Aggarwal, Andrew Tomkins.
Online Selection of Diverse Results. [pdf]
To appear in WSDM 2012.
Susan B. Davidson, Sanjeev Khanna, Tova Milo, Debmalya Panigrahi, Sudeepa Roy.
Provenance Views for Module Privacy. [pdf]
PODS 2011.
Debmalya Panigrahi, Sreenivas Gollapudi.
Result Enrichment in Commerce Search using Browse Trails. [pdf, ppt]
WSDM 2011.
John R. Douceur, James Mickens, Thomas Moscibroda, Debmalya Panigrahi.
Collaborative Measurements of Upload Speeds in P2P Systems. [pdf, ppt]
INFOCOM 2010.
Brief Announcement in PODC 2009.
Partha Dutta, Vivek Mhatre, Debmalya Panigrahi, Rajeev Rastogi.
Joint Routing and Scheduling in Wireless Mesh Networks with Directional Antennas. [pdf, ppt]
INFOCOM 2010 (mini-conference).
John R. Douceur, James Mickens, Thomas Moscibroda, Debmalya Panigrahi.
ThunderDome: Discovering Upload Constraints Using Decentralized Bandwidth Tournaments. [pdf]
CoNEXT 2009.
Debmalya Panigrahi, Bhaskaran Raman.
TDMA Scheduling in Long-Distance WiFi Networks. [pdf]
INFOCOM 2009 (mini-conference).
Debmalya Panigrahi, Partha Dutta, Sharad Jaiswal, K V M Naidu, Rajeev Rastogi.
Minimum Cost Topology Construction for Rural Wireless Mesh Networks. [pdf]
INFOCOM 2008.
K V M Naidu, Debmalya Panigrahi, Rajeev Rastogi.
Detecting Anomalies Using End-to-End Path Measurements. [pdf]
INFOCOM 2008 (mini-conference).
Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, Rajeev Rastogi.
A New Channel Assignment Mechanism for Rural Wireless Mesh Networks. [pdf]
INFOCOM 2008 (mini-conference).
Partha Dutta, Sharad Jaiswal, K V M Naidu, Debmalya Panigrahi, Rajeev Rastogi, Ajay Todimala.
VillageNet: A low-cost, 802.11-based mesh network for rural regions. [pdf]
WISARD 2007. (A workshop held in conjunction with COMSWARE 2007.)
Best paper award.

Co-authors

Gagan Aggarwal, Yossi Azar, Anand Bhalgat, Susan B. Davidson, Atish Das Sarma, John R. Douceur, Partha Dutta, Wai Shing Fung, Sreenivas Gollapudi, Ramesh Hariharan, Nicholas J. A. Harvey, Sharad Jaiswal, David R. Karger, Telikepalli Kavitha, Sanjeev Khanna, Aleksander Mądry, Vivek Mhatre, James Mickens, Tova Milo, Thomas Moscibroda, K.V.M. Naidu, Joseph (Seffi) Naor, Bhaskaran Raman, Rajeev Rastogi, Sudeepa Roy, Mohit Singh, Aravind Srinivasan, Ajay Todimala, Andrew Tomkins.

Talks (excluding conference talks)

Survivable Network Design with Node and Edge Costs
- Theory Seminar, AT&T Labs, Florham Park, NJ, November 2011.
- Theory Seminar, Brown University, Providence, RI, November 2011.
- Theory Seminar, University of Texas, Austin, TX, October 2011.
- Theory Seminar, CMU, Pittsburgh, PA, September 2011.
- Computer Science Colloquium, Duke University, Durham, NC, September 2011.
- Theory Seminar, Georgia Tech, Atlanta, GA, August 2011.
- Theory Seminar, Google Research, Mountain View, CA, August 2011.
- Theory Seminar, IBM Almaden Research Center, San Jose, CA, August 2011.
A General Framework for Graph Sparsification
- Theory Lunch, Carnegie Mellon University, Pittsburgh, PA, March 2012.
- Theory Seminar, Yahoo Research, Santa Clara, CA, May 2011.
- Theory Seminar, Stanford University, Palo Alto, CA, January 2011.
- Theory Seminar, Microsoft Research (Silicon Valley Campus), Mountain View, CA, January 2011.
- Microsoft Research, Bangalore, India, December 2010.
- Reading Group Meeting, Microsoft Research (New England Lab), Cambridge, MA, September 2010.
- IP for Lunch, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, June 2010.
Survivable Network Design Problems for Wireless Networks
- Indian Institute of Science, Bangalore, India, December 2010.
Online Non-metric Facility Location and Related Problems
- Microsoft Research, Redmond, WA, August 2010.
Result Enrichment in Commerce Search using Browse Trails
- Search Labs, Microsoft Research, Mountain View, CA, August 2009.
Maximum Bipartite Flow in Networks with Adaptive Channel Width
- Microsoft Research (Silicon Valley Campus), Mountain View, CA, June 2009.
Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems
- Combinatorics Seminar, Georgia Tech, Atlanta, GA, January 2007.
- Bell Labs, Murray Hill, NJ, January 2007.

Professional Service

I have been an external reviewer for the following conferences: FOCS, STOC, SODA, ICALP, ESA, STACS, LATIN, PODS, VLDB, SIGMOD, ICDM, WWW, INFOCOM, and MASS; and for the following journals: SIAM Journal of Computing, Algorithmica, Theoretical Computer Science, Discrete Applied Mathematics, Computer Networks, and Transactions on Mobile Computing.

Conferences attended (The ones where I presented a paper are shown in bold.)

WSDM 2012, Seattle, WA, USA.
FOCS 2011, Palm Springs, CA, USA.
STOC 2011, San Jose, CA, USA.
WSDM 2011, Hong Kong, P.R.China.
SODA 2011, San Francisco, CA, USA.
FOCS 2010, Las Vegas, NV, USA.
EC 2010, Cambridge, MA, USA.
STOC 2010, Cambridge, MA, USA.
INFOCOM 2010, San Diego, CA, USA.
FOCS 2009, Atlanta, GA, USA.
ICALP 2009, Rhodes, Greece.
SODA 2009, New York, NY, USA.
FOCS 2008, Philadelphia, PA, USA.
SODA 2008, San Francisco, CA, USA.
FOCS 2007, Providence, RI, USA.
STOC 2007, San Diego, CA, USA.
SODA 2007, New Orleans, LA, USA.
FSTTCS 2005, Hyderabad, India.

Travel

I like visiting new places. Here are the places I have visited!

View Debmalya's Travel Map in a larger map

free website hit counter