Introduction
I am a fifth year (final year) student in the Department of Computer Science & Engineering, Indian Institute of Technology Kharagpur enrolled in its 5 year programme for Integrated Bachelor and Master in Technology.
I find theoretical computer science the most interesting among all and I am willing to pursue research in it. Since March 2022, I have been working under Prof. Sudeshna Kolay on various problems in computational geometry. In December 2023, I presented our paper on "Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets" in The 34th International Symposium on Algorithms and Computation (ISAAC 2023). Later in 2023-2024, I worked on coming up with polynomial time algorithms for minimum covering of orthogonal polygons with squares; along with proofs of NP Completeness for some other settings.
In Summer of 2024, I worked as a Research Assitant at the Distributed Algorithms group at Aalto University, under the supervision of Prof. Jukka Suomela. We came up with a complete classification of localities for Locally Checkable Labelling problems (LCL's) on rooted regular trees. This work has been accepted and will appear in The 28th International Conference on Principles of Distributed Systems (OPODIS 2024).
In Summer of 2023, I worked as a Research intern at Processor Architecture Laboratory, EPFL where I investigated the opensource software, OpenFPGA.
I was an active participant & problem setter in Competitive Programming [achievments & contributions]. I am also fond of tricky math puzzles and brain teasers.
Previously, I was the Tech Lead of Codeclub, the departmental society of Computer Sc. & Engg. IIT Kharagpur as well as a Governor of Grimoire of Code, the official competitive programming society of IIT Kharagpur. I have been a part of the problem-setting team and the organizing team of multiple competitive programming contests as a part of these societies.
