Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-015-0037-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1052559269
@@ Property / OpenAlex ID: W1052559269 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Directed Trees with Many Leaves
@@ Property / cites work: Spanning Directed Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint in- and out-branchings in tournaments and related path problems
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Arc-disjoint paths and trees in 2-regular digraphs
+Normal rank
@@ Property / cites work @@
+The minimum spanning strong subdigraph problem is fixed parameter tractable
+Normal rank
@@ Property / cites work @@
+Arc-disjoint spanning sub(di)graphs in digraphs
@@ Property / cites work: Arc-disjoint spanning sub(di)graphs in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the tractability of some natural packing, covering and partitioning problems
+Normal rank
@@ Property / cites work @@
+Kernel(s) for problems with no kernel
@@ Property / cites work: Kernel(s) for problems with no kernel / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
+Normal rank
@@ Property / cites work @@
+Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+FPT algorithms and kernels for the directed \(k\)-leaf problem
+Normal rank
@@ Property / cites work @@
+Q3113754
@@ Property / cites work: Q3113754 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5593828
@@ Property / cites work: Q5593828 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+A linear vertex kernel for maximum internal spanning tree
+Normal rank
@@ Property / cites work @@
+Sharp separation and applications to exact and parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank