default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArindam Biswas 0001
Person information
- affiliation: Technische Universität Ilmenau, Germany
- affiliation: Institute of Mathematical Sciences, Chennai, India
Other persons with the same name
- Arindam Biswas 0002
![[0000-0002-2141-0215]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2141-0215")
— Indian Institute of Engineering Science and Technology, Shibpur, India (and 1 more) - Arindam Biswas 0003 — University of Copenhagen, Denmark (and 2 more)
- Arindam Biswas 0004 — Indian Institute of Technology Kharagpur, India
- Arindam Biswas 0005 — Indian Institute of Technology Roorkee, Department of Architecture and Planning, Roorkee, India
- Arindam Biswas 0006 — Asansol Engineering College, Department of ECE, Asanol, India
- Arindam Biswas 0007 — Kazi Nazrul University, Asansol, India
- Arindam Biswas 0008 — University of South Florida, Department of Electrical Engineering, Tampa, FL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i5]Arindam Biswas, Johannes Meintrup:
Kernelizing Problems on Planar Graphs in Sublinear Space and Polynomial Time. CoRR abs/2307.00996 (2023)- 2022
- [j2]Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
Finding kings in tournaments. Discret. Appl. Math. 322: 240-252 (2022) - 2021
- [j1]Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Approximation in (Poly-) Logarithmic Space. Algorithmica 83(7): 2303-2331 (2021) - [c6]Arindam Biswas, Venkatesh Raman:
Sublinear-Space Approximation Algorithms for Max r-SAT. COCOON 2021: 124-136 - [i4]Arindam Biswas, Venkatesh Raman:
Sublinear-Space Approximation Algorithms for Max r-SAT. CoRR abs/2107.01673 (2021) - [i3]Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Saket Saurabh:
Space-Efficient FPT Algorithms. CoRR abs/2112.15233 (2021) - 2020
- [c5]Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Approximation in (Poly-) Logarithmic Space. MFCS 2020: 16:1-16:15 - [i2]Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Approximation in (Poly-) Logarithmic Space. CoRR abs/2008.04416 (2020)
2010 – 2019
- 2019
- [c4]Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh:
Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS 2019: 8:1-8:20 - [c3]Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Solving Group Interval Scheduling Efficiently. IWOCA 2019: 97-107 - 2017
- [c2]Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman:
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime. CALDAM 2017: 50-59 - [c1]Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. FAW 2017: 22-33 - 2016
- [i1]Arindam Biswas:
A Simple Condition for the Existence of Transversals. CoRR abs/1602.05181 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
