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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
It's not surprisingly when entering this site to get the book. One of the popular books now is the fundamentals of parameterized… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more than one interval… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
. Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, pp. 394–399. ACM, New York. PARAMETERIZED COMPLEXITY… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We develop new techniques for deriving strong computational lower bounds for a class of well-known NP-hard problems. This class… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
 
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We develop a parameterized complexity theory for counting p roblems. As the basis of this theory, we introduce a hierarchy of… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The goal of this article is to provide a tourist guide, with an eye towards structural issues, to what I consider some of the… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
 
Is this relevant?