3 citations · 5 across the 9 of their papers we have counts for
12 papers
Kernelizing Problems on Planar Graphs in Sublinear Space and Polynomial Time
Arindam Biswas, Johannes Meintrup
In this paper, we devise a scheme for kernelizing, in sublinear space and polynomial time, various problems on planar graphs. The scheme exploits planarity to ensure that the resul…
Space-Efficient FPT Algorithms
Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti +1
We prove algorithmic results showing that a number of natural parameterized problems are in the restricted-space parameterized classes Para-L and FPT+XL. The first class comprises…
Sublinear-Space Approximation Algorithms for Max r-SAT
Arindam Biswas, Venkatesh Raman
In the Max -SAT problem, the input is a CNF formula with variables where each clause is a disjunction of at most literals. The objective is to compute an assignment whic…
A spectral bound for vertex-transitive graphs
Arindam Biswas, Jyoti Prakash Saha
For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which dep…
Expansion in Cayley graphs, Cayley sum graphs and their twists
Arindam Biswas, Jyoti Prakash Saha
The Cayley graphs of finite groups are known to provide several examples of families of expanders, and some of them are Ramanujan graphs. Babai studied isospectral non-isomorphic C…
On non-surjective word maps on
Arindam Biswas, Jyoti Prakash Saha
Jambor--Liebeck--O'Brien showed that there exist non-proper-power word maps which are not surjective on for infinitely many . This provided th…
Approximation in (Poly-) Logarithmic Space
Arindam Biswas, Venkatesh Raman, Saket Saurabh
We develop new approximation algorithms for classical graph and set problems in the RAM model under space constraints. As one of our main results, we devise an algorithm for d-Hitt…
Summarizing User-generated Textual Content: Motivation and Methods for Fairness in Algorithmic Summaries
Abhisek Dash, Anurag Shandilya, Arindam Biswas +3
As the amount of user-generated textual content grows rapidly, text summarization algorithms are increasingly being used to provide users a quick overview of the information conten…
Counting of Shortest Paths in Cubic Grid
Mousumi Dutt, Arindam Biswas, Benedek Nagy
The enumeration of shortest paths in cubic grid is presented herein, which could have importance in image processing and also in the network sciences. The cubic grid considers thre…
A Supervised Authorship Attribution Framework for Bengali Language
Shanta Phani, Shibamouli Lahiri, Arindam Biswas
Authorship Attribution is a long-standing problem in Natural Language Processing. Several statistical and computational methods have been used to find a solution to this problem. I…
A Simple Condition for the Existence of Transversals
Arindam Biswas
Hall's Theorem is a basic result in Combinatorics which states that the obvious necesssary condition for a finite family of sets to have a transversal is also sufficient. We presen…
Inter-Rater Agreement Study on Readability Assessment in Bengali
Shanta Phani, Shibamouli Lahiri, Arindam Biswas
An inter-rater agreement study is performed for readability assessment in Bengali. A 1-7 rating scale was used to indicate different levels of readability. We obtained moderate to…