- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j11 |      | Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees. SIAM J. Discrete Math. 27(1): 507-533 (2013) |
| i18 | | Deeparnab Chakrabarty, C. Seshadhri: A o(n) monotonicity tester for Boolean functions over the hypercube. CoRR abs/1302.4536 (2013) |
| i17 | | Deeparnab Chakrabarty, C. Seshadhri: An optimal lower bound for monotonicity testing over hypergrids. CoRR abs/1304.5264 (2013) |
| i16 | | Deeparnab Chakrabarty, C. Seshadhri: A {\huge ${o(n)}$} monotonicity tester for Boolean functions over the hypercube. Electronic Colloquium on Computational Complexity (ECCC) 20: 29 (2013) |
| i15 | | Deeparnab Chakrabarty, C. Seshadhri: An optimal lower bound for monotonicity testing over hypergrids. Electronic Colloquium on Computational Complexity (ECCC) 20: 62 (2013) |
| 2012 | ||
| j10 | | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy: Approximability of the Firefighter Problem - Computing Cuts over Time. Algorithmica 62(1-2): 520-536 (2012) |
| j9 | | Deeparnab Chakrabarty: Review of design of approximation algorithms, by David P. Williamson and David B. Shmoys. SIGACT News 43(4): 52-54 (2012) |
| c20 | | |
| i14 | | Deeparnab Chakrabarty, C. Seshadhri: Optimal bounds for monotonicity and Lipschitz testing over the hypercube. CoRR abs/1204.0849 (2012) |
| i13 | | |
| i12 | | Deeparnab Chakrabarty, C. Seshadhri: Optimal bounds for monotonicity and Lipschitz testing over the hypercube. Electronic Colloquium on Computational Complexity (ECCC) 19: 30 (2012) |
| 2011 | ||
| j8 | | David Pritchard, Deeparnab Chakrabarty: Approximability of Sparse Integer Programs. Algorithmica 61(1): 75-93 (2011) |
| j7 | | 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) |
| c19 | | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs. APPROX-RANDOM 2011: 75-86 |
| c18 | | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Social Welfare in One-Sided Matching Markets without Money. APPROX-RANDOM 2011: 87-98 |
| c17 | | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula: Approximability of Capacitated Network Design. IPCO 2011: 78-91 |
| c16 | | Deeparnab Chakrabarty, Chaitanya Swamy: Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. IPCO 2011: 92-103 |
| i11 | | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Social Welfare in One-sided Matching Markets without Money. CoRR abs/1104.2964 (2011) |
| i10 | | Deeparnab Chakrabarty, Sampath Kannan: Variance on the Leaves of a Tree Markov Random Field: Detecting Character Dependencies in Phylogenies. CoRR abs/1112.5508 (2011) |
| 2010 | ||
| j6 | | Brian Benson, Deeparnab Chakrabarty, Prasad Tetali: G-parking functions, acyclic orientations and spanning trees. Discrete Mathematics 310(8): 1340-1353 (2010) |
| j5 | | 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) |
| j4 | | 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) |
| j3 | | Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani: Design is as Easy as Optimization. SIAM J. Discrete Math. 24(1): 270-286 (2010) |
| j2 | | 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) |
| c15 | | Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann: On Column-Restricted and Priority Covering Integer Programs. IPCO 2010: 355-368 |
| c14 | | Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees. IPCO 2010: 383-396 |
| i9 | | Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann: On Column-restricted and Priority Covering Integer Programs. CoRR abs/1003.1507 (2010) |
| i8 | | 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) |
| i7 | | Deeparnab Chakrabarty, Chaitanya Swamy: Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems. CoRR abs/1009.2452 (2010) |
| i6 | | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula: Approximability of Capacitated Network Design. CoRR abs/1009.5734 (2010) |
| i5 | | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna: Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP. CoRR abs/1011.3770 (2010) |
| 2009 | ||
| j1 | | Deeparnab Chakrabarty, Nikhil R. Devanur: On competitiveness in uniform utility allocation markets. Oper. Res. Lett. 37(3): 155-158 (2009) |
| c13 | | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna: On Allocating Goods to Maximize Fairness. FOCS 2009: 107-116 |
| c12 | | 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 |
| c11 | | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy: Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. ISAAC 2009: 974-983 |
| i4 | | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna: On Allocating Goods to Maximize Fairness. CoRR abs/0901.0205 (2009) |
| i3 | | Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees. CoRR abs/0910.0281 (2009) |
| i2 | | Deeparnab Chakrabarty, Chinmay Karande, Ashish Sangwan: The Effect of Malice on the Social Optimum in Linear Load Balancing Games. CoRR abs/0910.2655 (2009) |
| 2008 | ||
| c10 | | Deeparnab Chakrabarty, Gagan Goel: On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. FOCS 2008: 687-696 |
| c9 | | Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani: New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. IPCO 2008: 344-358 |
| c8 | | Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu: Efficiency, Fairness and Competitiveness in Nash Bargaining Games. WINE 2008: 498-505 |
| c7 | | Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose: Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems. WINE 2008: 566-576 |
| c6 | | Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose: Budget constrained bidding in keyword auctions and online knapsack problems. WWW 2008: 1243-1244 |
| 2007 | ||
| c5 | | Deeparnab Chakrabarty, Nikhil R. Devanur: On Competitiveness in Uniform Utility Allocation Markets. WINE 2007: 374-380 |
| c4 | | Atish Das Sarma, Deeparnab Chakrabarty, Sreenivas Gollapudi: Public Advertisement Broker Markets. WINE 2007: 558-563 |
| 2006 | ||
| c3 | | Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani: Design Is as Easy as Optimization. ICALP (1) 2006: 477-488 |
| c2 | | 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 |
| i1 | | 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 | ||
| c1 | | Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan: Fairness and optimality in congestion games. ACM Conference on Electronic Commerce 2005: 52-57 |
Colors in the list of coauthors
Last update Sat May 25 05:47:12 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page