R. Tarjan

Most-cited papers

1. An Efficient Parallel Biconnectivity Algorithm

   R. Tarjan, U. Vishkin

   2011SIAM journal on computing (Print)496 citations Open access

   Semantic Scholar

   Save

2. Linear time algorithms for visibility and shortest path problems inside simple polygons

   L. Guibas, J. Hershberger, Daniel Leven, M. Sharir +1 more

   2011SCG '86140 citations

   Semantic Scholar

   Save

3. Finding minimum-cost flows by double scaling

   R. Ahuja, Andrew V. Goldberg, J. Orlin, R. Tarjan

   2015Mathematical programming135 citations Open access

   Semantic Scholar

   Save

4. Efficient maximum flow algorithms

   Andrew V. Goldberg, R. Tarjan

   2014CACM133 citations

   Semantic Scholar

   Save

5. Better Approximation Algorithms for the Graph Diameter

   S. Chechik, Daniel H. Larkin, L. Roditty, G. Schoenebeck +2 more

   2014ACM-SIAM Symposium on Discrete Algorithms130 citations

   Semantic Scholar

   Save

6. Improved Time Bounds for the Maximum Flow Problem

   R. Ahuja, J. Orlin, R. Tarjan

   2018SIAM journal on computing (Print)119 citations Open access

   Semantic Scholar

   Save

7. On Minimum-Cost Assignments in Unbalanced Bipartite Graphs

   L. Ramshaw, R. Tarjan

   2012108 citations

   Semantic Scholar

   Save

8. Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance

   B. Haeupler, T. Kavitha, Rogers Mathew, Siddhartha Sen +1 more

   2011ACM Trans. Algorithms100 citations Open access

   Semantic Scholar

   Save

9. Maximum Flows by Incremental Breadth-First Search

   Andrew V. Goldberg, Sagi Hed, Haim Kaplan, R. Tarjan +1 more

   2011Embedded Systems and Applications96 citations

   Semantic Scholar

   Save

10. Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps

    B. Haeupler, Richard Hladík, Václav Rozhoň, R. Tarjan +1 more

    2023IEEE Annual Symposium on Foundations of Computer Science72 citations Open access

    Semantic Scholar

    Save

11. A New Approach to Incremental Cycle Detection and Related Problems

    M. Bender, Jeremy T. Fineman, Seth Gilbert, R. Tarjan

    2011ACM Trans. Algorithms70 citations Open access

    Semantic Scholar

    Save

12. Strict fibonacci heaps

    G. Brodal, G. Lagogiannis, R. Tarjan

    2012Symposium on the Theory of Computing59 citations

    Semantic Scholar

    Save

13. CBTree: A Practical Concurrent Self-Adjusting Search Tree

    Y. Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison +1 more

    2012International Symposium on Distributed Computing59 citations

    Semantic Scholar

    Save

14. A Back-to-Basics Empirical Study of Priority Queues

    Daniel H. Larkin, Siddhartha Sen, R. Tarjan

    2014Workshop on Algorithm Engineering and Experimentation57 citations Open access

    Semantic Scholar

    Save

15. Finding Strongly Knit Clusters in Social Networks

    Nina Mishra, R. Schreiber, I. Stanton, R. Tarjan

    2008Internet Mathematics54 citations Open access

    Semantic Scholar

    Save

16. Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search

    Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli +2 more

    2015Embedded Systems and Applications53 citations

    Semantic Scholar

    Save

17. Finding dominators via disjoint set union

    W. Fraczak, Loukas Georgiadis, Andrew Miller, R. Tarjan

    2013J. Discrete Algorithms39 citations Open access

    Semantic Scholar

    Save

18. Rank-Balanced Trees

    B. Haeupler, Siddhartha Sen, R. Tarjan

    2009TALG39 citations

    Semantic Scholar

    Save

19. Rank-Pairing Heaps

    B. Haeupler, Siddhartha Sen, R. Tarjan

    2009Embedded Systems and Applications39 citations

    Semantic Scholar

    Save

20. An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models

    Sepehr Assadi, S. Liu, R. Tarjan

    2021SIAM Symposium on Simplicity in Algorithms37 citations

    Semantic Scholar

    Save

21. HP Transforms Product Portfolio Management with Operations Research

    Julie Ward, Bin Zhang, Shailendra Jain, C. Fry +17 more

    2010Interfaces36 citations

    Semantic Scholar

    Save

22. Dominator Tree Certification and Divergent Spanning Trees

    Loukas Georgiadis, R. Tarjan

    2016TALG35 citations

    Semantic Scholar

    Save

23. Shortest-path feasibility algorithms: An experimental evaluation

    B. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, R. Tarjan +1 more

    2008JEAL33 citations

    Semantic Scholar

    Save

24. A Randomized Concurrent Algorithm for Disjoint Set Union

    S. Jayanti, R. Tarjan

    2016ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing31 citations

    Semantic Scholar

    Save

25. A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs

    L. Ramshaw, R. Tarjan

    2012IEEE Annual Symposium on Foundations of Computer Science31 citations

    Semantic Scholar

    Save

26. The CB tree: a practical concurrent self-adjusting search tree

    Y. Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison +1 more

    2014Distributed computing28 citations

    Semantic Scholar

    Save

27. Faster Algorithms for Incremental Topological Ordering

    B. Haeupler, T. Kavitha, Rogers Mathew, Siddhartha Sen +1 more

    2008International Colloquium on Automata, Languages and Programming28 citations

    Semantic Scholar

    Save

28. Thin heaps, thick heaps

    Haim Kaplan, R. Tarjan

    2008TALG27 citations

    Semantic Scholar

    Save

29. Randomized Concurrent Set Union and Generalized Wake-Up

    S. Jayanti, R. Tarjan, Enric Boix-Adserà

    2019ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing25 citations Open access

    Semantic Scholar

    Save

30. Hollow Heaps

    Thomas Dueholm Hansen, Haim Kaplan, R. Tarjan, Uri Zwick

    2015International Colloquium on Automata, Languages and Programming24 citations

    Semantic Scholar

    Save

31. Concurrent disjoint set union

    S. Jayanti, R. Tarjan

    2020Distributed computing22 citations Open access

    Semantic Scholar

    Save

32. Deletion without rebalancing in balanced binary trees

    Siddhartha Sen, R. Tarjan

    2010ACM-SIAM Symposium on Discrete Algorithms22 citations

    Semantic Scholar

    Save

33. A New Path from Splay to Dynamic Optimality

    Caleb C. Levy, R. Tarjan

    2019ACM-SIAM Symposium on Discrete Algorithms19 citations Open access

    Semantic Scholar

    Save

34. An Experimental Study of Minimum Mean Cycle Algorithms

    Loukas Georgiadis, Andrew V. Goldberg, R. Tarjan, Renato F. Werneck

    2009Workshop on Algorithm Engineering and Experimentation19 citations Open access

    Semantic Scholar

    Save

35. Disjoint Set Union with Randomized Linking

    Ashish Goel, S. Khanna, Daniel H. Larkin, R. Tarjan

    2014ACM-SIAM Symposium on Discrete Algorithms17 citations

    Semantic Scholar

    Save

36. Dominators, Directed Bipolar Orders, and Independent Spanning Trees

    Loukas Georgiadis, R. Tarjan

    2012International Colloquium on Automata, Languages and Programming17 citations

    Semantic Scholar

    Save

37. Dominator Tree Certification and Independent Spanning Trees

    Loukas Georgiadis, R. Tarjan

    2012arXiv.org17 citations

    Semantic Scholar

    Save

38. Zip Trees

    R. Tarjan, Caleb C. Levy, Stephen Timmel

    2018ACM Trans. Algorithms16 citations Open access

    Semantic Scholar

    Save

39. Minimum-Cost Flows in Unit-Capacity Networks

    Andrew V. Goldberg, Sagi Hed, Haim Kaplan, R. Tarjan

    2017Theory of Computing Systems16 citations

    Semantic Scholar

    Save

40. An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries

    P. Agarwal, L. Arge, Haim Kaplan, Eyal Molad +2 more

    2012SIAM journal on computing (Print)16 citations Open access

    Semantic Scholar

    Save

41. Finding Strong Components Using Depth-First Search

    R. Tarjan, Uri Zwick

    2022European journal of combinatorics (Print)12 citations Open access

    Semantic Scholar

    Save

42. Splaying Preorders and Postorders

    Caleb C. Levy, R. Tarjan

    2019Workshop on Algorithms and Data Structures11 citations Open access

    Semantic Scholar

    Save

43. Simple Concurrent Labeling Algorithms for Connected Components

    S. Liu, R. Tarjan

    2018SIAM Symposium on Simplicity in Algorithms11 citations

    Semantic Scholar

    Save

44. Dominator Certification and Independent Spanning Trees: An Experimental Study

    Loukas Georgiadis, L. Laura, Nikos Parotsidis, R. Tarjan

    2013The Sea11 citations

    Semantic Scholar

    Save

45. Connected Components on a PRAM in Log Diameter Time

    S. Liu, R. Tarjan, Peilin Zhong

    2020ACM Symposium on Parallelism in Algorithms and Architectures10 citations Open access

    Semantic Scholar

    Save

46. Analysis of Smooth Heaps and Slim Heaps

    Maria Hartmann, L. Kozma, Corwin Sinnamon, R. Tarjan

    2021International Colloquium on Automata, Languages and Programming9 citations

    Semantic Scholar

    Save

47. Amortized rotation cost in AVL trees

    M. Amani, Kevin A. Lai, R. Tarjan

    2015Information Processing Letters9 citations Open access

    Semantic Scholar

    Save

48. Fibonacci Heaps Revisited

    Haim Kaplan, R. Tarjan, Uri Zwick

    2014arXiv.org9 citations

    Semantic Scholar

    Save

49. Loop Nesting Forests, Dominators, and Applications

    Loukas Georgiadis, L. Laura, Nikos Parotsidis, R. Tarjan

    2014The Sea9 citations

    Semantic Scholar

    Save

50. Deletion without rebalancing in multiway search trees

    Siddhartha Sen, R. Tarjan

    2009International Symposium on Algorithms and Computation9 citations Open access

    Semantic Scholar

    Save