Sudeshna Kolay completed her Bachelor in Science Degree in Mathematics and Computer Science from Chennai Mathematical Institute, India in the year 2011. After that, she joined the integrated PhD programme in Theoretical Computer Science at the Institute of Mathematical Sciences, India. She pursued her PhD under the supervision of Prof. Saket Saurabh, mainly concentrating on studying covering and packing problems in the parameterized complexity paradigm. The title of her PhD thesis is "Parameterized Complexity of Graph Partitioning and Geometric Covering". After completion of her PhD, she 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. Then, 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. Currently, she is an Assistant Professor at the Department of Computer Science and Engineering, IIT Kharagpur. Her current interests are in Algorithms and Complexity, particularly Parameterized Complexity and Approximation Algorithms.