Connecting face hitting sets in planar graphs (Q1944026): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2010.10.008
@@ Property / DOI: 10.1016/j.ipl.2010.10.008 / rank @@
-Normal rank
@@ Property / cites work @@
+On the minimum corridor connection problem and other generalized geometric problems
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for Planar Feedback Vertex Set
@@ Property / cites work: A Linear Kernel for Planar Feedback Vertex Set / rank @@
+Normal rank
@@ Property / cites work @@
+An             <i>O</i>             (             <i>n</i>             log             <i>n</i>             ) approximation scheme for Steiner tree in planar graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Connected Feedback Vertex Set in Planar Graphs
@@ Property / cites work: Connected Feedback Vertex Set in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
+Normal rank
@@ Property / cites work @@
+FPT Algorithms for Connected Feedback Vertex Set
@@ Property / cites work: FPT Algorithms for Connected Feedback Vertex Set / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2010.10.008
@@ Property / DOI: 10.1016/J.IPL.2010.10.008 / rank @@
+Normal rank