On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2014.10.035
@@ Property / DOI: 10.1016/j.tcs.2014.10.035 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q59864899
@@ Property / Wikidata QID: Q59864899 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2014.10.035
+Normal rank
@@ Property / OpenAlex ID @@
+W2036594069
@@ Property / OpenAlex ID: W2036594069 / rank @@
+Normal rank
@@ Property / cites work @@
+The Curse of Connectivity: t-Total Vertex (Edge) Cover
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+On Multiway Cut Parameterized above Lower Bounds
@@ Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Flowers and Vertex Cover
@@ Property / cites work: Paths, Flowers and Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Q2904774
@@ Property / cites work: Q2904774 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for a Minimum Cover of a Graph
@@ Property / cites work: An Algorithm for a Minimum Cover of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex and edge covers with clustering properties: Complexity and algorithms
+Normal rank
@@ Property / cites work @@
+On the completeness of a generalized matching problem
+Normal rank
@@ Property / cites work @@
+Parallel Processing and Applied Mathematics
@@ Property / cites work: Parallel Processing and Applied Mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the test cover problem
+Normal rank
@@ Property / cites work @@
+The number of trees
@@ Property / cites work: The number of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel Bounds for Disjoint Cycles and Disjoint Paths
+Normal rank
@@ Property / cites work @@
+Incompressibility through Colors and IDs
@@ Property / cites work: Incompressibility through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Parametrized Complexity of Some Fundamental Problems in Coding Theory
+Normal rank
@@ Property / cites work @@
+Deterministic Parameterized Connected Vertex Cover
+Normal rank
@@ Property / cites work @@
+Constant Time Generation of Rooted Trees
@@ Property / cites work: Constant Time Generation of Rooted Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Subgraphs via Homomorphisms
@@ Property / cites work: Counting Subgraphs via Homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for genegrating integer partitions
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Subgraphs via Homomorphisms
@@ Property / cites work: Counting Subgraphs via Homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Edge Dominating Sets in Graphs
@@ Property / cites work: Edge Dominating Sets in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New Parameterized Algorithms for the Edge Dominating Set Problem
+Normal rank
@@ Property / cites work @@
+Q2908840
@@ Property / cites work: Q2908840 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized measure \& conquer for problems with no small kernels
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2014.10.035
@@ Property / DOI: 10.1016/J.TCS.2014.10.035 / rank @@
+Normal rank