scientific article; zbMATH DE number 512804
From MaRDI portal
Publication:4281497
zbMath0799.68087MaRDI QIDQ4281497
Michael R. Fellows, Rodney G. Downey
Publication date: 13 November 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (43)
Compactors for parameterized counting problems ⋮ On the Complexity of Singly Connected Vertex Deletion ⋮ On the Parameterized Complexity of the Expected Coverage Problem ⋮ A Retrospective on (Meta) Kernelization ⋮ Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ On the parameterized complexity of the expected coverage problem ⋮ Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues] ⋮ Parameterized power domination complexity ⋮ The Birth and Early Years of Parameterized Complexity ⋮ A Basic Parameterized Complexity Primer ⋮ A Parameterized Halting Problem ⋮ From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability ⋮ \(W[2\)-hardness of precedence constrained \(K\)-processor scheduling] ⋮ A polynomial kernel for block graph deletion ⋮ Parameterized circuit complexity and the \(W\) hierarchy ⋮ Reachability in Graph Transformation Systems and Slice Languages ⋮ On the hardness of labeled correlation clustering problem: a parameterized complexity view ⋮ Domino treewidth ⋮ Unnamed Item ⋮ Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms ⋮ Dominating set is fixed parameter tractable in claw-free graphs ⋮ Confronting intractability via parameters ⋮ Efficient algorithms for counting parameterized list \(H\)-colorings ⋮ Graphs with few \(P_4\)'s under the convexity of paths of order three ⋮ On feedback vertex set: new measure and new structures ⋮ Fixed-parameter tractability and completeness II: On completeness for W[1] ⋮ Exploring the Kernelization Borders for Hitting Cycles ⋮ Advice classes of parametrized tractability ⋮ Subset Feedback Vertex Set Is Fixed-Parameter Tractable ⋮ Improved FPT Algorithms for Deletion to Forest-Like Structures. ⋮ Improved algorithms for feedback vertex set problems ⋮ On parameterized independent feedback vertex set ⋮ Unnamed Item ⋮ A Quartic Kernel for Pathwidth-One Vertex Deletion ⋮ An improved FPT algorithm for independent feedback vertex set ⋮ The Parameterized Complexity of Graph Cyclability ⋮ Improved analysis of highest-degree branching for feedback vertex set ⋮ Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers ⋮ Unnamed Item ⋮ The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs ⋮ Sparse parameterized problems ⋮ Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits ⋮ On group feedback vertex set parameterized by the size of the cutset
This page was built for publication:
