Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Parameterized complexity
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Most interesting optimization problems on graphs are NP-hard, which means that (unless P=NP) there is no polynomial time… Expand
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
Review
2008
Review
2008
Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard… Expand
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
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
Highly Cited
2003
Highly Cited
2003
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
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
