Arindam Biswas
PhD student working with Prof. Venkatesh Raman at the Institute of Mathematical Sciences, Chennai, India.
Research Interests
 Multivariate Algorithmics
 Discrete Mathematics
 Approximation Algorithms
 Combinatorial Optimization
Papers

Solving Group Interval Scheduling Efficiently.
Arindam Biswas, Venkatesh Raman and Saket Saurabh.
IWOCA 2019: International Workshop on Cominatorial Algorithms. 10.1007/9783030250058_9. 
The Complexity of Finding (Approximate Sized) Distanced Dominating Set in Tournaments.
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman and Srinivasa Rao Satti.
FAW 2017: Frontiers of Algorithmics. 10.1007/9783319596051_3. 
Improved Bounds for Poset Sorting in the ForbiddenComparison Regime.
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman.
CALDAM 2017: Algorithms and Discrete Applied Mathematics. 10.1007/9783319530079_5. 
A Simple Condition for the Existence of Transversals.
Arindam Biswas.
arXiv: 1602.05181.
Notes
Education

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.
Contact
EMAIL arindam dot b at ftml dot net
NETWORKS ResearchGate  ORCID  Google Scholar  GitHub  Academia