Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover (Q3656855): Difference between revisions

@@ Property / cites work @@
+An improved fixed-parameter algorithm for vertex cover
+Normal rank
@@ Property / cites work @@
+An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications
+Normal rank
@@ Property / cites work @@
+Going Weighted: Parameterized Algorithms for Cluster Editing
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Algorithms for Cluster Vertex Deletion
+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 @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank