| Connectivity and inference problems for temporal networks D Kempe, J Kleinberg, A Kumar Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 688 | 2000 |
| A simple linear time (1+/spl epsiv/)-approximation algorithm for k-means clustering in any dimensions A Kumar, Y Sabharwal, S Sen 45th Annual IEEE Symposium on Foundations of Computer Science, 454-462, 2004 | 426 | 2004 |
| Provisioning a virtual private network: a network design problem for multicommodity flow A Gupta, J Kleinberg, A Kumar, R Rastogi, B Yener Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 423 | 2001 |
| Maximum coverage problem with group budget constraints and applications C Chekuri, A Kumar International Workshop on Randomization and Approximation Techniques in …, 2004 | 296 | 2004 |
| Clustering with spectral norm and the k-means algorithm A Kumar, R Kannan 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 299-308, 2010 | 264 | 2010 |
| Simpler and better approximation algorithms for network design A Gupta, A Kumar, T Roughgarden Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 217 | 2003 |
| Linear-time approximation schemes for clustering problems in any dimensions A Kumar, Y Sabharwal, S Sen Journal of the ACM (JACM) 57 (2), 1-32, 2010 | 190 | 2010 |
| Algorithms for provisioning virtual private networks in the hose model A Kumar, R Rastogi, A Silberschatz, B Yener IEEE/ACM transactions on networking 10 (4), 565-578, 2002 | 174 | 2002 |
| Primal–dual algorithms for connected facility location problems C Swamy, A Kumar Algorithmica 40 (4), 245-269, 2004 | 161 | 2004 |
| Wavelength conversion in optical networks J Kleinberg, A Kumar Journal of algorithms 38 (1), 25-50, 2001 | 158 | 2001 |
| Algorithms for provisioning virtual private networks in the hose model A Kumar, R Rastogi, A Silberschatz, B Yener Proceedings of the 2001 conference on Applications, technologies …, 2001 | 145 | 2001 |
| Resource augmentation for weighted flow-time explained by dual fitting S Anand, N Garg, A Kumar Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 143 | 2012 |
| Deterministic wavelet thresholding for maximum-error metrics M Garofalakis, A Kumar Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004 | 142 | 2004 |
| Assigning papers to referees N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre Algorithmica 58 (1), 119-136, 2010 | 133 | 2010 |
| Multi-processor scheduling to minimize flow time with ε resource augmentation C Chekuri, A Goel, S Khanna, A Kumar Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 121 | 2004 |
| Approximation algorithms for the unsplittable flow problem A Chakrabarti, C Chekuri, A Gupta, A Kumar Algorithmica 47 (1), 53-78, 2007 | 120 | 2007 |
| Efficient load-balancing routing for wireless mesh networks Y Bejerano, SJ Han, A Kumar Computer Networks 51 (10), 2450-2466, 2007 | 118 | 2007 |
| Online and dynamic algorithms for set cover A Gupta, R Krishnaswamy, A Kumar, D Panigrahi Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 111 | 2017 |
| Tight FPT Approximations for -Median and -Means V Cohen-Addad, A Gupta, A Kumar, E Lee, J Li arXiv preprint arXiv:1904.12334, 2019 | 109 | 2019 |
| Fairness measures for resource allocation A Kumar, J Kleinberg Proceedings 41st annual symposium on foundations of computer science, 75-85, 2000 | 103 | 2000 |
Naveen GargComputer Science and Engineering, IIT DelhiVerified email at cse.iitd.ac.in
