 | 2011 |
|---|
| 11 |       | Anand Bhalgat,
Deeparnab Chakrabarty,
Sanjeev Khanna:
Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs.
APPROX-RANDOM 2011: 75-86 |
| 10 | | Anand Bhalgat,
Deeparnab Chakrabarty,
Sanjeev Khanna:
Social Welfare in One-Sided Matching Markets without Money.
APPROX-RANDOM 2011: 87-98 |
| 9 | | Anand Bhalgat,
Ashish Goel,
Sanjeev Khanna:
Improved Approximation Results for Stochastic Knapsack Problems.
SODA 2011: 1647-1665 |
| 8 | | Anand Bhalgat,
Deeparnab Chakrabarty,
Sanjeev Khanna:
Social Welfare in One-sided Matching Markets without Money
CoRR abs/1104.2964: (2011) |
| 7 | | Anand Bhalgat,
Tanmoy Chakraborty,
Sanjeev Khanna:
Mechanism Design with Risk Aversion
CoRR abs/1107.4722: (2011) |
| 2010 |
|---|
| 6 | | Anand Bhalgat,
Tanmoy Chakraborty,
Sanjeev Khanna:
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games.
ACM Conference on Electronic Commerce 2010: 73-82 |
| 5 | | Anand Bhalgat,
Deeparnab Chakrabarty,
Sanjeev Khanna:
Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP
CoRR abs/1011.3770: (2010) |
| 2009 |
|---|
| 4 | | Anand Bhalgat,
Ramesh Hariharan:
Fast edge orientation for unweighted graphs.
SODA 2009: 265-272 |
| 3 | | Anand Bhalgat,
Tanmoy Chakraborty,
Sanjeev Khanna:
Nash Dynamics in Congestion Games with Similar Resources.
WINE 2009: 362-373 |
| 2008 |
|---|
| 2 | | Anand Bhalgat,
Ramesh Hariharan,
Telikepalli Kavitha,
Debmalya Panigrahi:
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.
SODA 2008: 455-464 |
| 2007 |
|---|
| 1 | | Ramesh Hariharan,
Telikepalli Kavitha,
Debmalya Panigrahi,
Anand Bhalgat:
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.
STOC 2007: 605-614 |
Data released under the ODC-BY 1.0 license — See also our legal information page