A Simple Condition for the Existence of Transversals. - Arindam Biswas 001 (CoRR, 2016)

Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime. - Arindam Biswas 001; Varunkumar Jayapaul; Venkatesh Raman 001 (CALDAM, 2017)

The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. - Arindam Biswas 001; Varunkumar Jayapaul; Venkatesh Raman 001; Srinivasa Rao Satti (FAW, 2017)

Parameterized Streaming Algorithms for Min-Ones d-SAT. - Akanksha Agrawal 001; Arindam Biswas 001; Édouard Bonnet; Nick Brettell; Radu Curticapean; Dániel Marx; Tillmann Miltzow; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2019)

Solving Group Interval Scheduling Efficiently. - Arindam Biswas 001; Venkatesh Raman 001; Saket Saurabh 001 (IWOCA, 2019)

Sublinear-Space Approximation Algorithms for Max r-SAT. - Arindam Biswas 001; Venkatesh Raman 001 (COCOON, 2021)

Approximation in (Poly-) Logarithmic Space. - Arindam Biswas 001; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2021)

Space-Efficient FPT Algorithms. - Arindam Biswas 001; Venkatesh Raman 001; Srinivasa Rao Satti; Saket Saurabh 001 (CoRR, 2021)

Finding kings in tournaments. - Arindam Biswas 001; Varunkumar Jayapaul; Venkatesh Raman 001; Srinivasa Rao Satti (Discret. Appl. Math., 2022)

Kernelizing Problems on Planar Graphs in Sublinear Space and Polynomial Time. - Arindam Biswas 001; Johannes Meintrup (CoRR, 2023)