Subexponential parameterized algorithms (Q458457): Difference between revisions

@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Q2721971
@@ Property / cites work: Q2721971 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779138
@@ Property / cites work: Q4779138 / 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 @@
+Parameterized complexity: exponential speed-up for planar graph problems
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+On Linear Time Minor Tests with Depth-First Search
+Normal rank
@@ Property / cites work @@
+A Cubic Kernel for Feedback Vertex Set
@@ Property / cites work: A Cubic Kernel for Feedback Vertex Set / rank @@
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructive linear time algorithms for branchwidth
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the Hamiltonian cycle problem in planar graphs
+Normal rank
@@ Property / cites work @@
+Bidimensional Parameters and Local Treewidth
@@ Property / cites work: Bidimensional Parameters and Local Treewidth / 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 @@
+Linearity of grid minors in treewidth with applications through bidimensionality
+Normal rank
@@ Property / cites work @@
+Q2921717
@@ Property / cites work: Q2921717 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417628
@@ Property / cites work: Q5417628 / rank @@
+Normal rank
@@ Property / cites work @@
+The Bidimensional Theory of Bounded-Genus Graphs
@@ Property / cites work: The Bidimensional Theory of Bounded-Genus Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
+Normal rank
@@ Property / cites work @@
+Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Fast Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
+Normal rank
@@ Property / cites work @@
+Q3579494
@@ Property / cites work: Q3579494 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for minimum-weight vertex separators
+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 @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
+Normal rank
@@ Property / cites work @@
+New upper bounds on the decomposability of planar graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Kernels in planar digraphs
@@ Property / cites work: Kernels in planar digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q4708588
@@ Property / cites work: Q4708588 / 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 @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3972953
@@ Property / cites work: Q3972953 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Graph minors. XI: Circuits on a surface
@@ Property / cites work: Graph minors. XI: Circuits on a surface / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XII: Distance on a surface
@@ Property / cites work: Graph minors. XII: Distance on a surface / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank