Aritra Banik

My research primarily lies at the intersection of theoretical computer science and practical algorithm design. My core interests revolve around developing efficient algorithms for challenging computational problems.

• Parameterized Algorithms: Designing algorithms whose running time depends polynomially on the input size but exponentially on a parameter, allowing for efficient solutions to NP-hard problems when the parameter is small.
• Computational Geometry: Exploring algorithmic problems involving geometric objects, including convex hulls, Voronoi diagrams, triangulations, and efficient query structures for spatial data.
• Approximation Algorithms: Devising algorithms that find near-optimal solutions for NP-hard optimization problems within a provable factor of the optimum, especially when an exact solution is computationally intractable.

I am particularly interested in the theoretical underpinnings of these areas and their applications in fields requiring robust and efficient computational solutions.

I am deeply committed to teaching and have offered a range of courses across undergraduate and postgraduate levels at both NISER and IIT Jodhpur. My teaching philosophy centers on building a strong conceptual foundation, cultivating analytical thinking, and bridging the gap between elegant theory and practical relevance, an ongoing challenge I consider both necessary and rewarding.

Courses Taught:

• Computational Geometry
• Discrete Structures and Computation
• Design and Analysis of Algorithms
• Operating Systems
• Discrete Mathematics
• Data Structures
• Selected Topics in Algorithms

I consistently strive to create an engaging learning environment, one where curiosity is encouraged, questions are welcomed (even the late-night ones before exams), and complex topics are unpacked with both clarity and just enough challenge to keep things interesting. My approach emphasizes not just mastering the material, but learning how to think with it.