Neelesh Khanna

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph

Surender Baswana, Neelesh Khanna, Surender Baswana, 2010, STACS.

Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs

Surender Baswana, Neelesh Khanna, Surender Baswana, 2012, Algorithmica.