Dr. Bubai Manna

I am Dr. Bubai Manna and I am an Assistant Professor (Grade I) at VIT Bhopal. I was a research scholar in Theoretical Computer Science at the Department of Mathematics, Indian Institute of Technology Kharagpur (IIT Kharagpur). I defended my Ph.D. thesis titled "A Study of Proximity Problems in Graphical and Geometric Settings" a few months ago. I was also a visiting scholar at NISER Bhubaneswar, India and at the University of Tokyo, Japan.

My research interests lie at the intersection of Graph Theory Algorithms, Computational Geometry, Combinatorial Optimization, and Discrete Mathematics. During my Ph.D., I focused on designing efficient algorithms for proximity problems, including both graphical and geometric settings, as well as coverage problems and bin packing problems arising in these areas. Before joining my PhD program, I completed both an M.Tech in Computer Science and Data Processing, and an M.Sc. in Mathematics from IIT Kharagpur.

Research Interests

Graph Algorithms: Graph algorithms study efficient methods for solving computational problems on graph-structured data, such as connectivity, routing, matching, and optimization tasks. The focus lies on designing provably efficient algorithms, understanding their complexity, and exploring structural properties of graphs. This area often intersects with parameterized complexity and approximation when dealing with hard problems.
Computational Geometry: Computational geometry develops algorithms and data structures for geometric problems involving points, segments, polygons, and higher-dimensional objects. It provides rigorous methods for proximity search, geometric optimization, and spatial reasoning, with strong ties to combinatorial structures. Many problems are computationally challenging, motivating research into approximation, randomized, and FPT algorithms.
Combinatorial Optimization: Combinatorial optimization focuses on selecting optimal objects from a finite but extremely large set, typically under constraints defined by graphs, matroids, or discrete structures. It blends algorithm design with complexity theory to tackle NP-hard problems using approximation, parameterization, or specialized structural insights. The field forms a core part of theoretical computer science, bridging discrete mathematics and algorithms.
Discrete Mathematics: Discrete mathematics provides the foundational theoretical framework for analyzing finite or countable structures. It encompasses areas such as combinatorics, order theory, and discrete probability, which are essential for characterizing the structural properties of objects studied in algorithm design. In this context, the focus is on utilizing combinatorial tools to prove existence, count configurations, and establish the mathematical bounds necessary for rigorous complexity analysis.

Page updated

Google Sites

Report abuse