A pseudoforest is a graph where each connected component contains at most one cycle, or alternatively, a graph that can be turned into a forest by removing at most one edge from each connected component. In this paper, we show that the following problem can be solved in O(3^k n k^{O(1)}) time: given a graph G and an integer k, can we delete at most k vertices from G such that we obtain a pseudoforest? The result improves upon an earlier result by Philip et al. [MFCS 2015] who gave a (nonlinear) 7.56^k n^{O(1)}-time algorithm both in the exponential factor depending on k as well as in the polynomial factor depending on n
In the Block Graph Deletion problem, we are given a graph G on n vertices and a positive integer k, ...
For a fixed property (graph class) $\Pi$, given a graph $G$ and an integer $k$, the $\Pi$-deletion p...
For a graph H, the H-free Edge Deletion problem asks whether there exist at most k edges whose delet...
A pseudoforest is a graph where each connected component contains at most one cycle, or alternativel...
A pseudoforest is a graph where each connected component contains at most one cycle, or alternativel...
The Feedback Vertex Set problem is undoubtedly one of the most well-studied problems in Parameterize...
TheFeedback Vertex Setproblem is undoubtedly one of the most well-studied problems inParameterized C...
Given a graph on n vertices and an integer k, the feedback vertex set problem asks for the deletion ...
This thesis deals with the problem of finding a subgraph of maximum density d* in a simple graph and...
Linear rankwidth is a linearized variant of rankwidth, introduced by Oum and Seymour [Approximating ...
Vertex deletion problems ask whether it is possible to delete at most k vertices from a graph so tha...
Let F be a finite set of graphs. In the F-Deletion problem, we are given an n-vertex, m-edge graph G...
In the Tree Deletion Set problem the input is a graph G together with an integer k. The objective is...
A feedback vertex set in an undirected graph is a subset of vertices whose removal results in an acy...
It is known that problems like Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal are polyn...
In the Block Graph Deletion problem, we are given a graph G on n vertices and a positive integer k, ...
For a fixed property (graph class) $\Pi$, given a graph $G$ and an integer $k$, the $\Pi$-deletion p...
For a graph H, the H-free Edge Deletion problem asks whether there exist at most k edges whose delet...
A pseudoforest is a graph where each connected component contains at most one cycle, or alternativel...
A pseudoforest is a graph where each connected component contains at most one cycle, or alternativel...
The Feedback Vertex Set problem is undoubtedly one of the most well-studied problems in Parameterize...
TheFeedback Vertex Setproblem is undoubtedly one of the most well-studied problems inParameterized C...
Given a graph on n vertices and an integer k, the feedback vertex set problem asks for the deletion ...
This thesis deals with the problem of finding a subgraph of maximum density d* in a simple graph and...
Linear rankwidth is a linearized variant of rankwidth, introduced by Oum and Seymour [Approximating ...
Vertex deletion problems ask whether it is possible to delete at most k vertices from a graph so tha...
Let F be a finite set of graphs. In the F-Deletion problem, we are given an n-vertex, m-edge graph G...
In the Tree Deletion Set problem the input is a graph G together with an integer k. The objective is...
A feedback vertex set in an undirected graph is a subset of vertices whose removal results in an acy...
It is known that problems like Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal are polyn...
In the Block Graph Deletion problem, we are given a graph G on n vertices and a positive integer k, ...
For a fixed property (graph class) $\Pi$, given a graph $G$ and an integer $k$, the $\Pi$-deletion p...
For a graph H, the H-free Edge Deletion problem asks whether there exist at most k edges whose delet...