Viswanath Nagarajan

	2012
55		Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi: Approximation algorithms for stochastic orienteering. SODA 2012: 1522-1538
54		Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Algorithmica 63(4): 733-762 (2012)
53		Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket: Stochastic Vehicle Routing with Recourse CoRR abs/1202.5797: (2012)
52		Anupam Gupta, Viswanath Nagarajan: Approximating Sparse Covering Integer Programs Online CoRR abs/1205.0175: (2012)
51		Viswanath Nagarajan, R. Ravi: Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2): 209-214 (2012)
	2011
50		Inge Li Gørtz, Viswanath Nagarajan: Locating Depots for Capacitated Vehicle Routing. APPROX-RANDOM 2011: 230-241
49		Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26
48		Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi: Capacitated Vehicle Routing with Non-uniform Speeds. IPCO 2011: 235-247
47		Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer: Minimum congestion mapping in a cloud. PODC 2011: 267-276
46		Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha: The Matroid Median Problem. SODA 2011: 1117-1130
45		Viswanath Nagarajan, R. Ravi: The Directed Orienteering Problem. Algorithmica 60(4): 1017-1030 (2011)
44		Inge Li Gørtz, Viswanath Nagarajan, R. Ravi: Minimum Makespan Multi-vehicle Dial-a-Ride CoRR abs/1102.5450: (2011)
43		Inge Li Gørtz, Viswanath Nagarajan: Locating Depots for Capacitated Vehicle Routing CoRR abs/1103.0985: (2011)
42		Sungjin Im, Viswanath Nagarajan: Minimum Latency Submodular Cover in Metrics CoRR abs/1110.2207: (2011)
41		Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-Max Graph Partitioning and Small Set Expansion CoRR abs/1110.4319: (2011)
	2010
40		Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). ESA (2) 2010: 218-229
39		Anupam Gupta, Viswanath Nagarajan, R. Ravi: Thresholded Covering Algorithms for Robust and Max-min Optimization. ICALP (1) 2010: 262-274
38		Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan: Better Scalable Algorithms for Broadcast Scheduling. ICALP (1) 2010: 324-335
37		Anupam Gupta, Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. ICALP (1) 2010: 690-701
36		Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123
35		Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan: On k-Column Sparse Packing Programs. IPCO 2010: 369-382
34		Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest. ACM Transactions on Algorithms 6(2): (2010)
33		Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Requirement Cut on Graphs. Algorithmica 56(2): 198-213 (2010)
32		Nikhil Bansal, Anupam Gupta, Viswanath Nagarajan, Atri Rudra: When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings CoRR abs/1003.0167: (2010)
31		Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems CoRR abs/1003.0722: (2010)
30		Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds CoRR abs/1003.2977: (2010)
29		Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings CoRR abs/1008.5356: (2010)
28		Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi: Capacitated Vehicle Routing with Non-Uniform Speeds CoRR abs/1012.1850: (2010)
27		Anupam Gupta, Viswanath Nagarajan, R. Ravi: Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets CoRR abs/1012.4962: (2010)
26		Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan: A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems. Math. Oper. Res. 35(1): 79-101 (2010)
25		Viswanath Nagarajan, R. Ravi, Mohit Singh: Simpler analysis of LP extreme points for traveling salesman and survivable network design problems. Oper. Res. Lett. 38(3): 156-160 (2010)
24		Anupam Gupta, Viswanath Nagarajan, R. Ravi: An improved approximation algorithm for requirement cut. Oper. Res. Lett. 38(4): 322-325 (2010)
23		Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. SIAM J. Discrete Math. 23(4): 2053-2078 (2010)
	2009
22		Inge Li Gørtz, Viswanath Nagarajan, R. Ravi: Minimum Makespan Multi-vehicle Dial-a-Ride. ESA 2009: 540-552
21		Viswanath Nagarajan, Maxim Sviridenko: On the maximum quadratic assignment problem. SODA 2009: 516-524
20		Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Non-monotone submodular maximization under matroid and knapsack constraints. STOC 2009: 323-332
19		Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Non-monotone submodular maximization under matroid and knapsack constraints CoRR abs/0902.0353: (2009)
18		Nikhil Bansal, Nitish Korula, Viswanath Nagarajan: On k-Column Sparse Packing Programs CoRR abs/0908.2256: (2009)
17		Anupam Gupta, Viswanath Nagarajan, R. Ravi: Thresholded Covering Algorithms for Robust and Max-Min Optimization CoRR abs/0912.1045: (2009)
16		Viswanath Nagarajan, Maxim Sviridenko: Tight Bounds for Permutation Flow Shop Scheduling. Math. Oper. Res. 34(2): 417-427 (2009)
15		Viswanath Nagarajan, Maxim Sviridenko: On the Maximum Quadratic Assignment Problem. Math. Oper. Res. 34(4): 859-868 (2009)
14		Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan: Additive Guarantees for Degree-Bounded Directed Network Design. SIAM J. Comput. 39(4): 1413-1431 (2009)
	2008
13		Viswanath Nagarajan, R. Ravi: The Directed Minimum Latency Problem. APPROX-RANDOM 2008: 193-206
12		Viswanath Nagarajan, Maxim Sviridenko: Tight Bounds for Permutation Flow Shop Scheduling. IPCO 2008: 154-168
11		Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan: A plant location guide for the unsure. SODA 2008: 1164-1173
10		Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan: Additive guarantees for degree bounded directed network design. STOC 2008: 769-778
9		Viswanath Nagarajan, Abhiram G. Ranade: Exact train pathing. J. Scheduling 11(4): 279-297 (2008)
8		Viswanath Nagarajan: On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem. Theory of Computing 4(1): 191-193 (2008)
	2007
7		Viswanath Nagarajan, R. Ravi: Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. APPROX-RANDOM 2007: 257-270
6		Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k -Forest. ESA 2007: 241-252
5		Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest CoRR abs/0707.0648: (2007)
	2006
4		Viswanath Nagarajan, R. Ravi: Minimum Vehicle Routing with a Common Deadline. APPROX-RANDOM 2006: 212-223
3		Daniel Golovin, Viswanath Nagarajan, Mohit Singh: Approximating the k-multicut problem. SODA 2006: 621-630
	2005
2		Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan: Fairness and optimality in congestion games. ACM Conference on Electronic Commerce 2005: 52-57
1		Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Requirement Cut on Graphs. APPROX-RANDOM 2005: 209-220

Coauthor Index

1	Barbara M. Anthony	[11] [26]
2	Nikhil Bansal	[10] [14] [18] [29] [30] [32] [35] [36] [38] [40] [41] [47] [49] [54]
3	Deeparnab Chakrabarty	[2]
4	Uriel Feige	[41] [49]
5	Daniel Golovin	[3]
6	Inge Li Gørtz	[22] [28] [43] [44] [48] [50] [53]
7	Vineet Goyal	[11] [26]
8	Anupam Gupta	[5] [6] [11] [17] [24] [26] [27] [29] [31] [32] [34] [37] [39] [40] [52] [54] [55]
9	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[5] [6] [34]
10	Sungjin Im	[42]
11	Rohit Khandekar	[10] [14] [30] [36]
12	Jochen Könemann	[30] [36]
13	Nitish Korula	[18] [35]
14	Robert Krauthgamer	[41] [49]
15	Ravishankar Krishnaswamy	[31] [38] [46] [55]
16	Amit Kumar	[46]
17	Jon Lee	[19] [20] [23]
18	Kang-Won Lee	[47]
19	Jian Li	[29] [40] [54]
20	Konstantin Makarychev	[41] [49]
21	Aranyak Mehta	[2]
22	Julián Mestre	[29] [40] [54]
23	Vahab S. Mirrokni (Seyed Vahab Mirrokni)	[19] [20] [23]
24	Marco Molinaro	[28] [48]
25	Joseph Naor (Seffi Naor)	[41] [49]
26	Britta Peis	[30] [36]
27	Abhiram G. Ranade	[9]
28	R. Ravi	[1] [4] [5] [6] [7] [13] [17] [22] [24] [25] [27] [28] [31] [33] [34] [37] [39] [44] [45] [48] [51] [55]
29	Atri Rudra	[29] [32] [40] [54]
30	Yogish Sabharwal	[46]
31	Barna Saha	[46]
32	Rishi Saket	[53]
33	Roy Schwartz	[41] [49]
34	Mohit Singh	[3] [25]
35	Aravind Srinivasan	[35]
36	Maxim Sviridenko	[12] [15] [16] [19] [20] [21] [23]
37	Murtaza Zafer	[47]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page