BITS Pilani

  • Page last updated on Sunday, November 27, 2022



Dr. Manjanna B

Research Interests:
Algorithms, Computational Geometry
Thesis Supervision:
PhD student:
Topic: Algorithms for Euclidean (Obnoxious) Facility Location Problems
BTech Students:
R. Monith Sourya
Topic: The k-Colorable Unit disk Cover Problem
Aman Sepat
Topic: Fast Approximations for Vertex-Edge Dominating Set in Unit Disk Graphs
Abhinand V Chari
Topic: Solving the Euclidean k-dispersion problem with integer programming
Sathyaram G
Topic: local search heuristic for solving k-dispersion on a convex polygon
*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.

Quick Links

    An Institution Deemed to be University estd. vide Sec.3 of the UGC Act,1956 under notification # F.12-23/63.U-2 of Jun 18,1964

    © 2022 Centre for Software Development,SDET Unit, BITS-Pilani, India.

    Designed and developed by fractal | ink design studios