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.

Research Interests: My research interests center on online and streaming algorithms for graph and combinatorial optimization. I am interested in making good decisions as inputs arrive and processing large or evolving inputs with limited time and memory, using approximation, randomization, and instance structure to obtain rigorous guarantees. I also hope to explore how predictions can improve these algorithms while preserving useful guarantees when predictions are inaccurate.