त्वरित संपर्क
सूरेंद्र बसवाना
PhD (IIT Delhi)
Professor, Department of Computer Science and Engineering
शोध करना दिलचस्पी
Graph algorithms, randomized algorithms, and dynamic algorithms.
Office
CS 307,
Department of Computer Science and Engineering
IIT Kanpur,
Kanpur 208016
विशेषज्ञता
Design and analysis of efficient algorithms.
शिक्षा
PhD, October 2003(Indian Institute of Technology Delhi, Department of Computer Science).Thesis Title: Efficient randomized algorithms for path problems in graphsSupervisor: Prof. Sandeep Sen
M.Tech, 1999(Indian Institute of Technology Delhi, Department of Computer Science)
B.Tech, 1997(Indian Institute of Technology Delhi, Department of Computer Science)
शिक्षण क्षेत्र
Discrete Mathematics
Data Structures and Algorithms
Design and Analysis of Algorithms
Randomized Algorithms
Fundamentals of Computing
चयनित प्रकाशन
Incremental Algorithm for Maintaining a DFS Tree in an Undirected Graphwith Shahbaz Khan.Proc. of 41st International Colloquium on Automata, Languages, and Programming (ICALP), 2014.
Fully Dynamic Randomized Algorithms for Graph Spanners.with S. Khurana, and S. Sarkar, ACM Transaction on Algorithms, volume 8(4): 35, 2012.
Single source distance oracle for planar digraphs avoiding any failed node or link.with Utkarsh Lath and Anuradha S. Mehta.Proc. 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp 223-232, 2012.
Fully dynamic maximal matching in O(log n) update timewith Manoj Gupta and Sandeep Sen.Proc. 52nd IEEE Symposium on Foundations of Computer Science (FOCS), pp 383-392, 2011.
Faster Algorithms for All-Pairs Approximate Shortest Paths in Undirected Graphs.with T. Kavitha.SIAM Journal of Computing, volume 39, issue 7, pp 2865-2896 (2010).
S. Baswana, U. Lath, and A. Mehta. Single source distance oracle for planar digraphs avoiding any failed node or link. Proc. 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 223-232, 2012.
S. Baswana, M. Gupta, and S. Sen. Fully dynamic maximal matching in O(log n) update time. Proc. 52nd IEEE Symposium on Foundations of Computer Science (FOCS), 383-392, 2011.
S. Baswana, S. Khurana, and S. Sarkar. Fully Dynamic Algorithms for Graph Spanners. ACM Transactions on Algorithms 8(4):35, 2012.
S. Baswana and T. Kavitha. Faster Algorithms for All-Pairs Approximate Shortest Paths in Undirected Graphs. SIAM Journal of Computing 39(7), 2865-2896, 2010.
S. Baswana and N. Khanna. Approximate shortest paths under single vertex failure : Optimal size data structures for unweighted graphs. Proc. 27th International Symposium on Theoretical Aspects of Computer Science (STACS), 513-524, 2010. [journal version appeared in Algorithmica 66(1),18-50, 2013]
पुरस्कार एवं फैलोशिप
Award for outstanding PhD dissertation by IBM India Research Lab - 2005.
Young Engineer Award by Indian National Academy of Engineering (INAE) - 2009.
Institute Level Award in Teaching :Gopal Das Bhandari Memorial Outstanding Teacher Award (by the entire graduating batch of 2010).
Departmental Level Awards in Teaching:Best Teacher Award by the graduating batch of CSE IIT Kanpur for the years:(i) 2010 (ii) 2011 (iii) 2012 (iv) 2013
पाठ्येतर गतिविधियां
Jogging (5 km in 27 minutes)
Kite flying (few times in a year)
कीवर्ड
Randomized Algorithms, Dynamic algorithms.
पेशेवर अनुभव
Software Engineer (Feb 1999-November 1999).
Postdoctoral Researcher - Max Planck Institute for Computer Science (October 2003- June 2006).
Assistant Professor - Department of Computer Science and Engineering at IIT Kanpur (2006-2010).
Associate Professor - Department of Computer Science and Engineering at IIT Kanpur (2010 onwards).