Items where Author is "Baswana, Surender"

Article

Baswana, Surender ; Gupta, Manoj ; Sen, Sandeep (2011) Fully dynamic maximal matching in O(log n) update time Proceedings - Annual Symposium on Foundations of Computer Science . pp. 383-392. ISSN 0272-5428

Baswana, Surender ; Goyal, Vishrut ; Sen, Sandeep (2009) All-pairs nearly 2-approximate shortest paths in O(n²polylog n) time Theoretical Computer Science, 410 (1). pp. 84-93. ISSN 0304-3975

Baswana, Surender ; Gaur, Akshay ; Sen, Sandeep ; Upadhyay, Jayant (2008) Distance oracles for unweighted graphs: breaking the quadratic barrier with constant additive error 35th International Colloquium on Automata, Languages and Programming .

Baswana, Surender ; Hariharan, Ramesh ; Sen, Sandeep (2007) Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths Journal of Algorithms, 62 (2). pp. 74-92. ISSN 0196-6774

Baswana, Surender ; Sen, Sandeep (2007) A simple linear time algorithm for computing a (2k-1)-spanner of O( n^{1+ 1/k}) size in weighted graphs Random Structures and Algorithms, 30 (4). 532- 563. ISSN 1042-9832

Baswana, Surender ; Sen, Sandeep (2006) Approximate distance oracles for unweighted graphs in expected O(n²) time ACM Transactions on Algorithms, 2 (4). No pp. given. ISSN 1549-6325

Baswana, Surender ; Hariharan, Ramesh ; Sen, Sandeep (2003) Maintaining approximate all-pair-shortest-paths under deletion ACM Proceedings - Annual Symposium on Discrete Algorithms . pp. 394-403. ISSN 1071-9040

Baswana, Surender ; Hariharan, Ramesh ; Sen, Sandeep (2002) Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing . 117 - 123.

Baswana, Surender ; Sen, Sandeep (2002) Planar graph blocking for external searching Algorithmica, 34 (3). pp. 298-308. ISSN 0178-4617

Baswana, Surender ; Sen, Sandeep (2000) Planar graph blocking for external searching Lecture Notes in Computer Science, 1974 . pp. 252-263. ISSN 0302-9743

Conference or Workshop Item

Baswana, Surender ; Hariharan, Ramesh ; Sen, Sandeep (2003) Maintaining all-pairs approximate shortest paths under deletion of edges In: SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland.