The complexity of restricted spanning tree problems

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

Reducibility among Combinatorial Problems

1972 • 10,743 citations

The Design and Analysis of Computer Algorithms

1974 • 9,688 citations

On the shortest spanning subtree of a graph and the traveling salesman problem

1956 • 4,806 citations

Shortest Connection Networks And Some Generalizations

1957 • 4,371 citations

Combinatorial optimization: networks and matroids

2021 • 3,410 citations

Paths, Trees, and Flowers

1965 • 2,165 citations

Matroids and the greedy algorithm

1971 • 879 citations

Node-and edge-deletion NP-complete problems

1978 • 457 citations

The complexity of the capacitated tree problem

1978 • 180 citations

Matroid intersection algorithms

1975 • 168 citations

Some Matching Problems for Bipartite Graphs

1978 • 104 citations