Scholar
Sudeshna Kolay
Google Scholar ID: TIz3qpUAAAAJ
IIT Kharagpur
Citations & Impact
Citations
268
H-index
10
i10-index
10
Publications
20
Co-authors
24
list available
Contact
Publications
Resume (English only)
Academic Achievements
- PhD thesis title: 'Parameterized Complexity of Graph Partitioning and Geometric Covering'
Research Experience
- Joined TU Eindhoven and the Networks group as a postdoc for the period January 2017 - January 2019, and worked under the supervision of Prof. Dr. Mark de Berg; Between March 2019 and October 2019, she joined the Department of Computer Science at Ben-Gurion University of the Negev under the supervision of Dr. Meirav Zehavi.
Education
- Completed Bachelor in Science Degree in Mathematics and Computer Science from Chennai Mathematical Institute, India in 2011; Joined the integrated PhD programme in Theoretical Computer Science at the Institute of Mathematical Sciences, India, and pursued her PhD under the supervision of Prof. Saket Saurabh, mainly concentrating on studying covering and packing problems in the parameterized complexity paradigm.
Background
- Research Interests: Algorithms and Complexity, particularly Parameterized Complexity and Approximation Algorithms. Brief Bio: Sudeshna Kolay is currently an Assistant Professor at the Department of Computer Science and Engineering, IIT Kharagpur.
