Fibonacci heaps and their uses in improved network optimization algorithms

A note on two problems in connexion with graphs

1959 • 22,492 citations

The Art of Computer Programming

1968 • 16,727 citations

The Design and Analysis of Computer Algorithms

1974 • 9,688 citations

Shortest Connection Networks And Some Generalizations

1957 • 4,371 citations

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

1972 • 2,450 citations

Data Structures and Network Algorithms

1983 • 2,116 citations

Efficient Algorithms for Shortest Paths in Sparse Networks

1977 • 1,039 citations

An analysis of several heuristics for the traveling salesman problem

2009 • 791 citations

On the History of the Minimum Spanning Tree Problem

1985 • 766 citations

A quick method for finding shortest pairs of disjoint paths

1984 • 690 citations

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

1986 • 512 citations

Amortized Computational Complexity

1985 • 497 citations

Worst-case Analysis of Set Union Algorithms

1984 • 444 citations

Finding Minimum Spanning Trees

1976 • 425 citations

The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information

1978 • 379 citations

Finding optimum branchings

1977 • 376 citations

Applications of Path Compression on Balanced Trees

1979 • 300 citations

A data structure for manipulating priority queues

1978 • 290 citations

A class of algorithms which require nonlinear time to maintain disjoint sets

1979 • 273 citations

A generalization of Dijkstra's algorithm

1977 • 263 citations

An 0(|E|loglog|V|) algorithm for finding minimum spanning trees

1975 • 157 citations

Self-Adjusting Heaps

1986 • 124 citations

Implementation and Analysis of Binomial Queue Algorithms

1978 • 117 citations

A note on finding optimum branchings

1979 • 89 citations

Efficient algorithms for a family of matroid intersection problems

1984 • 85 citations

Efficient implementation of graph algorithms using contraction

1989 • 82 citations

Efficient algorithms for graphic matroid intersection and parity

2005 • 60 citations

Bounds for naive multiple machine scheduling with release times and deadlines

1984 • 50 citations

Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs

1982 • 42 citations

A generalized upper bounding approach to a communications network planning problem

1977 • 32 citations

Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract)

1985 • 29 citations

Linear Verification For Spanning Trees

1984 • 14 citations