Arindam Biswas
TitleCited byYear
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments
A Biswas, V Jayapaul, V Raman, SR Satti
International Workshop on Frontiers in Algorithmics, 22-33, 2017
Solving Group Interval Scheduling Efficiently
A Biswas, V Raman, S Saurabh
International Workshop on Combinatorial Algorithms, 97-107, 2019
Parameterized Streaming Algorithms for Min-Ones d-SAT
A Agrawal, A Biswas, É Bonnet, N Brettell, R Curticapean, D Marx, ...
39th IARCS Annual Conference on Foundations of Software Technology and …, 2019
A Simple Condition for the Existence of Transversals
A Biswas
arXiv preprint arXiv:1602.05181, 2016
The system can't perform the operation now. Try again later.
Articles 1–4