Robert Tarjan
Robert Tarjan
Professor of Computer Science, Princeton University
Verified email at cs.princeton.edu
Title
Cited by
Cited by
Year
Depth-first search and linear graph algorithms
R Tarjan
SIAM journal on computing 1 (2), 146-160, 1972
80971972
Fibonacci heaps and their uses in improved network optimization algorithms
ML Fredman, RE Tarjan
Journal of the ACM (JACM) 34 (3), 596-615, 1987
38331987
Data structures and network algorithms
RE Tarjan
Society for industrial and Applied Mathematics, 1983
31101983
A new approach to the maximum-flow problem
AV Goldberg, RE Tarjan
Journal of the ACM (JACM) 35 (4), 921-940, 1988
30601988
Amortized efficiency of list update and paging rules
DD Sleator, RE Tarjan
Communications of the ACM 28 (2), 202-208, 1985
28251985
Efficiency of a good but not linear set union algorithm
RE Tarjan
Journal of the ACM (JACM) 22 (2), 215-225, 1975
17511975
A separator theorem for planar graphs
RJ Lipton, RE Tarjan
SIAM Journal on Applied Mathematics 36 (2), 177-189, 1979
17211979
Self-adjusting binary search trees
DD Sleator, RE Tarjan
Journal of the ACM (JACM) 32 (3), 652-686, 1985
16991985
Time bounds for selection
M Blum, RW Floyd, VR Pratt, RL Rivest, RE Tarjan
J. Comput. Syst. Sci. 7 (4), 448-461, 1973
16381973
Efficient planarity testing
J Hopcroft, R Tarjan
Journal of the ACM (JACM) 21 (4), 549-568, 1974
16311974
Three partition refinement algorithms
R Paige, RE Tarjan
SIAM Journal on Computing 16 (6), 973-989, 1987
15601987
Algorithmic aspects of vertex elimination on graphs
DJ Rose, RE Tarjan, GS Lueker
SIAM Journal on computing 5 (2), 266-283, 1976
15171976
A data structure for dynamic trees
DD Sleator, RE Tarjan
Journal of computer and system sciences 26 (3), 362-391, 1983
13841983
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
RE Tarjan, M Yannakakis
SIAM Journal on computing 13 (3), 566-579, 1984
13821984
Fast algorithms for finding nearest common ancestors
D Harel, RE Tarjan
siam Journal on Computing 13 (2), 338-355, 1984
13611984
Algorithm 447: efficient algorithms for graph manipulation
J Hopcroft, R Tarjan
Communications of the ACM 16 (6), 372-378, 1973
12661973
A linear-time algorithm for testing the truth of certain quantified boolean formulas
B Aspvall, MF Plass, RE Tarjan
Information processing letters 8 (3), 121-123, 1979
11781979
Dividing a graph into triconnected components
JE Hopcroft, RE Tarjan
SIAM Journal on Computing 2 (3), 135-158, 1973
10681973
Making data structures persistent
JR Driscoll, N Sarnak, DD Sleator, RE Tarjan
Journal of computer and system sciences 38 (1), 86-124, 1989
10221989
Applications of a planar separator theorem
RJ Lipton, RE Tarjan
SIAM journal on computing 9 (3), 615-627, 1980
9541980
The system can't perform the operation now. Try again later.
Articles 1–20