Viswanath Nagarajan Vis

*	2009
19	EE	Inge Li Gørtz, Viswanath Nagarajan, R. Ravi: Minimum Makespan Multi-vehicle Dial-a-Ride. ESA 2009: 540-552
18	EE	Viswanath Nagarajan, Maxim Sviridenko: On the maximum quadratic assignment problem. SODA 2009: 516-524
17	EE	Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Non-monotone submodular maximization under matroid and knapsack constraints. STOC 2009: 323-332
16	EE	Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Non-monotone submodular maximization under matroid and knapsack constraints CoRR abs/0902.0353: (2009)
15	EE	Nikhil Bansal, Nitish Korula, Viswanath Nagarajan: On k-Column Sparse Packing Programs CoRR abs/0908.2256: (2009)
14	EE	Viswanath Nagarajan, Maxim Sviridenko: Tight Bounds for Permutation Flow Shop Scheduling. Math. Oper. Res. 34(2): 417-427 (2009)
	2008
13	EE	Viswanath Nagarajan, R. Ravi: The Directed Minimum Latency Problem. APPROX-RANDOM 2008: 193-206
12	EE	Viswanath Nagarajan, Maxim Sviridenko: Tight Bounds for Permutation Flow Shop Scheduling. IPCO 2008: 154-168
11	EE	Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan: A plant location guide for the unsure. SODA 2008: 1164-1173
10	EE	Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan: Additive guarantees for degree bounded directed network design. STOC 2008: 769-778
9	EE	Viswanath Nagarajan, Abhiram G. Ranade: Exact train pathing. J. Scheduling 11(4): 279-297 (2008)
8	EE	Viswanath Nagarajan: On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem. Theory of Computing 4(1): 191-193 (2008)
	2007
7	EE	Viswanath Nagarajan, R. Ravi: Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. APPROX-RANDOM 2007: 257-270
6	EE	Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k -Forest. ESA 2007: 241-252
5	EE	Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest CoRR abs/0707.0648: (2007)
	2006
4	EE	Viswanath Nagarajan, R. Ravi: Minimum Vehicle Routing with a Common Deadline. APPROX-RANDOM 2006: 212-223
3	EE	Daniel Golovin, Viswanath Nagarajan, Mohit Singh: Approximating the k-multicut problem. SODA 2006: 621-630
	2005
2	EE	Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan: Fairness and optimality in congestion games. ACM Conference on Electronic Commerce 2005: 52-57
1	EE	Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Requirement Cut on Graphs. APPROX-RANDOM 2005: 209-220

Coauthor Index

1	Barbara M. Anthony	[11]
2	Nikhil Bansal	[10] [15]
3	Deeparnab Chakrabarty	[2]
4	Daniel Golovin	[3]
5	Inge Li Gørtz	[19]
6	Vineet Goyal	[11]
7	Anupam Gupta	[5] [6] [11]
8	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[5] [6]
9	Rohit Khandekar	[10]
10	Nitish Korula	[15]
11	Jon Lee	[16] [17]
12	Aranyak Mehta	[2]
13	Vahab S. Mirrokni (Seyed Vahab Mirrokni)	[16] [17]
14	Abhiram G. Ranade	[9]
15	R. Ravi	[1] [4] [5] [6] [7] [13] [19]
16	Mohit Singh	[3]
17	Maxim Sviridenko	[12] [14] [16] [17] [18]

Colors in the list of coauthors