Semantic Scholar uses AI to extract papers important to this topic.
Most interesting optimization problems on graphs are NP-hard, which means that (unless P=NP) there is no polynomial time… Expand This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate… Expand Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more than one interval… Expand Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard… Expand Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two… Expand We develop new techniques for deriving strong computational lower bounds for a class of well-known NP-hard problems. This class… Expand We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of… Expand 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 An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors… Expand