K
v
ire
.com
←
Back
Night
Docs
Library
Review
…
Author
Robert E. Tarjan
also known as R E Tarjan, R TARJAN, R Tarjan
Princeton University · Semmelweis University · Supélec · AT&T (United States)
About this author
Works
579
Cited by
63,641
h-index
111
i10
294
ORCID ↗
Top papers
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan
·
1972
·
SIAM Journal on Computing
↗ 5,995
Fibonacci heaps and their uses in improved network optimization algorithms
Michael L. Fredman, Robert E. Tarjan
·
1987
·
Journal of the ACM
↗ 2,661
OA
Amortized efficiency of list update and paging rules
Daniel D. Sleator, Robert E. Tarjan
·
1985
·
Communications of the ACM
↗ 2,105
OA
Data Structures and Network Algorithms
Robert E. Tarjan
·
1983
·
Society for Industrial and Applied Mathematics eBooks
↗ 2,078
A new approach to the maximum-flow problem
Andrew V. Goldberg, Robert E. Tarjan
·
1988
·
Journal of the ACM
↗ 1,871
OA
A Separator Theorem for Planar Graphs
Richard J. Lipton, Robert E. Tarjan
·
1979
·
SIAM Journal on Applied Mathematics
↗ 1,356
Time bounds for selection
Manuel Blum, Robert W. Floyd, Vaughan Pratt, et al.
·
1973
·
Journal of Computer and System Sciences
↗ 1,246
Self-adjusting binary search trees
Daniel D. Sleator, Robert E. Tarjan
·
1985
·
Journal of the ACM
↗ 1,238
OA
Algorithmic Aspects of Vertex Elimination on Graphs
Donald J. Rose, Robert E. Tarjan, George S. Lueker
·
1976
·
SIAM Journal on Computing
↗ 1,195
Three Partition Refinement Algorithms
Robert Paige, Robert E. Tarjan
·
1987
·
SIAM Journal on Computing
↗ 1,160
Efficient Planarity Testing
John E. Hopcroft, Robert E. Tarjan
·
1974
·
Journal of the ACM
↗ 1,077
OA
Fast Algorithms for Finding Nearest Common Ancestors
Dov Harel, Robert E. Tarjan
·
1984
·
SIAM Journal on Computing
↗ 1,075
Books
Notes on introductory combinatorics
1983
·
Birkhauser Verlag
An efficient parallel biconnectivity algorithm
1983
·
Courant Institute of Mathematical Sciences, New York University
Data structures and network algorithms
1983
·
Society for Industrial and Applied Mathematics
Data Structures and Network Algorithms (CBMS-NSF Regional Conference Series in Applied Mathematics) (CBMS-NSF Regional Conference Series in Applied Mathematics)
1987
·
Society for Industrial Mathematics
Notes on Introductory Combinatorics
2014
·
Birkhäuser Boston
o(n Log N) Algorithm for the Maximal Planar Subgraph Problem
2018
·
Creative Media Partners, LLC