|
 | Up a level |
Baswana, Surender and Sen, Sandeep and Hariharan, Ramesh (2002) Improved Decremental Algorithms for Maintaining Transitive Closure and Allpairs Shortest Paths. In: of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada, pp. 117-123.
Baswana, Surender and Kavitha, Telikepalli and Mehlhorn, Kurt and Pettie, Seth (2011) Additive Spanners and (alpha, beta)-Spanners. In: ACM Transactions on Algorithms, 7 (1).
Baswana, Surender and Kavitha, Telikepalli (2010) Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. In: SIAM Journal on Computing, 39 (7). pp. 2865-2896.
