I am pursuing my PhD in Computer Science from University of California Santa Barbara under Prof. Daniel Lokshtanov.
My research aims to develop efficient algorithms and address the NP-Completeness inherent in modern graph partitioning and resource allocation problems arising from different domains. In my work the term modern strives to broadly address three aspects relevant to problems arising in current times: understanding new combinatorial models of social networks, ensuring algorithmic fairness for graph problems, and designing new algorithmic tools to cope with NP-completeness. Some problems I have worked on include Kidney Exchange, Min k-cut, Fair Bisection, and Database View Materialization. I am also interested in the domain of Databases and Distributed Systems and I am currently exploring this area from a theory and algorithmic viewpoint using my background in Theoretical Computer Science. I have pursued multiple research and Systems & Engineering internships in this domain in the industry. In the past, I obtained an Integrated MSc degree in Theoretical Computer Science from PSG College of Technology, India. During that period, I was fortunate to pursue research under Prof. Venkatesh Raman, Prof. Saket Saurabh and Prof. Jaikumar Radhakrishnan. Apart from research I love to teach and code. I have participated in various coding contests and internships, and taught an algorithms class for 150 undergrads at UCSB. I am also an advocate for diversity in Tech -- I am currently the Board advisor of Women in Computer Science (WiCS) at UCSB. As part of WiCS, I get to organize and be part of events that celebrate diversity and inclusion in tech. |
vaishali_surianarayanan_cv_july_23.pdf |