Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857): Difference between revisions

@@ Property / cites work @@
+NP-hard graph problems and boundary classes of graphs
+Normal rank
@@ Property / cites work @@
+An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs
+Normal rank
@@ Property / cites work @@
+Q5463498
@@ Property / cites work: Q5463498 / rank @@
+Normal rank
@@ Property / cites work @@
+On the vertex \(k\)-path cover
@@ Property / cites work: On the vertex \(k\)-path cover / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Independent packings in structured graphs
@@ Property / cites work: Independent packings in structured graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kernels for Packing and Covering Problems
@@ Property / cites work: Kernels for Packing and Covering Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of Nemhauser and Trotter's local optimization theorem
+Normal rank
@@ Property / cites work @@
+A parameterized perspective on packing paths of length two
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+On F-independence in graphs
@@ Property / cites work: On F-independence in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a minimum path cover of a distance-hereditary graph in polynomial time
+Normal rank
@@ Property / cites work @@
+On computing the minimum 3-path vertex cover and dissociation number of graphs
+Normal rank
@@ Property / cites work @@
+A faster FPT algorithm for 3-path vertex cover
@@ Property / cites work: A faster FPT algorithm for 3-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Some results on graphs without long induced paths
@@ Property / cites work: Some results on graphs without long induced paths / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of dissociation set problems in graphs
+Normal rank
@@ Property / cites work @@
+The complexity of restricted spanning tree problems
+Normal rank
@@ Property / cites work @@
+Looking at the stars
@@ Property / cites work: Looking at the stars / rank @@
+Normal rank
@@ Property / cites work @@
+A fixed-parameter algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+An improved kernelization for \(P_{2}\)-packing
@@ Property / cites work: An improved kernelization for \(P_{2}\)-packing / rank @@
+Normal rank
@@ Property / cites work @@
+A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
+Normal rank
@@ Property / cites work @@
+On a generalization of Nemhauser and Trotter's local optimization theorem
+Normal rank
@@ Property / cites work @@
+A Parameterized Algorithm for Bounded-Degree Vertex Deletion
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for Vertex Cover \(P_3\)
+Normal rank