3 citations · 5 across the 9 of their papers we have counts for
4 papers · 1 filter
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…