Travelled to:1 × China
1 × Denmark
2 × Greece
2 × USA
Collaborated with:S.Gollapudi K.Makarychev R.Hariharan M.Hajiaghayi V.Liaghat W.S.Fung N.J.A.Harvey T.Kavitha A.Bhalgat S.B.Davidson S.Khanna T.Milo S.Roy Y.Azar A.Madry T.Moscibroda A.Srinivasan
Talks about:algorithm (2) onlin (2) graph (2) preemption (1) framework (1) construct (1) constrain (1) unweight (1) malleabl (1) bipartit (1)
Person: Debmalya Panigrahi
DBLP: Panigrahi:Debmalya
Contributed to:
2014
2014
2011
201120092007Wrote 7 papers:
- CIKM-2014-GollapudiP #online
- Fair Allocation in Online Markets (SG, DP), pp. 1179–1188.
- ICALP-v1-2014-HajiaghayiLP #algorithm #online #problem
- Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems (MH, VL, DP), pp. 576–587.
- ICALP-v1-2014-MakarychevP #scheduling
- Precedence-Constrained Scheduling of Malleable Jobs with Preemption (KM, DP), pp. 823–834.
- PODS-2011-DavidsonKMPR #privacy
- Provenance views for module privacy (SBD, SK, TM, DP, SR), pp. 175–186.
- STOC-2011-FungHHP #framework #graph
- A general framework for graph sparsification (WSF, RH, NJAH, DP), pp. 71–80.
- ICALP-v2-2009-AzarMMPS #adaptation #network
- Maximum Bipartite Flow in Networks with Adaptive Channel Width (YA, AM, TM, DP, AS), pp. 351–362.
- STOC-2007-HariharanKPB #algorithm #graph
- An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs (RH, TK, DP, AB), pp. 605–614.