A bounded search tree algorithm for parameterized face cover (Q1002098): Difference between revisions

@@ 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.jda.2008.07.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2171126493
@@ Property / OpenAlex ID: W2171126493 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Deeply asymmetric planar graphs
@@ Property / cites work: Deeply asymmetric planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A refined search tree technique for dominating set on planar graphs
+Normal rank
@@ Property / cites work @@
+On the Complexity of Covering Vertices by Faces in a Planar Graph
+Normal rank
@@ Property / cites work @@
+Refined memorization for vertex cover
@@ Property / cites work: Refined memorization for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+A top-down approach to search-trees: Improved algorithmics for 3-hitting set
+Normal rank
@@ Property / cites work @@
+Two-Layer Planarization: Improving on Parameterized Algorithmics
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient fixed-parameter algorithm for 3-hitting set
+Normal rank
@@ Property / cites work @@
+Exact algorithms for finding minimum transversals in rank-3 hypergraphs
+Normal rank