Finding \(k\)-secluded trees faster (Q6133646): Difference between revisions

@@ Property / cites work @@
+The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem
+Normal rank
@@ Property / cites work @@
+Secluded connectivity problems
@@ Property / cites work: Secluded connectivity problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of secluded connectivity problems
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity of Cutting a Few Vertices from a Graph
+Normal rank
@@ Property / cites work @@
+Q5111877
@@ Property / cites work: Q5111877 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding connected secluded subgraphs
@@ Property / cites work: Finding connected secluded subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
+Normal rank
@@ Property / cites work @@
+A new algorithm for finding trees with many leaves
+Normal rank
@@ Property / cites work @@
+On the computational complexity of length- and neighborhood-constrained path problems
+Normal rank
@@ Property / cites work @@
+Parameterized graph separation problems
@@ Property / cites work: Parameterized graph separation problems / rank @@
+Normal rank