Robert E. Tarjan
Impact in
-
- Computational Geometry and Mesh Generation
- Computational Theory and Mathematics top 0.01%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 103
- Complexity and Algorithms in Graphs 95
- semigroups and automata theory 21
-
- Optimization and Search Problems 61
- Interconnection Networks and Systems 27
- Co-authors
- Daniel D. Sleator (19 shared papers)John E. Hopcroft (10 shared papers)Andrew V. Goldberg (13 shared papers)Michael L. Fredman (3 shared papers)Harold N. Gabow (16 shared papers)Richard J. Lipton (5 shared papers)Donald J. Rose (6 shared papers)M. R. Garey (8 shared papers)
- Journals
- SIAM Journal on Computing (46 papers)Journal of the ACM (20 papers)ACM Transactions on Algorithms (12 papers)Journal of Algorithms (11 papers)Communications of the ACM (9 papers)
- Partner nations
- United StatesIsraelGermany
In The Last Decade
Robert E. Tarjan
322 papers receiving 32.5k citations
Robert E. Tarjan's Hit Papers
Peers
Comparison fields: 5 of 203
- Computer Graphics and Computer-Aided Design 4.8k
- Computational Theory and Mathematics 15.5k
- Computer Networks and Communications 13.9k
- Hardware and Architecture 3.5k
- Software 1.4k
Countries citing papers authored by Robert E. Tarjan
This map shows the geographic impact of Robert E. Tarjan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Robert E. Tarjan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert E. Tarjan more than expected).
Fields of papers citing papers by Robert E. Tarjan
This network shows the impact of papers produced by Robert E. Tarjan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Robert E. Tarjan. The network helps show where Robert E. Tarjan may publish in the future.
Co-authors
The 25 scholars most cited alongside Robert E. Tarjan, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 334 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Depth-First Search and Linear Graph Algorithms Hit paper breakdown → | 1972 | 3800 |
| 2 | Fibonacci heaps and their uses in improved network optimization algorithms Hit paper breakdown → | 1987 | 1614 |
| 3 | Data Structures and Network Algorithms Hit paper breakdown → | 1983 | 1385 |
| 4 | Amortized efficiency of list update and paging rules Hit paper breakdown → | 1985 | 1254 |
| 5 | A new approach to the maximum-flow problem Hit paper breakdown → | 1988 | 1208 |
| 6 | Time bounds for selection Hit paper breakdown → | 1973 | 734 |
| 7 | A Separator Theorem for Planar Graphs Hit paper breakdown → | 1979 | 720 |
| 8 | Self-adjusting binary search trees Hit paper breakdown → | 1985 | 697 |
| 9 | Algorithmic Aspects of Vertex Elimination on Graphs Hit paper breakdown → | 1976 | 629 |
| 10 | Algorithm 447: efficient algorithms for graph manipulation Hit paper breakdown → | 1973 | 609 |
| 11 | Efficient Planarity Testing Hit paper breakdown → | 1974 | 608 |
| 12 | Fast Algorithms for Finding Nearest Common Ancestors Hit paper breakdown → | 1984 | 604 |
| 13 | Three Partition Refinement Algorithms Hit paper breakdown → | 1987 | 585 |
| 14 | Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs Hit paper breakdown → | 1984 | 569 |
| 15 | A data structure for dynamic trees Hit paper breakdown → | 1983 | 555 |
| 16 | A quick method for finding shortest pairs of disjoint paths Hit paper breakdown → | 1984 | 483 |
| 17 | 1979 | 467 | |
| 18 | Dividing a Graph into Triconnected Components Hit paper breakdown → | 1973 | 466 |
| 19 | 1979 | 406 | |
| 20 | 1986 | 385 |
About Robert E. Tarjan
Robert E. Tarjan is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Computer Graphics and Computer-Aided Design and Signal Processing, having authored 334 papers that have together received 36.2k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (103 papers), Complexity and Algorithms in Graphs (95 papers), Algorithms and Data Compression (94 papers), Optimization and Search Problems (61 papers), Computational Geometry and Mesh Generation (43 papers), Data Management and Algorithms (38 papers), Interconnection Networks and Systems (27 papers) and semigroups and automata theory (21 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (4.8k citations), Computational Theory and Mathematics (15.5k citations), Computer Networks and Communications (13.9k citations), Hardware and Architecture (3.5k citations) and Software (1.4k citations). Robert E. Tarjan has collaborated with scholars based in United States, Israel and Germany. Frequent co-authors include Daniel D. Sleator, John E. Hopcroft, Andrew V. Goldberg, Michael L. Fredman, Harold N. Gabow, Richard J. Lipton, Donald J. Rose, M. R. Garey, Robert Paige and Neil Sarnak. Their work appears in journals such as SIAM Journal on Computing, Journal of the ACM, ACM Transactions on Algorithms, Journal of Algorithms and Communications of the ACM.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.