Key Research Projects:
Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
Research Mentor: Prof. Samir Datta, CS Dept. , Chennai Math Institute, India
Authored Paper : 'Parallel Graph Drawing Algorithm for Bipartite Planar Graphs'
Developed new logarithmic-time parallel algorithm for existing graph drawing problem.
Used Complexity Theory & Graph Theory Methods.
Studied Papadimitriou’s “Computational Complexity” and multiple research papers to build a foundation in complexity theory
Keywords: Computational Complexity ⋅ Parallel Algorithms ⋅ Graph Drawing
Published on arXiv https://arxiv.org/abs/2409.15400
​
Research Internship
Research on Graph Boxicity
Six weeks Research Intern under Prof. Sunil Chandran, Dept. of Computer Science & Automation, Indian Institute of Science
Worked on bounding the boxicity of divisor graphs.
Successfully derived new lower bound on boxicity of divisor graphs with up to 4 separate prime divisiors.
Used Pigeonhole Principle to derive results on lower bound of boxicity of divisor graphs with upto 4 separate prime divisors
Research on Graph Boxicity
​​
Six weeks Research Intern under Prof. Sunil Chandran, Dept. of Computer Science & Automation, Indian Institute of Science IISc, Bangalore
-
Worked on bounding the boxicity of divisor graphs.
-
Successfully derived new lower bound on boxicity of divisor graphs with up to 4 separate prime divisiors.
-
Used Pigeonhole Principle to derive results on lower bound of boxicity of divisor graphs with upto 4 separate prime divisors