I am a postdoctoral researcher in the AKT group at TU Berlin, skilled in algorithm design, mathematical modelling, and using various optimization and machine learning tools to solve problems. In addition to conducting research, my main responsibilities here are to help organize courses and supervise students with final-semester theses.
(Preprint) Kernelizing problems on planar graphs in sublinear space and polynomial time
2023
(Preprint) Maximal independent sets in sublinear space and polynomial time
2023
(Preprint) Parametrized Algorithms for Min-Sum Set Cover
2023
Sublinear-Space Approximation Algorithms for Max r-SAT.
Arindam Biswas and Venkatesh Raman.
COCOON 2021: 10.1007/978-3-030-89543-3_11.
Approximation in (Poly-) Logarithmic Space.
Arindam Biswas, Venkatesh Raman and Saket Saurabh.
MFCS 2020: 10.4230/LIPIcs.MFCS.2020.16.
Algorithmica: 10.1007/s00453-021-00826-7.
Solving Group Interval Scheduling Efficiently.
Arindam Biswas, Venkatesh Raman and Saket Saurabh.
IWOCA 2019: 10.1007/978-3-030-25005-8_9.
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments.
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman and Srinivasa Rao Satti.
FAW 2017: 10.1007/978-3-319-59605-1_3.
Discrete Applied Mathematics: 10.1016/j.dam.2022.08.014.
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime.
Arindam Biswas, Varunkumar Jayapaul and Venkatesh Raman.
CALDAM 2017: 10.1007/978-3-319-53007-9_5.
(Note) A Simple Condition for the Existence of Transversals.
Arindam Biswas.
arXiv: 1602.05181.
2016 – 2021 Ph.D. in Computer Science at the Institute of Mathematical Sciences, Chennai, India.
Advisor: Prof. Venkatesh Raman
2014 – 2016 M.Sc. in Computer Science at the Chennai Mathematical Institute, Chennai, India.
2011 – 2014 B.Math. at the Indian Statistical Institute, Bangalore, India.
EMAIL arindam at bsws dot site
NETWORKS ResearchGate | ORCID | Google Scholar | GitHub