1 citations · 1 across the 5 of their papers we have counts for
6 papers
On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem
Saket Saurabh, Prafullkumar Tale
In the \textsc{Maximum Degree Contraction} problem, input is a graph on vertices, and integers , and the objective is to check whether can be transformed into a g…
On the Parameterized Complexity Of Grid Contraction
Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
For a family of graphs , the -\textsc{Contraction} problem takes as an input a graph and an integer , and the goal is to decide if there exists $F…
Parameterized Complexity of Maximum Edge Colorable Subgraph
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu +2
A graph is {\em -edge colorable} if there is a coloring , such that for distinct , we have . The {\sc…
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov +2
A graph operation that {\em contracts edges} is one of the fundamental operations in the theory of graph minors. Parameterized Complexity of editing to a family of graphs by contra…
Subset Feedback Vertex Set in Chordal and Split Graphs
Geevarghese Philip, Varun Rajan, Saket Saurabh +1
In the \textsc{Subset Feedback Vertex Set (Subset-FVS)} problem the input is a graph , a subset \(T\) of vertices of \(G\) called the `terminal' vertices, and an integer . Th…
On the Parameterized Complexity of Contraction to Generalization of Trees
Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
For a family of graphs , the -Contraction problem takes as an input a graph and an integer , and the goal is to decide if there exists $S \subseteq E(G)…