Handbook of data structures and applications DP Mehta, S Sahni Chapman and Hall/CRC, 2004 | 256 | 2004 |

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 | 192* | 2007 |

Additive spanners and (α, β)-spanners S Baswana, T Kavitha, K Mehlhorn, S Pettie ACM Transactions on Algorithms (TALG) 7 (1), 1-26, 2010 | 149* | 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 | 116* | 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 | 116* | 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 | 112* | 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 | 87* | 2007 |

Fully dynamic randomized algorithms for graph spanners S Baswana, S Khurana, S Sarkar ACM Transactions on Algorithms (TALG) 8 (4), 1-51, 2012 | 63* | 2012 |

Streaming algorithm for graph spanners? single pass and constant processing time per edge S Baswana Information Processing Letters 106 (3), 110-114, 2008 | 52 | 2008 |

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 | 50 | 2009 |

Approximate shortest paths avoiding a failed vertex: Near optimal data structures for undirected unweighted graphs S Baswana, N Khanna Algorithmica 66 (1), 18-50, 2013 | 45* | 2013 |

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 | 36* | 2009 |

Maintaining all-pairs approximate shortest paths under deletion of edges S Baswana, R Hariharan, S Sen Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete …, 2003 | 33 | 2003 |

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 | 31 | 2016 |

Distance oracles for unweighted graphs: Breaking the quadratic barrier with constant additive error S Baswana, A Gaur, S Sen, J Upadhyay International Colloquium on Automata, Languages, and Programming, 609-621, 2008 | 31 | 2008 |

Dynamic DFS in Undirected Graphs: breaking the O(*m*) barrierS Baswana, SR Chaudhury, K Choudhary, S Khan Proceedings of the twenty-seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 26 | 2016 |

Fault tolerant reachability for directed graphs S Baswana, K Choudhary, L Roditty International Symposium on Distributed Computing, 528-543, 2015 | 22 | 2015 |

Maintaining approximate maximum weighted matching in fully dynamic graphs A Anand, S Baswana, M Gupta, S Sen arXiv preprint arXiv:1207.3976, 2012 | 19 | 2012 |

Dynamic algorithms for graph spanners S Baswana European Symposium on Algorithms, 76-87, 2006 | 19 | 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 | 15 | 2012 |