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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
  • Rajesh Chitnis
  • SIGA
  • 2015
  • Corpus ID: 23517218
Most interesting optimization problems on graphs are NP-hard, which means that (unless P=NP) there is no polynomial time… Expand
  • table 1
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
Review
2013
Review
2013
This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2008
Review
2008
  • D. Marx
  • Comput. J.
  • 2008
  • Corpus ID: 17172193
Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard… Expand
  • table 1
  • table 2
  • figure 1
Highly Cited
2006
Highly Cited
2006
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two… Expand
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… Expand
Highly Cited
2004
Highly Cited
2004
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
Highly Cited
2003
Highly Cited
2003
  • L. Cai
  • Discret. Appl. Math.
  • 2003
  • Corpus ID: 18590723
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
Highly Cited
1999
Highly Cited
1999
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