Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Parameterized complexity

Known as: FPT (complexity class), Fixed-parameter tractability, W(2) 
In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems… Expand
Wikipedia

Related topics

Related topics

49 relations
1-planar graph2-satisfiabilityAlgorithmic paradigmBarrier resilience
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
On the parameterized complexity of multiple-interval graph problems
Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more than one interval… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Parameterized Complexity Theory
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
 
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Strong computational lower bounds via parameterized complexity
We develop new techniques for deriving strong computational lower bounds for a class of well-known NP-hard problems. This class… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Parameterized power domination complexity
The optimization problem of measuring all nodes in an electrical network by placing as few measurement units (PMUs) as possible… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The Parameterized Complexity of Counting Problems
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Parameterized Complexity of Vertex Colouring
For a family F of graphs and a nonnegative integer k, F + ke and F - ke, respectively, denote the families of graphs that can be… Expand
  • figure 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Parameterized Complexity
An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors… Expand
  • figure 1.1
  • table 1.1
  • figure 1.2
  • figure 1.3
  • figure 104
Is this relevant?
Highly Cited
1987
Highly Cited
1987
AGGREGATION AND LINEARITY IN THE PROVISION OF INTERTEMPORAL INCENTIVES
The authors develop two themes in the theory of incentive schemes. First, one need not always use all of the information… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE