Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

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

Is this relevant?

Highly Cited

2006

Highly Cited

2006

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

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… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

The optimization problem of measuring all nodes in an electrical network by placing as few measurement units (PMUs) as possible… Expand

Is this relevant?

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

Is this relevant?

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

Is this relevant?

Highly Cited

2003

Highly Cited

2003

We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS… Expand

Is this relevant?

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

Is this relevant?

Highly Cited

1987

Highly Cited

1987

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?