Viswanath Nagarajan
Loading Google Thumbnails...
| 2011 |
|---|
| 8 | Minimum Latency Submodular Cover in Metrics. Sungjin Im, Viswanath Nagarajan. CoRR (abs/1110.2207) (2011). Web SearchBibTeXDownload |
| 7 | Min-Max Graph Partitioning and Small Set Expansion. Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz. CoRR (abs/1110.4319) (2011). Web SearchBibTeXDownload |
| 6 | Min-max Graph Partitioning and Small Set Expansion. Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz. FOCS 2011, 17-26. Web SearchBibTeXDownload |
| 5 | The Matroid Median Problem. Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha. SODA 2011, 1117-1130. Web SearchBibTeXDownload |
| 2010 |
|---|
| 4 | When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra. CoRR (abs/1008.5356) (2010). Web SearchBibTeXDownload |
| 3 | When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings. Nikhil Bansal, Anupam Gupta, Viswanath Nagarajan, Atri Rudra. CoRR (abs/1003.0167) (2010). Web SearchBibTeXDownload |
| 2 | When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra. ESA (2) 2010, 218-229. Web SearchBibTeXDownload |
| 2005 |
|---|
| 1 | Fairness and optimality in congestion games. Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan. ACM Conference on Electronic Commerce 2005, 52-57. Web SearchBibTeXDownload |
from DBLP and Google Scholar
