Arindam Biswas
PhD student at the Institute of Mathematical Sciences, Chennai, India.
Research Interests
 Parameterized Algorithms
 Graph Theory
 Combinatorial Optimization
 Approximation Algorithms
Papers
 The Complexity of Finding (Approximate Sized) Distanced Dominating Set in Tournaments.
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti.
FAW 2017: Frontiers of Algorithmics.
DOI: 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.
DOI: 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  GitHub  Academia  Google Scholar  ORCID 