| A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs S Baswana, S Sen Random Structures & Algorithms 30 (4), 532-563, 2007 | 260* | 2007 |
| Additive spanners and (α, β)-spanners S Baswana, T Kavitha, K Mehlhorn, S Pettie ACM Transactions on Algorithms (TALG) 7 (1), 1-26, 2010 | 193* | 2010 |
| Fully Dynamic Maximal Matching in Update Time (Corrected Version) S Baswana, M Gupta, S Sen SIAM Journal on Computing 47 (3), 617-650, 2018 | 170* | 2018 |
| Approximate distance oracles for unweighted graphs in expected O (n 2) time S Baswana, S Sen ACM Transactions on Algorithms (TALG) 2 (4), 557-577, 2006 | 127* | 2006 |
| Faster algorithms for all-pairs approximate shortest paths in undirected graphs S Baswana, T Kavitha SIAM Journal on Computing 39 (7), 2865-2896, 2010 | 126* | 2010 |
| Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths S Baswana, R Hariharan, S Sen Journal of Algorithms 62 (2), 74-92, 2007 | 113* | 2007 |
| Fully dynamic randomized algorithms for graph spanners S Baswana, S Khurana, S Sarkar ACM Transactions on Algorithms (TALG) 8 (4), 1-51, 2012 | 102* | 2012 |
| Streaming algorithm for graph spanners? single pass and constant processing time per edge S Baswana Information Processing Letters 106 (3), 110-114, 2008 | 75 | 2008 |
| Approximate shortest paths avoiding a failed vertex: Near optimal data structures for undirected unweighted graphs S Baswana, N Khanna Algorithmica 66, 18-50, 2013 | 58* | 2013 |
| Computing single source shortest paths using single-objective fitness S Baswana, S Biswas, B Doerr, T Friedrich, PP Kurur, F Neumann Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic …, 2009 | 52 | 2009 |
| Centralized admissions for engineering colleges in India S Baswana, PP Chakrabarti, S Chandran, Y Kanoria, U Patange Proceedings of the 2019 ACM Conference on Economics and Computation, 323-324, 2019 | 51 | 2019 |
| Fault tolerant subgraph for single source reachability: generic and optimal S Baswana, K Choudhary, L Roditty Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 50 | 2016 |
| Dynamic DFS in Undirected Graphs: Breaking the Barrier S Baswana, SR Chaudhury, K Choudhary, S Khan SIAM Journal on Computing 48 (4), 1335-1363, 2019 | 49 | 2019 |
| All-pairs nearly 2-approximate shortest paths in o (n2polylogn) time S Baswana, V Goyal, S Sen Theoretical Computer Science 410 (1), 84-93, 2009 | 44* | 2009 |
| Distance oracles for unweighted graphs: Breaking the quadratic barrier with constant additive error S Baswana, A Gaur, S Sen, J Upadhyay Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008 | 38 | 2008 |
| Maintaining all-pairs approximate shortest paths under deletion of edges S Baswana, R Hariharan, S Sen SODA 3, 394-403, 2003 | 38 | 2003 |
| Fault tolerant reachability for directed graphs S Baswana, K Choudhary, L Roditty Distributed Computing: 29th International Symposium, DISC 2015, Tokyo, Japan …, 2015 | 30 | 2015 |
| Maintaining approximate maximum weighted matching in fully dynamic graphs A Anand, S Baswana, M Gupta, S Sen arXiv preprint arXiv:1207.3976, 2012 | 27 | 2012 |
| Dynamic algorithms for graph spanners S Baswana Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland …, 2006 | 21 | 2006 |
| Single source distance oracle for planar digraphs avoiding a failed node or link S Baswana, U Lath, AS Mehta Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 20 | 2012 |
