Deeparnab Chakrabarty
Deeparnab Chakrabarty
Verified email at dartmouth.edu - Homepage
TitleCited byYear
Budget constrained bidding in keyword auctions and online knapsack problems
Y Zhou, D Chakrabarty, R Lukose
Internet and Network Economics, 566-576, 2008
175*2008
On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP
D Chakrabarty, G Goel
SIAM Journal on Computing 39, 2189, 2010
1022010
On allocating goods to maximize fairness
D Chakrabarty, J Chuzhoy, S Khanna
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 107-116, 2009
812009
Approximability of the firefighter problem
E Anshelevich, D Chakrabarty, A Hate, C Swamy
Algorithmica, 1-17, 2010
65*2010
An o(n) Monotonicity Tester for Boolean Functions over the Hypercube
D Chakrabarty, C Seshadhri
SIAM Journal on Computing 45 (2), 461-472, 2016
632016
Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
D Chakrabarty, C Seshadhri
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
58*2013
G-parking functions, acyclic orientations and spanning trees
B Benson, D Chakrabarty, P Tetali
Discrete Mathematics 310 (8), 1340-1353, 2010
562010
Fairness and optimality in congestion games
D Chakrabarty, A Mehta, V Nagarajan, V Vazirani
Electronic Commerce: Proceedings of the 6 th ACM conference on Electronic …, 2005
432005
On column-restricted and priority covering integer programs
D Chakrabarty, E Grant, J Könemann
International Conference on Integer Programming and Combinatorial …, 2010
412010
An optimal lower bound for monotonicity testing over hypergrids
D Chakrabarty, C Seshadhri
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
402013
Social welfare in one-sided matching markets without money
A Bhalgat, D Chakrabarty, S Khanna
Approximation, randomization, and combinatorial optimization. Algorithms and …, 2011
392011
Provable submodular minimization using Wolfe's algorithm
D Chakrabarty, P Jain, P Kothari
Advances in Neural Information Processing Systems, 802-809, 2014
372014
Approximability of Capacitated Network Design
D Chakrabarty, C Chekuri, S Khanna, N Korula
Algorithmica 72 (2), 493-514, 2015
29*2015
Rationality and Strongly Polynomial Solvability of Eisenberg-Gale Markets with Two Agents
D Chakrabarty, NR Devanur, VV Vazirani
SIAM Journal on Discrete Mathematics 24 (3), 1117-1136, 2010
29*2010
Facility location with client latencies: Lp-based techniques for minimum-latency problems
D Chakrabarty, C Swamy
Mathematics of Operations Research 41 (3), 865-883, 2016
28*2016
Welfare maximization and truthfulness in mechanism design with ordinal preferences
D Chakrabarty, C Swamy
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
272014
On (1, ε)-restricted assignment makespan minimization
D Chakrabarty, S Khanna, S Li
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015
252015
Approximability of sparse integer programs
D Pritchard, D Chakrabarty
Algorithmica 61 (1), 75-93, 2011
232011
Hypergraphic lp relaxations for steiner trees
D Chakrabarty, J Könemann, D Pritchard
SIAM Journal on Discrete Mathematics 27 (1), 507-533, 2013
212013
Design is as Easy as Optimization
D Chakrabarty, A Mehta, VV Vazirani
SIAM Journal on Discrete Mathematics 24, 270, 2010
19*2010
The system can't perform the operation now. Try again later.
Articles 1–20