|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 41 publication records. Showing 41 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Deeparnab Chakrabarty, C. Seshadhri |
Optimal bounds for monotonicity and Lipschitz testing over the hypercube.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy |
Approximability of the Firefighter Problem - Computing Cuts over Time. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, C. Seshadhri |
Optimal bounds for monotonicity and Lipschitz testing over the hypercube |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | David Pritchard, Deeparnab Chakrabarty |
Approximability of Sparse Integer Programs. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna |
Social Welfare in One-sided Matching Markets without Money |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Sampath Kannan |
Variance on the Leaves of a Tree Markov Random Field: Detecting Character Dependencies in Phylogenies |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani |
New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Chaitanya Swamy |
Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
Approximability of Capacitated Network Design. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna |
Social Welfare in One-Sided Matching Markets without Money. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna |
Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian Benson, Deeparnab Chakrabarty, Prasad Tetali |
G-parking functions, acyclic orientations and spanning trees. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna |
Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
Approximability of Capacitated Network Design |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Chaitanya Swamy |
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann |
On Column-restricted and Priority Covering Integer Programs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani |
Design is as Easy as Optimization. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani |
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Gagan Goel |
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Jochen Könemann, David Pritchard |
Hypergraphic LP Relaxations for Steiner Trees. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann |
On Column-Restricted and Priority Covering Integer Programs. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Nikhil R. Devanur |
On competitiveness in uniform utility allocation markets. |
Oper. Res. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna |
On Allocating Goods to Maximize Fairness |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Chinmay Karande, Ashish Sangwan |
The Effect of Malice on the Social Optimum in Linear Load Balancing Games |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Jochen Könemann, David Pritchard |
Hypergraphic LP Relaxations for Steiner Trees |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna |
On Allocating Goods to Maximize Fairness. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Approximation Algorithms, Allocation Problems |
| 1 | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy |
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton |
Algorithms for Message Ferrying on Mobile ad hoc Networks. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang 0010, Changyuan Yu |
Efficiency, Fairness and Competitiveness in Nash Bargaining Games. |
WINE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose |
Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems. |
WINE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose |
Budget constrained bidding in keyword auctions and online knapsack problems. |
WWW |
2008 |
DBLP DOI BibTeX RDF |
keyword bidding, multiple-choice knapsack problem, online knapsack problem, sponsored search auction |
| 1 | Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani |
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Gagan Goel |
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Atish Das Sarma, Deeparnab Chakrabarty, Sreenivas Gollapudi |
Public Advertisement Broker Markets. |
WINE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Nikhil R. Devanur |
On Competitiveness in Uniform Utility Allocation Markets. |
WINE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani |
Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani |
New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets. |
WINE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani |
Design Is as Easy as Optimization. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan |
Fairness and optimality in congestion games. |
ACM Conference on Electronic Commerce |
2005 |
DBLP DOI BibTeX RDF |
fairness, Nash equilibrium, congestion games |
Displaying result #1 - #41 of 41 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")