Robert Tarjan

Cited by

	All	Since 2019
Citations	95332	17080
h-index	120	66
i10-index	313	174

3700

1850

925

2775

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024583 614 715 1044 1148 1335 1429 1609 1615 1665 1799 1692 1804 1772 1711 1616 1582 1691 2024 2150 2739 2666 2979 2918 2953 3105 3070 3384 3619 3446 3439 3412 3274 3483 3161 3075 3098 3007 2949 1784

Public access

View all

11 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
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityVerified email at cs.columbia.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
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	9482	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	4276	1987
A new approach to the maximum-flow problem AV Goldberg, RE Tarjan Journal of the ACM (JACM) 35 (4), 921-940, 1988	3371	1988
Data structures and network algorithms RE Tarjan Society for industrial and Applied Mathematics, 1983	3323	1983
Amortized efficiency of list update and paging rules DD Sleator, RE Tarjan Communications of the ACM 28 (2), 202-208, 1985	3104	1985
Efficiency of a good but not linear set union algorithm RE Tarjan Journal of the ACM (JACM) 22 (2), 215-225, 1975	1927	1975
A separator theorem for planar graphs RJ Lipton, RE Tarjan SIAM Journal on Applied Mathematics 36 (2), 177-189, 1979	1905	1979
Self-adjusting binary search trees DD Sleator, RE Tarjan Journal of the ACM (JACM) 32 (3), 652-686, 1985	1848	1985
Time bounds for selection M Blum, RW Floyd, VR Pratt, RL Rivest, RE Tarjan J. Comput. Syst. Sci. 7 (4), 448-461, 1973	1811	1973
Efficient planarity testing J Hopcroft, R Tarjan Journal of the ACM (JACM) 21 (4), 549-568, 1974	1779	1974
Algorithmic aspects of vertex elimination on graphs DJ Rose, RE Tarjan, GS Lueker SIAM Journal on computing 5 (2), 266-283, 1976	1724	1976
Three partition refinement algorithms R Paige, RE Tarjan SIAM Journal on computing 16 (6), 973-989, 1987	1706	1987
A data structure for dynamic trees DD Sleator, RE Tarjan Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981	1589	1981
Algorithm 447: efficient algorithms for graph manipulation J Hopcroft, R Tarjan Communications of the ACM 16 (6), 372-378, 1973	1573	1973
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	1507	1984
Fast algorithms for finding nearest common ancestors D Harel, RE Tarjan siam Journal on Computing 13 (2), 338-355, 1984	1488	1984
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	1304	1979
Dividing a graph into triconnected components JE Hopcroft, RE Tarjan SIAM Journal on computing 2 (3), 135-158, 1973	1176	1973
Making data structures persistent JR Driscoll, N Sarnak, DD Sleator, RE Tarjan Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986	1158	1986
Applications of a planar separator theorem RJ Lipton, RE Tarjan 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 162-170, 1977	1020	1977

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