Finding paths and deleting edges in directed acyclic graphs

A data structure for dynamic trees

Daniel D. Sleator, Robert E. Tarjan · Journal of Computer and System Sciences · 1983 · 1K citations

Computing, Computer Science, Algorithms +16

Amortized Computational Complexity

Robert E. Tarjan · SIAM Journal on Algebraic and Discrete Methods · 1985 · 525 citations

Computing, Computer Science, Algorithms +16

Worst-case Analysis of Set Union Algorithms

Robert E. Tarjan, Jan Van Leeuwen · Journal of the ACM · 1984 · 458 citations · Full text

Computing, Computer Science, Computer Systems +6

Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications

Greg N. Frederickson · SIAM Journal on Computing · 1985 · 382 citations

Computing, Computer Science, Computational Geometry +13

An On-Line Edge-Deletion Problem

Yossi Shiloach, Shimon Even · Journal of the ACM · 1981 · 284 citations

Computing, Computer Science, Information Retrieval +5