Robert Tarjan

Cited by

	All	Since 2017
Citations	89216	18812
h-index	117	66
i10-index	306	181

3700

1850

925

2775

1983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022367 416 581 600 672 1056 1118 1239 1389 1563 1597 1642 1709 1685 1729 1713 1616 1615 1549 1660 1987 2154 2619 2609 2905 2870 2880 3144 3073 3375 3622 3453 3445 3396 3270 3399 3133 3067 3172 2765

Public access

View all

5 articles

1 article

available

not available

Based on funding mandates

Co-authors

Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Verified email at alum.mit.edu
Bill HornePrincipal Product Manager, AWS CryptographyVerified email at amazon.com
Loukas GeorgiadisDepartment of Computer Science & Engineering, University of IoanninaVerified email at cs.uoi.gr
David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentVerified email at research.att.com
James B. OrlinProfessor, Massachusetts Institute of TechnologyVerified email at mit.edu
Renato WerneckAmazonVerified email at cs.princeton.edu
Siddhartha SenMicrosoft Research (NYC)Verified email at microsoft.com
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityVerified email at cs.columbia.edu
Ronald L. RivestMIT Institute ProfessorVerified email at mit.edu

Robert Tarjan

Professor of Computer Science, Princeton University

Verified email at cs.princeton.edu

data structures graph algorithms analysis of algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Depth-first search and linear graph algorithms R Tarjan SIAM journal on computing 1 (2), 146-160, 1972	8671	1972
Fibonacci heaps and their uses in improved network optimization algorithms ML Fredman, RE Tarjan Journal of the ACM (JACM) 34 (3), 596-615, 1987	4016	1987
Data structures and network algorithms RE Tarjan Society for industrial and Applied Mathematics, 1983	3165	1983
A new approach to the maximum-flow problem AV Goldberg, RE Tarjan Journal of the ACM (JACM) 35 (4), 921-940, 1988	3144	1988
Amortized efficiency of list update and paging rules DD Sleator, RE Tarjan Communications of the ACM 28 (2), 202-208, 1985	2931	1985
Efficiency of a good but not linear set union algorithm RE Tarjan Journal of the ACM (JACM) 22 (2), 215-225, 1975	1824	1975
A separator theorem for planar graphs RJ Lipton, RE Tarjan SIAM Journal on Applied Mathematics 36 (2), 177-189, 1979	1775	1979
Self-adjusting binary search trees DD Sleator, RE Tarjan Journal of the ACM (JACM) 32 (3), 652-686, 1985	1761	1985
Time bounds for selection M Blum, RW Floyd, VR Pratt, RL Rivest, RE Tarjan J. Comput. Syst. Sci. 7 (4), 448-461, 1973	1695	1973
Efficient planarity testing J Hopcroft, R Tarjan Journal of the ACM (JACM) 21 (4), 549-568, 1974	1677	1974
Three partition refinement algorithms R Paige, RE Tarjan SIAM Journal on Computing 16 (6), 973-989, 1987	1637	1987
Algorithmic aspects of vertex elimination on graphs DJ Rose, RE Tarjan, GS Lueker SIAM Journal on computing 5 (2), 266-283, 1976	1597	1976
A data structure for dynamic trees DD Sleator, RE Tarjan Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981	1463	1981
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	1432	1984
Fast algorithms for finding nearest common ancestors D Harel, RE Tarjan siam Journal on Computing 13 (2), 338-355, 1984	1415	1984
Algorithm 447: efficient algorithms for graph manipulation J Hopcroft, R Tarjan Communications of the ACM 16 (6), 372-378, 1973	1358	1973
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	1238	1979
Dividing a graph into triconnected components JE Hopcroft, RE Tarjan SIAM Journal on computing 2 (3), 135-158, 1973	1111	1973
Making data structures persistent JR Driscoll, N Sarnak, DD Sleator, RE Tarjan Journal of computer and system sciences 38 (1), 86-124, 1989	1084	1989
Applications of a planar separator theorem RJ Lipton, RE Tarjan SIAM journal on computing 9 (3), 615-627, 1980	975	1980

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors