Surender Baswana
VIDWAN ID: 53412

Prof Surender Baswana

Male Doctor of Philosophy
Professor | Department of Computer Science and Engineering
Indian Institute of Technology, Kanpur
Uttar Pradesh
Expertise: Computer Science Theory and Methods
55 Publications
0 Projects
1411 Scopus Citations
608 CrossRef
16 Years 8 Months Total Experience
Publications
55 Total
Articles
20
Chapters
3
Proceedings
32
Activity

No publication activity to display.

Scopus Scopus
1,411 Citations
21 h-index
CrossRef CrossRef
608 Citations
14 h-index
Google Scholar Google Scholar

Loading Scholar statistics...

Professional Recognition

Young Engineer Award
2009
Indian National Academy of Engineering (INAE)
Gopal Das Bhandari Memorial Distinguished Teacher Award
2010
Indian Institute of Technology Kanpur
IIT Kanpur Distinguished Teacher Award
2017
Indian Institute of Technology Kanpur
Humboldt Fellowship for Experienced Researchers
2018
Alexander von Humboldt Stiftung/Foundation
Outstanding PhD Dissertation Award
2005
IBM India Research Lab

Community & Membership

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

Personal Details

Doctor of Philosophy
2003
Indian Institute of Technology, Indore
Professor
Jan 2010 – Present
Indian Institute of Technology, Kanpur | Department of Computer Science and Engineering
Engineering and Technology
Computer Science Theory and Methods

Related Profiles

Scholarly Work

No Data Found

There is currently nothing to display here.

Compact and Efficient fault tolerant structures for Directed Graphs

University Indian Institute of Technology Kanpur
Year 2017
Downloads 0

Depth First Search Trees in Dynamic Graphs

University Indian Institute of Technology Kanpur
Year 2017
Downloads 0
No Data Found

There is currently nothing to display here.

Scholarly Publications

Planar graph blocking for external searching

Conference Paper
Year: 2000. Volume: 1974 , Pages: 252-263 .
Authors: Surender Baswana; Sandeep Sen

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths

Conference Paper
Year: 2002. Pages: 117-123 .
Authors: Surender Baswana; Ramesh Hariharan; Sandeep Sen

Planar graph blocking for external searching

Open Access
Journal Article
Algorithmica. Year: 2002. Volume: 34 , Issue: 3 , Pages: 298-308 .
Authors: Surender Baswana; Sandeep Sen

Maintaining all-pairs approximate shortest paths under deletion of edges

Conference Paper
Year: 2003. Pages: 394-403 .

A simple linear time algorithm for computing a (2k - 1)-spanner of O(n1+1/k) size in weighted graphs

Open Access
Journal Article
Year: 2003. Volume: 2719 , Pages: 384-396 .
Authors: Surender Baswana; Sandeep Sen

Approximate Distance Oracles for Unweighted Graphs in Õ(n 2) time

Conference Paper
Year: 2004. Volume: 15 , Pages: 264-273 .

New constructions of (α, β)-spanners and purely additive spanners

Conference Paper
Year: 2005. Pages: 672-681 .

Faster algorithms for approximate distance oracles and all-pairs small stretch paths

Conference Paper
Year: 2006. Pages: 591-600 .
Authors: Surender Baswana; Telikepalli Kavitha
Showing 1 to 8 of 55 publications