Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650): 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.ic.2013.11.006
+Normal rank
@@ Property / OpenAlex ID @@
+W1533217239
@@ Property / OpenAlex ID: W1533217239 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q60488413
@@ Property / Wikidata QID: Q60488413 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+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 @@
+Fast FAST
@@ Property / cites work: Fast FAST / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for treewidth
@@ Property / cites work: Approximation algorithms for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+The dag-width of directed graphs
@@ Property / cites work: The dag-width of directed graphs / 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 @@
+Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
+Normal rank
@@ Property / cites work @@
+Improved algorithms for feedback vertex set problems
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+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 @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+FPT algorithms and kernels for the directed \(k\)-leaf problem
+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 @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Q5501346
@@ Property / cites work: Q5501346 / rank @@
+Normal rank
@@ Property / cites work @@
+Linearity of grid minors in treewidth with applications through bidimensionality
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms
@@ Property / cites work: Subexponential parameterized algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Catalan structures and dynamic programming in \(H\)-minor-free graphs
+Normal rank
@@ Property / cites work @@
+Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Vertex Kernel for Maximum Internal Spanning Tree
+Normal rank
@@ Property / cites work @@
+Contraction obstructions for treewidth
@@ Property / cites work: Contraction obstructions for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph
+Normal rank
@@ Property / cites work @@
+Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
+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 @@
+Q2934648
@@ Property / cites work: Q2934648 / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Directed tree-width
@@ Property / cites work: Directed tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
+Normal rank
@@ Property / cites work @@
+A new algorithm for finding trees with many leaves
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q3369936
@@ Property / cites work: Q3369936 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank