The Turing way to parameterized complexity
From MaRDI portal
Recommendations
- A parameterized complexity tutorial
- Parameterized complexity: the main ideas and connections to practical computing
- Parameterized complexity: The main ideas and connections to practical computing
- Parameterized complexity
- Fundamentals of parameterized complexity
- The birth and early years of parameterized complexity
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Parameterized complexity and subexponential-time computability
- Parameterized proof complexity
- Computation Models for Parameterized Complexity
Cites work
- Computation Models for Parameterized Complexity
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- On intervalizing k-colored graphs for DNA physical mapping
- On the parameterized complexity of short computation and factorization
- Parameterized complexity after (almost) ten years: Review and open questions
- Perfect Code is \(W[1]\)-complete
- The parameterized complexity of some problems in logic and linguistics
- The parametrized complexity of intersection and composition operations on sets of finite-state automata
- The steiner problem in graphs
- Threshold dominating sets and an improved characterization of \(W[2]\)
Cited in
(37)- Vertex and edge covers with clustering properties: Complexity and algorithms
- Perfect Code is \(W[1]\)-complete
- The complexity of probabilistic lobbying
- The many facets of upper domination
- A multi-parameter analysis of hard problems on deterministic finite automata
- Facility location problems: a parameterized view
- The complexity of finding harmless individuals in social networks
- A completeness theory for polynomial (Turing) kernelization
- Parameterizations of hitting set of bundles and inverse scope
- A complete parameterized complexity analysis of bounded planning
- The graph motif problem parameterized by the structure of the input graph
- A parametric analysis of the state-explosion problem in model checking
- Parameterized counting problems
- Grundy Coloring and friends, half-graphs, bicliques
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- A Parameterized Halting Problem
- Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
- Dual parameterization and parameterized approximability of subset graph problems
- Finding approximate and constrained motifs in graphs
- On the parameterised complexity of string morphism problems
- Parameterized dynamic variants of red-blue dominating set
- Facility Location Problems: A Parameterized View
- Finding approximate and constrained motifs in graphs
- Parameterized proof complexity
- Confronting intractability via parameters
- scientific article; zbMATH DE number 2183396 (Why is no real title available?)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
- FPT-algorithms and their classification on the basis of elasticity
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
- Directed nowhere dense classes of graphs
- Parameterized certificate dispersal and its variants
- Offensive alliances in signed graphs
- Extension perfect Roman domination
- Defensive alliances in signed networks
- Perfect Roman domination: aspects of enumeration and parameterization
- Chordless paths through three vertices
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]
This page was built for publication: The Turing way to parameterized complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877697)
