Linear kernels for outbranching problems in sparse digraphs (Q2408200): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-016-0244-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2964213279
@@ Property / OpenAlex ID: W2964213279 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time data reduction for dominating set
@@ Property / cites work: Polynomial-time data reduction for dominating set / rank @@
+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 @@
+Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Q5363775
@@ Property / cites work: Q5363775 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+On Finding Directed Trees with Many Leaves
@@ Property / cites work: On Finding Directed Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+On complexity of minimum leaf out-branching problem
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Contraction decomposition in h-minor-free graphs and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
+Normal rank
@@ Property / cites work @@
+NP-completeness and degree restricted spanning trees
+Normal rank
@@ Property / cites work @@
+Kernelization and Sparseness: the case of Dominating Set
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential algorithms for partial cover problems
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Using Structural Parameters on Sparse Graph Classes
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Local tree-width, excluded minors, and approximation algorithms
+Normal rank
@@ Property / cites work @@
+Minimum leaf out-branching and related problems
@@ Property / cites work: Minimum leaf out-branching and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+A subexponential parameterized algorithm for Subset TSP on planar graphs
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2957518
@@ Property / cites work: Q2957518 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
+Normal rank
@@ Property / cites work @@
+Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
+Normal rank