Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484): Difference between revisions

@@ Property / author @@
-Julio Araujo
@@ Property / author: Julio Araujo / rank @@
-Normal rank
@@ Property / author @@
-Victor A. Campos
@@ Property / author: Victor A. Campos / rank @@
-Normal rank
@@ Property / author @@
+Julio Araujo
@@ Property / author: Julio Araujo / rank @@
+Normal rank
@@ Property / author @@
+Victor A. Campos
@@ Property / author: Victor A. Campos / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3127978156
@@ Property / OpenAlex ID: W3127978156 / rank @@
+Normal rank
@@ Property / cites work @@
+The many facets of upper domination
@@ Property / cites work: The many facets of upper domination / rank @@
+Normal rank
@@ Property / cites work @@
+Note on sunflowers
@@ Property / cites work: Note on sunflowers / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
+Normal rank
@@ Property / cites work @@
+On the max min vertex cover problem
@@ Property / cites work: On the max min vertex cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
+Normal rank
@@ Property / cites work @@
+How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
+Normal rank
@@ Property / cites work @@
+Strong computational lower bounds via parameterized complexity
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
+Normal rank
@@ Property / cites work @@
+Q3374865
@@ Property / cites work: Q3374865 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
+Normal rank
@@ Property / cites work @@
+What Is Known About Vertex Cover Kernelization?
@@ Property / cites work: What Is Known About Vertex Cover Kernelization? / rank @@
+Normal rank
@@ Property / cites work @@
+Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted maximum-clique transversal sets of graphs
+Normal rank
@@ Property / cites work @@
+Q4770411
@@ Property / cites work: Q4770411 / rank @@
+Normal rank
@@ Property / cites work @@
+Myhill-Nerode Methods for Hypergraphs
@@ Property / cites work: Myhill-Nerode Methods for Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Minimal Vertex Cover Parameterized by Vertex Cover
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2684484