Deeparnab Chakrabarty

	2012
39		Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy: Approximability of the Firefighter Problem - Computing Cuts over Time. Algorithmica 62(1-2): 520-536 (2012)
	2011
38		Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs. APPROX-RANDOM 2011: 75-86
37		Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Social Welfare in One-Sided Matching Markets without Money. APPROX-RANDOM 2011: 87-98
36		Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula: Approximability of Capacitated Network Design. IPCO 2011: 78-91
35		Deeparnab Chakrabarty, Chaitanya Swamy: Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. IPCO 2011: 92-103
34		David Pritchard, Deeparnab Chakrabarty: Approximability of Sparse Integer Programs. Algorithmica 61(1): 75-93 (2011)
33		Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Social Welfare in One-sided Matching Markets without Money CoRR abs/1104.2964: (2011)
32		Deeparnab Chakrabarty, Sampath Kannan: Variance on the Leaves of a Tree Markov Random Field: Detecting Character Dependencies in Phylogenies CoRR abs/1112.5508: (2011)
31		Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani: New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. Math. Program. 130(1): 1-32 (2011)
	2010
30		Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann: On Column-Restricted and Priority Covering Integer Programs. IPCO 2010: 355-368
29		Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees. IPCO 2010: 383-396
28		Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann: On Column-restricted and Priority Covering Integer Programs CoRR abs/1003.1507: (2010)
27		Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound CoRR abs/1006.2249: (2010)
26		Deeparnab Chakrabarty, Chaitanya Swamy: Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems CoRR abs/1009.2452: (2010)
25		Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula: Approximability of Capacitated Network Design CoRR abs/1009.5734: (2010)
24		Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP CoRR abs/1011.3770: (2010)
23		Brian Benson, Deeparnab Chakrabarty, Prasad Tetali: G-parking functions, acyclic orientations and spanning trees. Discrete Mathematics 310(8): 1340-1353 (2010)
22		Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. Oper. Res. Lett. 38(6): 567-570 (2010)
21		Deeparnab Chakrabarty, Gagan Goel: On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. SIAM J. Comput. 39(6): 2189-2211 (2010)
20		Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani: Design is as Easy as Optimization. SIAM J. Discrete Math. 24(1): 270-286 (2010)
19		Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani: Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents. SIAM J. Discrete Math. 24(3): 1117-1136 (2010)
	2009
18		Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna: On Allocating Goods to Maximize Fairness. FOCS 2009: 107-116
17		Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton: Algorithms for Message Ferrying on Mobile ad hoc Networks. FSTTCS 2009: 13-24
16		Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy: Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. ISAAC 2009: 974-983
15		Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna: On Allocating Goods to Maximize Fairness CoRR abs/0901.0205: (2009)
14		Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees CoRR abs/0910.0281: (2009)
13		Deeparnab Chakrabarty, Chinmay Karande, Ashish Sangwan: The Effect of Malice on the Social Optimum in Linear Load Balancing Games CoRR abs/0910.2655: (2009)
12		Deeparnab Chakrabarty, Nikhil R. Devanur: On competitiveness in uniform utility allocation markets. Oper. Res. Lett. 37(3): 155-158 (2009)
	2008
11		Deeparnab Chakrabarty, Gagan Goel: On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. FOCS 2008: 687-696
10		Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani: New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. IPCO 2008: 344-358
9		Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu: Efficiency, Fairness and Competitiveness in Nash Bargaining Games. WINE 2008: 498-505
8		Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose: Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems. WINE 2008: 566-576
7		Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose: Budget constrained bidding in keyword auctions and online knapsack problems. WWW 2008: 1243-1244
	2007
6		Deeparnab Chakrabarty, Nikhil R. Devanur: On Competitiveness in Uniform Utility Allocation Markets. WINE 2007: 374-380
5		Atish Das Sarma, Deeparnab Chakrabarty, Sreenivas Gollapudi: Public Advertisement Broker Markets. WINE 2007: 558-563
	2006
4		Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani: Design Is as Easy as Optimization. ICALP (1) 2006: 477-488
3		Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani: New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets. WINE 2006: 239-250
2		Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani: Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity. Electronic Colloquium on Computational Complexity (ECCC) 13(029): (2006)
	2005
1		Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan: Fairness and optimality in congestion games. ACM Conference on Electronic Commerce 2005: 52-57

Coauthor Index

1	Mostafa H. Ammar	[17]
2	Elliot Anshelevich	[16] [39]
3	Brian Benson	[23]
4	Anand Bhalgat	[24] [33] [37] [38]
5	Chandra Chekuri	[25] [36]
6	Julia Chuzhoy	[15] [18]
7	Nikhil R. Devanur	[2] [3] [6] [10] [12] [19] [31]
8	Gagan Goel	[9] [11] [21]
9	Sreenivas Gollapudi	[5]
10	Elyot Grant	[28] [30]
11	Ameya Hate	[16] [39]
12	Subrahmanyam Kalyanasundaram	[17]
13	Sampath Kannan	[32]
14	Chinmay Karande	[13]
15	Sanjeev Khanna	[15] [18] [24] [25] [33] [36] [37] [38]
16	Jochen Könemann	[14] [22] [27] [28] [29] [30]
17	Nitish Korula	[25] [36]
18	Richard J. Lipton	[17]
19	Rajan M. Lukose	[7] [8]
20	Aranyak Mehta	[1] [4] [20]
21	Viswanath Nagarajan	[1]
22	David Pritchard	[14] [22] [27] [29] [34]
23	Ashish Sangwan	[13]
24	Atish Das Sarma	[5] [17]
25	Chaitanya Swamy	[16] [26] [35] [39]
26	Prasad Tetali	[23]
27	Vijay V. Vazirani	[2] [3] [4] [9] [10] [19] [20] [31]
28	Lei Wang	[9]
29	Changyuan Yu	[9]
30	Yunhong Zhou	[7] [8]

Colors in the list of coauthors

Last update Sun Feb 12 22:50:56 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page