Manish Acharya

Hello there 👋. I am a third-year undergraduate student at Vanderbilt University, pursuing a double major in Computer Science and Mathematics.

My work lies primarily in theoretical computer science, with a focus on algorithms and complexity theory. I am currently conducting research with Prof. Mark Ellingham on structural graph theory, focusing on proving and refining bounds on pathwidth under forbidden minors and their algorithmic implications. In the SOL Lab with Prof. David Hyde, I study streaming and sublinear algorithms for dynamic geometric data, including time-varying simulation meshes, under resource constraints. I have also worked in the MIND Lab with Prof. Yu Huang and Yifan Zhang on neuro-symbolic methods for mathematical reasoning in large language models. Previously, I collaborated with Prof. Michael Zlatin on approximation algorithms for online connectivity problems.

I also contribute to theory-focused educational videos at PurpleMind.

Research Interests: My research interests focus on the fundamental limits and tradeoffs of efficient algorithms for large-scale graph and optimization problems under resource constraints. I study these questions using approximation, sublinear, and streaming algorithms, together with complexity-theoretic tools.