Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 206,554,885 papers from all fields of science

Search

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

Highly Cited

2012

Highly Cited

2012

I BORRES MP, AHLSTEDT S, BJORKSTEN B. Cultures of human cord blood metachromatic cells in relation to family history of atopy…

Review

2008

Review

2008

Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard…

Highly Cited

2007

Highly Cited

2007

We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple…

Highly Cited

2006

Highly Cited

2006

Frieze et al. [17] proved that a small sample of rows of a given matrix <i>A</i> contains a low-rank approximation <i>D</i> that…

Highly Cited

2005

Highly Cited

2005

A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk…

Highly Cited

2004

Highly Cited

2004

Assuming that NP /spl nsube//spl cap//sub /spl epsi/> 0/ BPTIME(2/sup n/spl epsi//), we show that graph min-bisection, densest…

Highly Cited

2003

Highly Cited

2003

We study the combinatorial structure and computational complexity of extreme Nash equilibria, ones that maximize or minimize a…

Highly Cited

2002

Highly Cited

2002

We consider the following clustering problem: we have a complete graph on n vertices (items), where each edge (u, v) is labeled…

Highly Cited

2000

Highly Cited

2000

The Multiple Knapsack problem (MKP) is a natural and well known generalization of the single knapsack problem and is defined as…

Highly Cited

1978

Highly Cited

1978

We consider one of the basic, well-studied problems of scheduling theory, that of nonpreemptively scheduling n independent tasks…