Parameterized algorithm for eternal vertex cover (Q765521): Difference between revisions

@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Parameterized Upper Bounds for Vertex Cover
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated Domination and Covering: A Parameterized Perspective
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of Vertex Cover variants
@@ Property / cites work: Parameterized complexity of Vertex Cover variants / rank @@
+Normal rank
@@ Property / cites work @@
+Q3059008
@@ Property / cites work: Q3059008 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Upper Bounds for Partial Vertex Cover
@@ Property / cites work: Improved Upper Bounds for Partial Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank