scientific article; zbMATH DE number 806748
From MaRDI portal
Publication:4850549
zbMath0834.68046MaRDI QIDQ4850549
Michael R. Fellows, Rodney G. Downey
Publication date: 17 October 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Possible winner problems on partial tournaments: a parameterized study, On the ordered list subgraph embedding problems, Solving large FPT problems on coarse-grained parallel machines, On the existence of subexponential parameterized algorithms, An improved fixed-parameter algorithm for vertex cover, Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues], The Birth and Early Years of Parameterized Complexity, Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows, A Basic Parameterized Complexity Primer, FPT Suspects and Tough Customers: Open Problems of Downey and Fellows, What’s Next? Future Directions in Parameterized Complexity, A fixed-parameter tractable algorithm for matrix domination, \(W[2\)-hardness of precedence constrained \(K\)-processor scheduling], Parameterized circuit complexity and the \(W\) hierarchy, The \(k\)-leaf spanning tree problem admits a klam value of 39, New Results on Directed Edge Dominating Set, Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis, \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions, On the parameterized vertex cover problem for graphs with perfect matching, What Is Known About Vertex Cover Kernelization?, Unnamed Item, Hardness of subgraph and supergraph problems in \(c\)-tournaments, Solving MAX-\(r\)-SAT above a tight lower bound, Lower bounds on kernelization, Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms, A new algorithm for finding trees with many leaves, An exact algorithm for the maximum leaf spanning tree problem, Confronting intractability via parameters, Unnamed Item, The complexity of irredundant sets parameterized by size, On directed covering and domination problems, Fixed-parameter tractability and completeness II: On completeness for W[1], Advice classes of parametrized tractability, Kernels in planar digraphs, Slightly Superexponential Parameterized Problems, On the computational hardness based on linear fpt-reductions, The parameterized complexity of editing graphs for bounded degeneracy, On the parameterized complexity of multiple-interval graph problems, Margin of victory for tournament solutions, Threshold dominating sets and an improved characterization of \(W[2\)], On computing graph minor obstruction sets, Sparse parameterized problems, Revising Johnson's table for the 21st century, A refined search tree technique for dominating set on planar graphs, The inapproximability of non-NP-hard optimization problems., Tractability and hardness of flood-filling games on trees, On Directed Covering and Domination Problems, A general method to speed up fixed-parameter-tractable algorithms
