Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

2015

Highly Cited

2015

Summary 1. Tropical forests are globally important, but it is not clear whether biodiversity enhances carbon storage and… Expand

Highly Cited

2014

Highly Cited

2014

An outline of recent work on complex networks is given from the point of view of a physicist. Motivation, achievements and goals… Expand

Highly Cited

2009

Highly Cited

2009

We describe a new implementation of the Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer… Expand

Highly Cited

2003

Highly Cited

2003

An information retrieval technique, latent semantic indexing, is used to automatically identify traceability links from system… Expand

Highly Cited

1997

Highly Cited

1997

COMBINATORIAL AND DISCRETE GEOMETRY Finite Point Configurations, J. Pach Packing and Covering, G. Fejes Toth Tilings, D… Expand

Highly Cited

1995

Highly Cited

1995

Combinatorial and geometric computing is a core area of computer science (CS). In fact, most CS curricula contain a course in… Expand

Highly Cited

1993

Highly Cited

1993

LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and related data… Expand

1990

1990

LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and related data… Expand

1989

1989

LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and the data structures… Expand