Robert Endre Tarjan
Affiliations: | Computer Science | Princeton University, Princeton, NJ |
Area:
Data structures; graph algorithms; combinatorial optimization; computational complexity; computational geometry; parallel algorithms.Google:
"Robert Endre Tarjan"Bio:
Parents
Sign in to add mentor| Robert W Floyd | grad student | 1971 | Stanford | |
| (An Efficient Planarity Algorithm) | ||||
| Donald Knuth | grad student | 1971 | Stanford (MathTree) | |
Children
Sign in to add trainee| Thomas Lengauer | grad student | 1979 | Stanford |
| John Gilbert | grad student | 1981 | Stanford |
| Monika Henzinger | grad student | 1993 | Princeton |
| Konstantinos Tsioutsiouliklis | grad student | 2002 | Princeton |
| Loukas Georgiadis | grad student | 2005 | Princeton |
| Renato F. Werneck | grad student | 2006 | Princeton |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Georgiadis L, Tarjan RE. (2015) Dominator tree certification and divergent spanning trees Acm Transactions On Algorithms. 12 |
| Haeupler B, Sen S, Tarjan RE. (2015) Rank-balanced trees Acm Transactions On Algorithms. 11 |
| Goldberg AV, Hed S, Kaplan H, et al. (2015) Faster and more dynamic maximum flow by incremental breadth-first search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9294: 619-630 |
| Dueholm T, Kaplan H, Tarjan RE, et al. (2015) Hollow heaps Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9134: 689-700 |
| Goldberg AV, Tarjan RE. (2014) Efficient maximum flow algorithms Communications of the Acm. 57: 82-89 |
| Larkin DH, Tarjan RE. (2014) Nested set union Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8737: 618-629 |
| Georgiadis L, Laura L, Parotsidis N, et al. (2014) Loop nesting forests, dominators, and applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8504: 174-186 |
| Chechik S, Larkin DH, Roditty L, et al. (2014) Better approximation algorithms for the graph diameter Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1041-1052 |
| Kaplan H, Tarjan RE, Zwick U. (2013) Soft heaps simplified Siam Journal On Computing. 42: 1660-1673 |
| Fraczak W, Georgiadis L, Miller A, et al. (2013) Finding dominators via disjoint set union Journal of Discrete Algorithms. 23: 2-20 |