| Maximizing nonmonotone submodular functions under matroid or knapsack constraints J Lee, VS Mirrokni, V Nagarajan, M Sviridenko SIAM Journal on Discrete Mathematics 23 (4), 2053-2078, 2010 | 487* | 2010 |
| When LP is the cure for your matching woes: Improved bounds for stochastic matchings N Bansal, A Gupta, J Li, J Mestre, V Nagarajan, A Rudra Algorithmica 63, 733-762, 2012 | 173 | 2012 |
| Approximation algorithms for distance constrained vehicle routing problems V Nagarajan, R Ravi Networks 59 (2), 209-214, 2012 | 121* | 2012 |
| A stochastic probing problem with applications A Gupta, V Nagarajan Integer Programming and Combinatorial Optimization: 16th International …, 2013 | 114 | 2013 |
| Approximation algorithms for optimal decision trees and adaptive TSP problems A Gupta, V Nagarajan, R Ravi Mathematics of Operations Research 42 (3), 876-896, 2017 | 107 | 2017 |
| Additive Guarantees for Degree-Bounded Directed Network Design N Bansal, R Khandekar, V Nagarajan SIAM Journal on Computing 39 (4), 1413-1431, 2010 | 104 | 2010 |
| Minimum Congestion Mapping in a Cloud N Bansal, KW Lee, V Nagarajan, M Zafer SIAM Journal on Computing 44 (3), 819-843, 2015 | 96* | 2015 |
| Min-max graph partitioning and small set expansion N Bansal, U Feige, R Krauthgamer, K Makarychev, V Nagarajan, J Seffi, ... SIAM Journal on Computing 43 (2), 872-904, 2014 | 95 | 2014 |
| Running errands in time: Approximation algorithms for stochastic orienteering A Gupta, R Krishnaswamy, V Nagarajan, R Ravi Mathematics of Operations Research 40 (1), 56-79, 2015 | 93* | 2015 |
| Solving packing integer programs via randomized rounding with alterations N Bansal, N Korula, V Nagarajan, A Srinivasan Theory of Computing 8 (24), 533-565, 2012 | 93* | 2012 |
| Facility location with matroid or knapsack constraints R Krishnaswamy, A Kumar, V Nagarajan, Y Sabharwal, B Saha Mathematics of Operations Research 40 (2), 446-459, 2015 | 84* | 2015 |
| Online algorithms for covering and packing problems with convex objectives Y Azar, N Buchbinder, THH Chan, S Chen, IR Cohen, A Gupta, Z Huang, ... 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 72 | 2016 |
| Algorithms and adaptivity gaps for stochastic probing A Gupta, V Nagarajan, S Singla Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 72 | 2016 |
| Cross-platform scheduling with long-term fairness and platform-specific optimization KW Hildrum, Z Nabi, V Nagarajan, R Saccone, KK Sarpatwar, R Wagle, ... US Patent 9,886,306, 2018 | 71 | 2018 |
| Adaptivity gaps for stochastic probing: Submodular and XOS functions A Gupta, V Nagarajan, S Singla Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 69 | 2017 |
| Dial a Ride from k-forest A Gupta, MT Hajiaghayi, V Nagarajan, R Ravi ACM Transactions on Algorithms (TALG) 6 (2), 1-21, 2010 | 64 | 2010 |
| The directed orienteering problem V Nagarajan, R Ravi Algorithmica 60 (4), 1017-1030, 2011 | 60* | 2011 |
| Fairness and optimality in congestion games D Chakrabarty, A Mehta, V Nagarajan Proceedings of the 6th ACM Conference on Electronic Commerce, 52-57, 2005 | 60 | 2005 |
| Approximating the k-multicut problem D Golovin, V Nagarajan, M Singh SODA 6, 621-630, 2006 | 59 | 2006 |
| Minimum latency submodular cover S Im, V Nagarajan, RVD Zwaan ACM Transactions on Algorithms (TALG) 13 (1), 1-28, 2016 | 52* | 2016 |
