PhD student working with Prof. Venkatesh Raman at the Institute of Mathematical Sciences, Chennai, India.
- Multivariate Algorithmics
- Discrete Mathematics
- Approximation Algorithms
- Combinatorial Optimization
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments.
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman and Srinivasa Rao Satti.
FAW 2017: Frontiers of Algorithmics. 10.1007/978-3-319-59605-1_3.
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime.
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman.
CALDAM 2017: Algorithms and Discrete Applied Mathematics. 10.1007/978-3-319-53007-9_5.
A Simple Condition for the Existence of Transversals.
August 2016 – present
PhD in Computer Science at the Institute of Mathematical Sciences, Chennai, India.
August 2014 – June 2016
M.Sc. in Computer Science at the Chennai Mathematical Institute, Chennai, India.
July 2011 – May 2014
B.Math. at the Indian Statistical Institute, Bangalore, India.