Viswanath Nagarajan Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

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

Colors in the list of coauthors

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)