Research Interests:
Algorithms, Computational Geometry
Thesis Supervision:
PhD student:
Topic: Algorithms for Euclidean (Obnoxious) Facility Location Problems
2020-
BTech Students:
R. Monith Sourya
Topic: The k-Colorable Unit disk Cover Problem
2019-2020
Aman SepatTopic: Fast Approximations for Vertex-Edge Dominating Set in Unit Disk Graphs
2020-2021
Abhinand V Chari
Topic: Solving the Euclidean k-dispersion problem with integer programming
2021-2022
Sathyaram G
Topic: A local search heuristic for solving k-dispersion on a convex polygon
2021-2022
*I am always looking for highly motivated, hard-working, and creative students at all Bachelor's, Master's, and Ph.D. levels. Those with a strong foundation in discrete mathematics, and algorithms, know the basics of complexity theory, and are willing to work with me, can get in touch via email. We can then plan a meeting to discuss.