Arindam Biswas

Orcid: 0000-0003-4721-7971

Affiliations:
  • Technische Universität Ilmenau, Germany
  • Institute of Mathematical Sciences, Chennai, India


According to our database1, Arindam Biswas authored at least 10 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Kernelizing Problems on Planar Graphs in Sublinear Space and Polynomial Time.
CoRR, 2023

2022
Finding kings in tournaments.
Discret. Appl. Math., 2022

2021
Space-Efficient FPT Algorithms.
CoRR, 2021

Approximation in (Poly-) Logarithmic Space.
Algorithmica, 2021

Sublinear-Space Approximation Algorithms for Max r-SAT.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2019
Solving Group Interval Scheduling Efficiently.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Parameterized Streaming Algorithms for Min-Ones d-SAT.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2017
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
A Simple Condition for the Existence of Transversals.
CoRR, 2016


  Loading...