| Mincut Sensitivity Data Structures for the Insertion of an Edge. | 0 | 0.34 | 2020 |
| Approximate Single-Source Fault Tolerant Shortest Path | 0 | 0.34 | 2020 |
| Dynamic DFS in Undirected Graphs: breaking the O(m) barrier. | 11 | 0.56 | 2019 |
| Centralized Admissions for Engineering Colleges in India | 0 | 0.34 | 2019 |
| Incremental DFS algorithms: a theoretical and experimental study. | 1 | 0.35 | 2018 |
| Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. | 0 | 0.34 | 2018 |
| Approximate Single Source Fault Tolerant Shortest Path. | 0 | 0.34 | 2018 |
| Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal. | 0 | 0.34 | 2018 |
| Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version). | 3 | 0.39 | 2018 |
| An efficient strongly connected components algorithm in the fault tolerant model. | 1 | 0.36 | 2017 |
| Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs. | 1 | 0.35 | 2017 |
| Fault tolerant subgraph for single source reachability: generic and optimal. | 7 | 0.46 | 2016 |
| Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk). | 0 | 0.34 | 2016 |
| Fault Tolerant Reachability for Directed Graphs. | 7 | 1.01 | 2015 |
| On Dynamic DFS Tree in Directed Graphs | 8 | 0.50 | 2015 |
| Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs. | 10 | 0.67 | 2014 |
| Pertinent path profiling: Tracking interactions among relevant statements | 3 | 0.38 | 2013 |
| Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs. | 11 | 0.63 | 2013 |
| Fully dynamic randomized algorithms for graph spanners | 17 | 0.74 | 2012 |
| Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs | 1 | 0.36 | 2012 |
| Single source distance oracle for planar digraphs avoiding a failed node or link | 5 | 0.44 | 2012 |
| Fully Dynamic Maximal Matching in O(log n) Update Time. | 29 | 1.25 | 2011 |
| Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs | 15 | 0.71 | 2010 |
| Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph | 5 | 0.50 | 2010 |
| Additive spanners and (alpha, beta)-spanners | 7 | 0.43 | 2010 |
| Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. | 0 | 0.34 | 2010 |
| Computing single source shortest paths using single-objective fitness | 20 | 0.90 | 2009 |
| All-pairs nearly 2-approximate shortest paths in I time | 3 | 0.48 | 2009 |
| Streaming algorithm for graph spanners---single pass and constant processing time per edge | 20 | 0.87 | 2008 |
| Implied Set Closure and Its Application to Memory Consistency Verification | 2 | 0.38 | 2008 |
| Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error | 21 | 1.01 | 2008 |
| Fully dynamic algorithm for graph spanners with poly-logarithmic update time | 6 | 0.45 | 2008 |
| A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs | 51 | 1.85 | 2007 |
| Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths | 23 | 1.87 | 2007 |
| Approximate distance oracles for unweighted graphs in expected O(n2) time | 28 | 0.95 | 2006 |
| Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths | 54 | 1.72 | 2006 |
| Faster Streaming algorithms for graph spanners | 3 | 0.40 | 2006 |
| New Constructions Of (Alpha, Beta)-Spanners And Purely Additive Spanners | 4 | 0.52 | 2005 |
| Approximate distance oracles for unweighted graphs in Õ (n2) time | 13 | 0.81 | 2004 |
| Maintaining all-pairs approximate shortest paths under deletion of edges | 18 | 1.02 | 2003 |
| A simple linear time algorithm for computing a (2k - 1)-spanner of o(n1+1/k) size in weighted graphs | 41 | 1.79 | 2003 |
| Planar Graph Blocking for External Searching | 3 | 0.40 | 2002 |
