Robert Endre Tarjan
Active 1971–2022
- 247
- Papers
- 52,774
- Citations
- 94
- h-index
- 202
- i10-index
Citations
Citation sources
Countries
Institutions
Fields
- Computer Science77.9%
- Engineering9.8%
- Biochemistry, Genetics and Molecular Biology2.7%
- Physics and Astronomy2.4%
- Mathematics1.8%
- Decision Sciences1.7%
- Other3.7%
Topics
- Advanced Graph Theory Research7.3%
- Complexity and Algorithms in Graphs6.5%
- Optimization and Search Problems4.3%
- Computational Geometry and Mesh Generation4.1%
- Algorithms and Data Compression4%
- Data Management and Algorithms3.3%
- Other70.5%
Coauthors
- Haim Kaplan25
- Loukas Georgiadis15
- Daniel Dominic Sleator14
- Andrew V. Goldberg13
- Harold N. Gabow12
- Lesley R. Matheson11
- Renato Fonseca F. Werneck9
- Siddhartha Sen9
- Bernhard Haeupler8
- Jeffery R. Westbrook6
- Yunhong Zhou6
- Christopher J. Van Wyk5
- John E. Hopcroft5
- Robert Paige5
- Shimon Even5
- Thomas Lengauer5
- Adam L. Buchsbaum4
- Daniel H. Larkin4
- James B. Orlin4
- Kurt Mehlhorn4
- M. R. Garey4
- Pierre Rosenstiehl4
- Ravindra K. Ahuja4
- Ron Shamir4
All papers
- Depth-First Search and Linear Graph Algorithms
Authors: Robert Endre Tarjan - Annual Symposium on Switching and Automata Theory (swat 1971), SIAM J. Comput. 1971 cited by 6,021
- Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms
Authors: Michael L. Fredman, Robert Endre Tarjan - Annual Symposium onFoundations of Computer Science, FOCS 1984 cited by 2,673
- Amortized Efficiency of List Update and Paging Rules
Authors: Daniel Dominic Sleator, Robert Endre Tarjan - Communications of the ACM, Commun. ACM 1985 cited by 2,109
- Self-Adjusting Binary Search Trees
Authors: Daniel Dominic Sleator, Robert Endre Tarjan - Journal of the ACM, J. ACM 1985 cited by 1,241
- A New Approach to the Maximum Flow Problem
Authors: Andrew V. Goldberg, Robert Endre Tarjan - Journal of the ACM, J. ACM 1986 cited by 1,877
- Three Partition Refinement Algorithms
Authors: Robert Paige, Robert Endre Tarjan - SIAM Journal on Computing, SIAM J. Comput. 1987 cited by 1,163
- Worst-case Analysis of Set Union Algorithms
Authors: Robert Endre Tarjan, Jan van Leeuwen - Journal of the ACM, J. ACM 1984 cited by 458
- Algorithmic Aspects of Vertex Elimination on Graphs
Authors: Donald J. Rose, Robert Endre Tarjan, George S. Lueker - SIAM Journal on Computing, SIAM J. Comput. 1976 cited by 1,216
- Fast Algorithms for Finding Nearest Common Ancestors
Authors: Dov Harel, Robert Endre Tarjan - SIAM Journal on Computing, SIAM J. Comput. 1984 cited by 1,076
- Time Bounds for Selection
Authors: Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan - Journal of Computer and System Sciences, J. Comput. Syst. Sci. 1973 cited by 1,249
- A Data Structure for Dynamic Trees
Authors: Daniel Dominic Sleator, Robert Endre Tarjan - Journal of Computer and System Sciences, J. Comput. Syst. Sci. 1981 cited by 1,040
- Efficient Planarity Testing
Authors: John E. Hopcroft, Robert Endre Tarjan - Journal of the ACM, J. ACM 1974 cited by 1,079
- The Planar Hamiltonian Circuit Problem is NP-Complete
Authors: M. R. Garey, David S. Johnson, Robert Endre Tarjan - SIAM Journal on Computing, SIAM J. Comput. 1976 cited by 529
- A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas
Authors: Bengt Aspvall, Michael F. Plass, Robert Endre Tarjan - Information Processing Letters, Inf. Process. Lett. 1979 cited by 901
- Dividing a Graph into Triconnected Components
Authors: John E. Hopcroft, Robert Endre Tarjan - SIAM Journal on Computing, SIAM J. Comput. 1973 cited by 841
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Authors: Robert Endre Tarjan, Mihalis Yannakakis - SIAM Journal on Computing, SIAM J. Comput. 1984 cited by 1,060
- A Fast Algorithm for Finding Dominators in a Flowgraph
Authors: Thomas Lengauer, Robert Endre Tarjan - ACM Transactions on Programming Languages and Systems, ACM Trans. Program. Lang. Syst. 1979 cited by 632
- Efficiency of a Good But Not Linear Set Union Algorithm
Authors: Robert Endre Tarjan - Journal of the ACM, J. ACM 1975 cited by 59
- Finding a Maximum Independent Set
Authors: Robert Endre Tarjan, Anthony E. Trojanowski - SIAM Journal on Computing, SIAM J. Comput. 1977 cited by 474
- Data structures and network algorithms
Authors: Robert Endre Tarjan - Society for Industrial and Applied Mathematics eBooks 1983 cited by 2,078
- Network Flow and Testing Graph Connectivity
Authors: Shimon Even, Robert Endre Tarjan - SIAM Journal on Computing, SIAM J. Comput. 1975 cited by 558
- A quick method for finding shortest pairs of disjoint paths
Authors: J. W. Suurballe, Robert Endre Tarjan - Networks 1984 cited by 693
- The Recognition of Series Parallel Digraphs
Authors: Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler - eleventh annual ACM symposium on Theory of computing - STOC '79, SIAM J. Comput. 1979 cited by 611
- Fast exact and heuristic methods for role minimization problems
Authors: Alina Ene, William G. Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, Robert Endre Tarjan - symposium on Access control models and technologies, SACMAT 2008 cited by 222
