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
297 * 2007 Additive spanners and (α, β)-spanners S Baswana, T Kavitha, K Mehlhorn, S Pettie
ACM Transactions on Algorithms (TALG) 7 (1), 1-26, 2010
211 * 2010 Fully Dynamic Maximal Matching in S Baswana, M Gupta, S Sen
SIAM Journal on Computing 47 (3), 617-650, 2018
193 * 2018 Faster algorithms for all-pairs approximate shortest paths in undirected graphs S Baswana, T Kavitha
SIAM Journal on Computing 39 (7), 2865-2896, 2010
138 * 2010 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
133 * 2006 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
122 * 2007 Fully dynamic randomized algorithms for graph spanners S Baswana, S Khurana, S Sarkar
ACM Transactions on Algorithms (TALG) 8 (4), 1-51, 2012
114 * 2012 Streaming algorithm for graph spanners? single pass and constant processing time per edge S Baswana
Information Processing Letters 106 (3), 110-114, 2008
81 2008 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
73 2019 Approximate shortest paths avoiding a failed vertex: Near optimal data structures for undirected unweighted graphs S Baswana, N Khanna
Algorithmica 66, 18-50, 2013
68 * 2013 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
59 2016 Dynamic DFS in Undirected Graphs: breaking the O(m ) barrier S Baswana, SR Chaudhury, K Choudhary, S Khan
Proceedings of the twenty-seventh Annual ACM-SIAM Symposium on Discrete …, 2016
57 2016 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
54 2009 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
53 * 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
42 2008 Maintaining all-pairs approximate shortest paths under deletion of edges S Baswana, R Hariharan, S Sen
SODA 3, 394-403, 2003
40 2003 Fault tolerant reachability for directed graphs S Baswana, K Choudhary, L Roditty
International Symposium on Distributed Computing, 528-543, 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
European Symposium on Algorithms, 76-87, 2006
23 2006 Approximate single-source fault tolerant shortest path S Baswana, K Choudhary, M Hussain, L Roditty
ACM Transactions on Algorithms (TALG) 16 (4), 1-22, 2020
22 2020 