375 citations · 494 across the 29 of their papers we have counts for
38 papers
Expansion Lemma -- Variations and Applications to Polynomial-Time Preprocessing
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
In parameterized complexity, it is well-known that a parameterized problem is fixed-parameter tractable if and only if it has a kernel - an instance equivalent to the input instanc…
Dominator Coloring and CD Coloring in Almost Cluster Graphs
Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman
In this paper, we study two popular variants of Graph Coloring -- Dominator Coloring and CD Coloring. In both problems, we are given a graph and a natural number as inpu…
Deletion to Scattered Graph Classes II -- Improved FPT Algorithms for Deletion to Pairs of Graph Classes
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Let be a hereditary graph class. The problem of deletion to , takes as input a graph and asks for a minimum number (or a fixed integer ) of vertices to be deleted fro…
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…
Structural Parameterizations of Budgeted Graph Coloring
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik +1
We introduce a variant of the graph coloring problem, which we denote as {\sc Budgeted Coloring Problem} (\bcp). Given a graph , an integer and an ordered list of integers $…
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…