Robert Endre Tarjan

298 papers A* 63A 11B 9C 3Misc 1Journal 183Unranked 24

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Simple Concurrent Connected Components Algorithms. ACM Trans. Parallel Comput. Sixue Cliff Liu, Robert Endre Tarjan
2015	J	`jnl`	Amortized Rotation Cost in AVL Trees. CoRR Mahdi Amani, Kevin A. Lai, Robert Endre Tarjan
2015	A	`conf`	Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. ESA Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck
2015	—	`conf`	Hollow Heaps. ICALP (1) Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick
2015	A	`conf`	Minimum Cost Flows in Graphs with Unit Capacities. STACS Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan
2015	J	`jnl`	Rank-Balanced Trees. ACM Trans. Algorithms Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
2014	A	`conf`	A Back-to-Basics Empirical Study of Priority Queues. ALENEX Daniel H. Larkin, Siddhartha Sen, Robert Endre Tarjan
2014	J	`jnl`	A Back-to-Basics Empirical Study of Priority Queues. CoRR Daniel H. Larkin, Siddhartha Sen, Robert Endre Tarjan
2014	A*	`conf`	Better Approximation Algorithms for the Graph Diameter. SODA Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams
2014	J	`jnl`	Corrections to "Finding dominators via disjoint set union" [J. Discrete Algorithms 23 (2013) 2-20]. J. Discrete Algorithms Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan
2014	J	`jnl`	Deletion without rebalancing in multiway search trees. ACM Trans. Database Syst. Siddhartha Sen, Robert Endre Tarjan
2014	A*	`conf`	Disjoint Set Union with Randomized Linking. SODA Ashish Goel, Sanjeev Khanna, Daniel H. Larkin, Robert Endre Tarjan
2014	J	`jnl`	Efficient maximum flow algorithms. Commun. ACM Andrew V. Goldberg, Robert Endre Tarjan
2014	J	`jnl`	Fibonacci Heaps Revisited. CoRR Haim Kaplan, Robert Endre Tarjan, Uri Zwick
2014	B	`conf`	Loop Nesting Forests, Dominators, and Applications. SEA Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan
2014	A	`conf`	Nested Set Union. ESA Daniel H. Larkin, Robert Endre Tarjan
2014	J	`jnl`	The CB tree: a practical concurrent self-adjusting search tree. Distributed Comput. Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan
2013	B	`conf`	Dominator Certification and Independent Spanning Trees: An Experimental Study. SEA Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan
2013	J	`jnl`	Finding Dominators via Disjoint Set Union. CoRR Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan
2013	J	`jnl`	Finding dominators via disjoint set union. J. Discrete Algorithms Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan
2013	J	`jnl`	Soft Heaps Simplified. SIAM J. Comput. Haim Kaplan, Robert Endre Tarjan, Uri Zwick
2012	A*	`conf`	A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs. FOCS Lyle Ramshaw, Robert Endre Tarjan
2012	J	`jnl`	An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. SIAM J. Comput. Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi
2012	A	`conf`	CBTree: A Practical Concurrent Self-Adjusting Search Tree. DISC Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan
2012	J	`jnl`	Dominator Tree Certification and Independent Spanning Trees CoRR Loukas Georgiadis, Robert Endre Tarjan
2012	—	`conf`	Dominators, Directed Bipolar Orders, and Independent Spanning Trees. ICALP (1) Loukas Georgiadis, Robert Endre Tarjan
2012	J	`jnl`	Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. ACM Trans. Algorithms Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
2012	A*	`conf`	Strict fibonacci heaps. STOC Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan
2011	J	`jnl`	A New Approach to Incremental Cycle Detection and Related Problems CoRR Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert Endre Tarjan
2011	J	`jnl`	Data structures for mergeable trees. ACM Trans. Algorithms Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
2011	J	`jnl`	Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance CoRR Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
2011	A	`conf`	Maximum Flows by Incremental Breadth-First Search. ESA Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck
2011	J	`jnl`	Rank-Pairing Heaps. SIAM J. Comput. Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
2011	B	`conf`	Theory vs. Practice in the Design and Analysis of Algorithms. WADS Robert Endre Tarjan
2010	A*	`conf`	Deletion Without Rebalancing in Balanced Binary Trees. SODA Siddhartha Sen, Robert Endre Tarjan
2010	J	`jnl`	HP Transforms Product Portfolio Management with Operations Research. Interfaces Julie Ward, Bin Zhang, Shailendra Jain, Chris Fry, Thomas Olavson, Holger Mishal, Jason Amaral, Dirk Beyer, Ann Brecht, Brian Cargille, Russ Chadinha, Kathy Chou, Gavin DeNyse, Qi Feng, Cookie Padovani, Sesh Raj, Kurt Sunderbruch, Robert Endre Tarjan, Krishna Venkatraman, Joseph Woods, Jing Zhou
2010	—	`book`	Notes on Introductory Combinatorics (reprint of the 1983 edition). George Pólya, Robert Endre Tarjan, Donald R. Woods
2009	A	`conf`	An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2009	B	`conf`	Deletion without Rebalancing in Multiway Search Trees. ISAAC Siddhartha Sen, Robert Endre Tarjan
2009	J	`jnl`	Dynamic trees in practice. ACM J. Exp. Algorithmics Robert Endre Tarjan, Renato Fonseca F. Werneck
2009	C	`conf`	Efficiently Generating k-Best Solutions to Procurement Auctions. AAIM Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Endre Tarjan
2009	J	`jnl`	Heaps Simplified CoRR Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
2009	B	`conf`	Rank-Balanced Trees. WADS Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
2009	A	`conf`	Rank-Pairing Heaps. ESA Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
2009	J	`jnl`	Shortest-path feasibility algorithms: An experimental evaluation. ACM J. Exp. Algorithmics Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2008	C	`conf`	Fast exact and heuristic methods for role minimization problems. SACMAT Alina Ene, William G. Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, Robert Endre Tarjan
2008	—	`conf`	Faster Algorithms for Incremental Topological Ordering. ICALP (1) Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
2008	J	`jnl`	Finding Strongly Knit Clusters in Social Networks. Internet Math. Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert Endre Tarjan
2008	J	`jnl`	Finding a feasible flow in a strongly connected network. Oper. Res. Lett. Bernhard Haeupler, Robert Endre Tarjan
2008	J	`jnl`	Incremental Topological Ordering and Strong Component Maintenance CoRR Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
2008	J	`jnl`	Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. SIAM J. Comput. Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery R. Westbrook
2008	J	`jnl`	Planarity Algorithms via PQ-Trees (Extended Abstract). Electron. Notes Discret. Math. Bernhard Haeupler, Robert Endre Tarjan
2008	B	`conf`	Reachability Problems on Directed Graphs. ISAAC Robert Endre Tarjan
2008	A	`conf`	Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2008	J	`jnl`	Thin heaps, thick heaps. ACM Trans. Algorithms Haim Kaplan, Robert Endre Tarjan
2007	C	`conf`	Clustering Social Networks. WAW Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert Endre Tarjan
2007	J	`jnl`	Data Structures for Mergeable Trees CoRR Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
2007	—	`conf`	Dynamic Trees in Practice. WEA Robert Endre Tarjan, Renato Fonseca F. Werneck
2007	—	`conf`	Experimental Evaluation of Parametric Max-Flow Algorithms. WEA Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou
2007	J	`jnl`	Finding a Feasible Flow in a Strongly Connected Network CoRR Bernhard Haeupler, Robert Endre Tarjan
2007	J	`jnl`	Server Allocation Algorithms for Tiered Systems. Algorithmica Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou
2006	A	`conf`	Balancing Applied to Maximum Network Flow Problems. ESA Robert Endre Tarjan, Julie Ward, Bin Zhang, Yunhong Zhou, Jia Mao
2006	A*	`conf`	Design of data structures for mergeable trees. SODA Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
2006	J	`jnl`	Finding Dominators in Practice. J. Graph Algorithms Appl. Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
2006	J	`jnl`	Melding priority queues. ACM Trans. Algorithms Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
2006	—	`conf`	Results and Problems on Self-adjusting Search Trees and Related Data Structures. SWAT Robert Endre Tarjan
2005	A*	`conf`	Deadline scheduling for animation rendering. SIGMETRICS Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou
2005	A*	`conf`	Dominator tree verification and vertex-disjoint paths. SODA Loukas Georgiadis, Robert Endre Tarjan
2005	A*	`conf`	Self-adjusting top trees. SODA Robert Endre Tarjan, Renato Fonseca F. Werneck
2005	Misc	`conf`	Server Allocation Algorithms for Tiered Systems. COCOON Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou
2005	B	`conf`	Value-maximizing deadline scheduling and its application to animation rendering. SPAA Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou
2004	A	`conf`	Finding Dominators in Practice. ESA Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August
2004	A*	`conf`	Finding dominators revisited: extended abstract. SODA Loukas Georgiadis, Robert Endre Tarjan
2004	—	`conf`	Melding Priority Queues. SWAT Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
2003	A*	`conf`	Dynamic rectangular intersection with priorities. STOC Haim Kaplan, Eyal Molad, Robert Endre Tarjan
2003	J	`jnl`	Graph Clustering and Minimum Cut Trees. Internet Math. Gary William Flake, Robert Endre Tarjan, Kostas Tsioutsiouliklis
2003	—	`ch.`	If Piracy Is the Problem, Is DRM the Answer? Digital Rights Management Stuart Haber, Bill G. Horne, Joe Pato, Tomas Sander, Robert Endre Tarjan
2002	J	`jnl`	Faster Parametric Shortest Path and Minimum Balance Algorithms CoRR Neal E. Young, Robert Endre Tarjan, James B. Orlin
2002	A*	`conf`	Meldable heaps and boolean union-find. STOC Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
2002	A*	`conf`	Union-find with deletions. SODA Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
2001	—	`conf`	Dynamic Self-Checking Techniques for Improved Tamper Resistance. Digital Rights Management Workshop Bill G. Horne, Lesley R. Matheson, Casey Sheehan, Robert Endre Tarjan
2001	A*	`conf`	Faster kinetic heaps and their use in broadcast scheduling. SODA Haim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis
2001	J	`jnl`	Unique Maximum Matching Algorithms. J. Algorithms Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
2000	J	`jnl`	Simple Confluently Persistent Catenable Lists. SIAM J. Comput. Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
1999	J	`jnl`	A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SIAM J. Comput. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
1999	A*	`ed.`	Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA. SODA Robert Endre Tarjan, Tandy J. Warnow
1999	J	`jnl`	Tight Analyses of Two Local Load Balancing Algorithms. SIAM J. Comput. Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
1999	J	`jnl`	Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs. SIAM J. Comput. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
1999	A*	`conf`	Unique Maximum Matching Algorithms. STOC Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
1998	J	`jnl`	Culturally Induced Information Impactedness: A Prescription for Failure in Software Ventures. J. Manag. Inf. Syst. Lesley R. Matheson, Robert Endre Tarjan
1998	—	`conf`	Culturally-Induced Information Impactedness: A Prescription for Failure in Software Ventures. HICSS (6) Lesley R. Matheson, Talal Shamoon, Robert Endre Tarjan
1998	—	`conf`	Robustness and Security of Digital Watermarks. Financial Cryptography Lesley R. Matheson, Stephen G. Mitchell, Talal Shamoon, Robert Endre Tarjan, Francis Zane
1998	—	`conf`	Simple Confluently Persistent Catenable Lists (Extended Abstract). SWAT Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
1997	J	`jnl`	Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. Math. Program. Robert Endre Tarjan
1997	A*	`conf`	Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SODA Haim Kaplan, Ron Shamir, Robert Endre Tarjan
1997	B	`conf`	Faster and simpler algorithm for sorting signed permutations by reversals. RECOMB Haim Kaplan, Ron Shamir, Robert Endre Tarjan
1997	J	`jnl`	Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. Algorithmica Brandon Dixon, Robert Endre Tarjan
1997	J	`jnl`	Toward Efficient Unstructured Multigrid Preprocessing. Int. J. High Perform. Comput. Appl. Susan E. Dorward, Lesley R. Matheson, Robert Endre Tarjan
1996	J	`jnl`	Analysis of Multigrid Algorithms on Massively Parallel Computers: Architectural Implications. J. Parallel Distributed Comput. Lesley R. Matheson, Robert Endre Tarjan
1996	J	`jnl`	Dominating Sets in Planar Graphs. Eur. J. Comb. Lesley R. Matheson, Robert Endre Tarjan
1996	B	`conf`	Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. SPAA Richard Cole, Philip N. Klein, Robert Endre Tarjan
1996	J	`jnl`	Parallelism in multigrid methods: How much is too much? Int. J. Parallel Program. Lesley R. Matheson, Robert Endre Tarjan
1996	A*	`conf`	Purely Functional Representations of Catenable Sorted Lists. STOC Haim Kaplan, Robert Endre Tarjan
1996	—	`conf`	Toward Efficient Unstructured Multigrid Preprocessing (Extended Abstract). IRREGULAR Susan E. Dorward, Lesley R. Matheson, Robert Endre Tarjan
1995	J	`jnl`	A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. J. ACM David R. Karger, Philip N. Klein, Robert Endre Tarjan
1995	J	`jnl`	Computing Minimal Spanning Subgraphs in Linear Time. SIAM J. Comput. Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan
1995	J	`jnl`	Confluently Persistent Deques via Data-Structural Bootstrapping. J. Algorithms Adam L. Buchsbaum, Robert Endre Tarjan
1995	J	`jnl`	Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues. SIAM J. Comput. Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan
1995	J	`jnl`	Lazy Structure Sharing for Query Optimization. Acta Informatica Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan
1995	—	`conf`	Models of parallel computation: a survey and synthesis. HICSS (2) Bruce M. Maggs, Lesley R. Matheson, Robert Endre Tarjan
1995	A*	`conf`	Persistent lists with catenation via recursive slow-down. STOC Haim Kaplan, Robert Endre Tarjan
1995	A*	`conf`	Tight analyses of two local load balancing algorithms. STOC Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
1994	J	`jnl`	A Faster Deterministic Maximum Flow Algorithm. J. Algorithms Valerie King, S. Rao, Robert Endre Tarjan
1994	A*	`conf`	A randomized linear-time algorithm for finding minimum spanning trees. STOC Philip N. Klein, Robert Endre Tarjan
1994	J	`jnl`	Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM J. Comput. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
1994	J	`jnl`	Fully Persistent Lists with Catenation. J. ACM James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan
1994	J	`jnl`	Improved Algorithms for Bipartite Network Flow. SIAM J. Comput. Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert Endre Tarjan
1994	—	`conf`	Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. Canada-France Conference on Parallel and Distributed Computing Brandon Dixon, Robert Endre Tarjan
1994	A*	`conf`	Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping FOCS Haim Kaplan, Ron Shamir, Robert Endre Tarjan
1994	J	`jnl`	Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences. SIAM J. Comput. Rajamani Sundar, Robert Endre Tarjan
1994	—	`conf`	Unstructured Multigrid Strategies on Massively Parallel Computers: A Case for Integrated Design. HICSS (2) Susan E. Dorward, Lesley R. Matheson, Robert Endre Tarjan
1993	J	`jnl`	An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem. SIAM J. Comput. Jiazhen Cai, Xiaofeng Han, Robert Endre Tarjan
1993	A*	`conf`	Confluently Persistent Deques via Data Structural Bootstrapping. SODA Adam L. Buchsbaum, Robert Endre Tarjan
1993	J	`jnl`	Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung
1993	J	`jnl`	Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network. J. Algorithms Heather Booth, Robert Endre Tarjan
1992	A*	`conf`	A Faster Deterministic Maximum Flow Algorithm. SODA Valerie King, S. Rao, Robert Endre Tarjan
1992	J	`jnl`	A Linear-Time Algorithm for Finding an Ambitus. Algorithmica Bhubaneswar Mishra, Robert Endre Tarjan
1992	A*	`conf`	Computing Minimal Spanning Subgraphs in Linear Time. SODA Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan
1992	A*	`conf`	Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues FOCS Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan
1992	J	`jnl`	Erratum: Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
1992	J	`jnl`	Finding minimum-cost flows by double scaling. Math. Program. Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan
1992	J	`jnl`	Maintaining Bridge-Connected and Biconnected Components On-Line. Algorithmica Jeffery R. Westbrook, Robert Endre Tarjan
1992	J	`jnl`	Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung
1992	J	`jnl`	More Efficient Bottom-Up Multi-Pattern Matching in Trees. Theor. Comput. Sci. Jiazhen Cai, Robert Paige, Robert Endre Tarjan
1992	J	`jnl`	Polygon Triangulation in O (n log log n) Time with Simple Data Structures. Discret. Comput. Geom. David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan
1992	J	`jnl`	Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
1992	J	`jnl`	Short Encodings of Evolving Structures. SIAM J. Discret. Math. Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston
1992	J	`jnl`	Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. SIAM J. Comput. Brandon Dixon, Monika Rauch, Robert Endre Tarjan
1991	J	`jnl`	Faster Scaling Algorithms for General Graph-Matching Problems. J. ACM Harold N. Gabow, Robert Endre Tarjan
1991	J	`jnl`	Faster parametric shortest path and minimum-balance algorithms. Networks Neal E. Young, Robert Endre Tarjan, James B. Orlin
1991	A*	`conf`	Fully Persistent Lists with Catenation. SODA James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan
1991	—	`conf`	Randomized Parallel Algorithms for Trapezoidal Diagrams. SCG Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
1991	J	`jnl`	Transitive Compaction in Parallel via Branchings. J. Algorithms Phillip B. Gibbons, Richard M. Karp, Vijaya Ramachandran, Danny Soroker, Robert Endre Tarjan
1991	J	`jnl`	Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Program. Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan
1990	J	`jnl`	Faster Algorithms for the Shortest Path Problem J. ACM Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan
1990	A*	`conf`	Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung
1990	—	`conf`	More Efficient Bottom-Up Tree Pattern Matching. CAAP Jiazhen Cai, Robert Paige, Robert Endre Tarjan
1990	—	`conf`	Polygon Triangulation in O(n log log n) Time with Simple Data-Structures. SCG David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan
1990	J	`jnl`	Simplified Linear-Time Jordan Sorting and Polygon Clipping. Inf. Process. Lett. Khun Yee Fung, Tina M. Nicholl, Robert Endre Tarjan, Christopher J. Van Wyk
1990	A*	`conf`	Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences STOC Rajamani Sundar, Robert Endre Tarjan
1989	J	`jnl`	A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. Discret. Comput. Geom. Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk
1989	J	`jnl`	A Fast Parametric Maximum Flow Algorithm and Applications. SIAM J. Comput. Giorgio Gallo, Michael D. Grigoriadis, Robert Endre Tarjan
1989	J	`jnl`	A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network. Inf. Process. Lett. Andrew V. Goldberg, Robert Endre Tarjan
1989	J	`jnl`	A Tight Amortized Bound for Path Reversal. Inf. Process. Lett. David Ginat, Daniel Dominic Sleator, Robert Endre Tarjan
1989	J	`jnl`	Amortized Analysis of Algorithms for Set Union with Backtracking. SIAM J. Comput. Jeffery R. Westbrook, Robert Endre Tarjan
1989	J	`jnl`	Faster Scaling Algorithms for Network Problems. SIAM J. Comput. Harold N. Gabow, Robert Endre Tarjan
1989	J	`jnl`	Finding minimum-cost circulations by canceling negative cycles. J. ACM Andrew V. Goldberg, Robert Endre Tarjan
1989	J	`jnl`	Improved Time Bounds for the Maximum Flow Problem. SIAM J. Comput. Ravindra K. Ahuja, James B. Orlin, Robert Endre Tarjan
1989	J	`jnl`	Making Data Structures Persistent. J. Comput. Syst. Sci. James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan
1988	—	`conf`	A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. SCG Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk
1988	J	`jnl`	A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest. Inf. Process. Lett. Harold N. Gabow, Robert Endre Tarjan
1988	J	`jnl`	A new approach to the maximum-flow problem. J. ACM Andrew V. Goldberg, Robert Endre Tarjan
1988	J	`jnl`	Algorithms for Two Bottleneck Optimization Problems. J. Algorithms Harold N. Gabow, Robert Endre Tarjan
1988	A*	`conf`	Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems STOC Harold N. Gabow, Robert Endre Tarjan
1988	J	`jnl`	An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon. SIAM J. Comput. Robert Endre Tarjan, Christopher J. Van Wyk
1988	A*	`conf`	Dynamic Perfect Hashing: Upper and Lower Bounds FOCS Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
1988	J	`jnl`	Erratum: An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon. SIAM J. Comput. Robert Endre Tarjan, Christopher J. Van Wyk
1988	A*	`conf`	Finding Minimum-Cost Circulations by Canceling Negative Cycles STOC Andrew V. Goldberg, Robert Endre Tarjan
1988	J	`jnl`	Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation. Commun. ACM James R. Driscoll, Harold N. Gabow, Ruth Shrairman, Robert Endre Tarjan
1987	J	`jnl`	Algorithmic Design. Commun. ACM Robert Endre Tarjan
1987	A*	`conf`	Correction to "A Linear-Time Algorithm for Triangulating Simple Polygons" FOCS Robert Endre Tarjan, Christopher J. Van Wyk
1987	J	`jnl`	Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM Michael L. Fredman, Robert Endre Tarjan
1987	J	`jnl`	Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. Algorithmica Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan
1987	A*	`conf`	Solving Minimum-Cost Flow Problems by Successive Approximation STOC Andrew V. Goldberg, Robert Endre Tarjan
1987	J	`jnl`	Three Partition Refinement Algorithms. SIAM J. Comput. Robert Paige, Robert Endre Tarjan
1986	A*	`conf`	A Linear-Time Algorithm for Triangulating Simple Polygons STOC Robert Endre Tarjan, Christopher J. Van Wyk
1986	J	`jnl`	A Locally Adaptive Data Compression Scheme. Commun. ACM Jon Louis Bentley, Daniel Dominic Sleator, Robert Endre Tarjan, Victor K. Wei
1986	A*	`conf`	A New Approach to the Maximum Flow Problem STOC Andrew V. Goldberg, Robert Endre Tarjan
1986	J	`jnl`	Deques with Heap Order. Inf. Process. Lett. H. Gajewska, Robert Endre Tarjan
1986	J	`jnl`	Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Comb. Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan
1986	—	`conf`	Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. SCG Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan
1986	A*	`conf`	Making Data Structures Persistent STOC James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan
1986	J	`jnl`	Planar Point Location Using Persistent Search Trees. Commun. ACM Neil Sarnak, Robert Endre Tarjan
1986	J	`jnl`	Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs. Discret. Comput. Geom. Pierre Rosenstiehl, Robert Endre Tarjan
1986	A*	`conf`	Rotation Distance, Triangulations, and Hyperbolic Geometry STOC Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston
1986	J	`jnl`	Self-Adjusting Heaps. SIAM J. Comput. Daniel Dominic Sleator, Robert Endre Tarjan
1986	J	`jnl`	Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees Inf. Control. Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan
1986	J	`jnl`	The Pairing Heap: A New Form of Self-Adjusting Heap. Algorithmica Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, Robert Endre Tarjan
1985	J	`jnl`	A Linear Time Solution to the Single Function Coarsest Partition Problem. Theor. Comput. Sci. Robert Paige, Robert Endre Tarjan, Robert Bonic
1985	J	`jnl`	A Linear-Time Algorithm for a Special Case of Disjoint Set Union. J. Comput. Syst. Sci. Harold N. Gabow, Robert Endre Tarjan
1985	J	`jnl`	Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM J. Comput. Robert Endre Tarjan, Mihalis Yannakakis
1985	J	`jnl`	Amortized Efficiency of List Update and Paging Rules. Commun. ACM Daniel Dominic Sleator, Robert Endre Tarjan
1985	J	`jnl`	An Efficient Parallel Biconnectivity Algorithm. SIAM J. Comput. Robert Endre Tarjan, Uzi Vishkin
1985	J	`jnl`	Biased Search Trees. SIAM J. Comput. Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan
1985	J	`jnl`	Decomposition by clique separators. Discret. Math. Robert Endre Tarjan
1985	J	`jnl`	Self-Adjusting Binary Search Trees J. ACM Daniel Dominic Sleator, Robert Endre Tarjan
1985	J	`jnl`	Sequential access in play trees takes linear time. Comb. Robert Endre Tarjan
1985	—	`conf`	Sorting Jordan sequences in linear time. SCG Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan
1985	J	`jnl`	Strongly connected orientations of mixed multigraphs. Networks Fan R. K. Chung, Michael R. Garey, Robert Endre Tarjan
1984	A*	`conf`	A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem. ICALP Robert Paige, Robert Endre Tarjan
1984	J	`jnl`	A Separator Theorem for Graphs of Bounded Genus. J. Algorithms John R. Gilbert, Joan P. Hutchinson, Robert Endre Tarjan
1984	J	`jnl`	A quick method for finding shortest pairs of disjoint paths. Networks J. W. Suurballe, Robert Endre Tarjan
1984	A*	`conf`	Amortized Efficiency of List Update Rules STOC Daniel Dominic Sleator, Robert Endre Tarjan
1984	J	`jnl`	Efficient Algorithms for a Family of Matroid Intersection Problems. J. Algorithms Harold N. Gabow, Robert Endre Tarjan
1984	J	`jnl`	Fast Algorithms for Finding Nearest Common Ancestors. SIAM J. Comput. Dov Harel, Robert Endre Tarjan
1984	A*	`conf`	Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms FOCS Michael L. Fredman, Robert Endre Tarjan
1984	A*	`conf`	Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) FOCS Robert Endre Tarjan, Uzi Vishkin
1984	J	`jnl`	Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations. J. Algorithms Pierre Rosenstiehl, Robert Endre Tarjan
1984	A*	`conf`	Scaling and Related Techniques for Geometry Problems STOC Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan
1984	J	`jnl`	Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM J. Comput. Robert Endre Tarjan, Mihalis Yannakakis
1984	J	`jnl`	Worst-case Analysis of Set Union Algorithms. J. ACM Robert Endre Tarjan, Jan van Leeuwen
1983	J	`jnl`	A Data Structure for Dynamic Trees. J. Comput. Syst. Sci. Daniel Dominic Sleator, Robert Endre Tarjan
1983	A*	`conf`	A Linear-Time Algorithm for a Special Case of Disjoint Set Union STOC Harold N. Gabow, Robert Endre Tarjan
1983	J	`jnl`	An Improved Algorithm for Hierarchical Clustering Using Strong Components. Inf. Process. Lett. Robert Endre Tarjan
1983	—	`book`	Data structures and network algorithms. Robert Endre Tarjan
1983	—	`book`	Notes on introductory combinatorics. George Pólya, Robert Endre Tarjan, Donald R. Woods
1983	A*	`conf`	Self-Adjusting Binary Trees STOC Daniel Dominic Sleator, Robert Endre Tarjan
1983	J	`jnl`	Space-Efficient Implementations of Graph Search Methods. ACM Trans. Math. Softw. Robert Endre Tarjan
1983	J	`jnl`	Updating a Balanced Search Tree in O(1) Rotations. Inf. Process. Lett. Robert Endre Tarjan
1982	J	`jnl`	A Hierarchical Clustering Algorithm Using Strong Components. Inf. Process. Lett. Robert Endre Tarjan
1982	J	`jnl`	Asymptotically tight bounds on time-space trade-offs in a pebble game. J. ACM Thomas Lengauer, Robert Endre Tarjan
1982	J	`jnl`	Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees. Inf. Process. Lett. Robert Endre Tarjan
1982	J	`jnl`	Symbolic Program Analysis in Almost-Linear Time. SIAM J. Comput. John H. Reif, Robert Endre Tarjan
1982	J	`jnl`	The Recognition of Series Parallel Digraphs. SIAM J. Comput. Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler
1981	A*	`conf`	A Data Structure for Dynamic Trees STOC Daniel Dominic Sleator, Robert Endre Tarjan
1981	J	`jnl`	A Unified Approach to Path Problems. J. ACM Robert Endre Tarjan
1981	J	`jnl`	Fast Algorithms for Solving Path Problems. J. ACM Robert Endre Tarjan
1981	J	`jnl`	On a Greedy Heuristic for Complete Matching. SIAM J. Comput. Edward M. Reingold, Robert Endre Tarjan
1981	J	`jnl`	Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines. SIAM J. Comput. M. R. Garey, David S. Johnson, Barbara B. Simons, Robert Endre Tarjan
1980	J	`jnl`	Applications of a Planar Separator Theorem. SIAM J. Comput. Richard J. Lipton, Robert Endre Tarjan
1980	A*	`conf`	Biased 2-3 Trees FOCS Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan
1980	J	`jnl`	Design and Analysis of a Data Structure for Representing Sorted Lists. SIAM J. Comput. Mark R. Brown, Robert Endre Tarjan
1980	A*	`conf`	Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract) STOC Richard M. Karp, Robert Endre Tarjan
1980	J	`jnl`	Linear Expected-Time Algorithms for Connectivity Problems. J. Algorithms Richard M. Karp, Robert Endre Tarjan
1980	J	`jnl`	Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms. SIAM J. Comput. Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Robert Endre Tarjan
1980	A*	`conf`	Prime Subprogram Parsing of a Program. POPL Robert Endre Tarjan
1980	J	`jnl`	The Pebbling Problem is Complete in Polynomial Space. SIAM J. Comput. John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan
1980	J	`jnl`	The Space Complexity of Pebble Games on Trees. Inf. Process. Lett. Thomas Lengauer, Robert Endre Tarjan
1980	J	`jnl`	Variations on the Common Subexpression Problem. J. ACM Peter J. Downey, Ravi Sethi, Robert Endre Tarjan
1979	J	`jnl`	A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. J. Comput. Syst. Sci. Robert Endre Tarjan
1979	J	`jnl`	A Fast Algorithm for Finding Dominators in a Flowgraph. ACM Trans. Program. Lang. Syst. Thomas Lengauer, Robert Endre Tarjan
1979	J	`jnl`	A Fast Merging Algorithm. J. ACM Mark R. Brown, Robert Endre Tarjan
1979	J	`jnl`	A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Inf. Process. Lett. Bengt Aspvall, Michael F. Plass, Robert Endre Tarjan
1979	J	`jnl`	Applications of Path Compression on Balanced Trees. J. ACM Robert Endre Tarjan
1979	A*	`conf`	Efficient Algorithms for Simple Matroid Intersection Problems FOCS Harold N. Gabow, Robert Endre Tarjan
1979	J	`jnl`	Storing a Sparse Table. Commun. ACM Robert Endre Tarjan, Andrew Chi-Chih Yao
1979	A*	`conf`	The Pebbling Problem is Complete in Polynomial Space STOC John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan
1979	A*	`conf`	The recognition of Series Parallel digraphs STOC Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler
1979	A*	`conf`	Upper and Lower Bounds on Time-Space Tradeoffs STOC Thomas Lengauer, Robert Endre Tarjan
1978	J	`jnl`	A Linear-Time Algorithm for Finding All Feedback Vertices. Inf. Process. Lett. M. R. Garey, Robert Endre Tarjan
1978	A*	`conf`	A Representation for Linear Lists with Movable Fingers STOC Mark R. Brown, Robert Endre Tarjan
1978	J	`jnl`	Time-Space Trade-Offs in a Pebble Game. Acta Informatica Wolfgang J. Paul, Robert Endre Tarjan
1978	J	`jnl`	Triangulating a Simple Polygon. Inf. Process. Lett. M. R. Garey, David S. Johnson, Franco P. Preparata, Robert Endre Tarjan
1977	A*	`conf`	Application of a Planar Separator Theorem FOCS Richard J. Lipton, Robert Endre Tarjan
1977	J	`jnl`	Correction: Space Bounds for a Game on Graphs. Math. Syst. Theory Wolfgang J. Paul, Robert Endre Tarjan, James R. Celoni
1977	J	`jnl`	Corrigendum: Computing an Theor. Comput. Sci. Shimon Even, Robert Endre Tarjan
1977	J	`jnl`	Finding a Maximum Independent Set. SIAM J. Comput. Robert Endre Tarjan, Anthony E. Trojanowski
1977	J	`jnl`	Finding optimum branchings. Networks Robert Endre Tarjan
1977	A*	`conf`	Reference Machines Require Non-linear Time to Maintain Disjoint Sets STOC Robert Endre Tarjan
1977	J	`jnl`	Space Bounds for a Game on Graphs. Math. Syst. Theory Wolfgang J. Paul, Robert Endre Tarjan, James R. Celoni
1977	A*	`conf`	Time-Space Trade-Offs in a Pebble Game. ICALP Wolfgang J. Paul, Robert Endre Tarjan
1976	J	`jnl`	A Combinatorial Problem Which Is Complete in Polynomial Space. J. ACM Shimon Even, Robert Endre Tarjan
1976	J	`jnl`	Algorithmic Aspects of Vertex Elimination on Graphs. SIAM J. Comput. Donald J. Rose, Robert Endre Tarjan, George S. Lueker
1976	J	`jnl`	Augmentation Problems. SIAM J. Comput. Kapali P. Eswaran, Robert Endre Tarjan
1976	J	`jnl`	Computing an Theor. Comput. Sci. Shimon Even, Robert Endre Tarjan
1976	J	`jnl`	Edge-Disjoint Spanning Trees and Depth-First Search. Acta Informatica Robert Endre Tarjan
1976	J	`jnl`	Finding Minimum Spanning Trees. SIAM J. Comput. David R. Cheriton, Robert Endre Tarjan
1976	J	`jnl`	Intersection graphs of curves in the plane. J. Comb. Theory B Gideon Ehrlich, Shimon Even, Robert Endre Tarjan
1976	J	`jnl`	Lower bounds on the lengths of node sequences in directed graphs. Discret. Math. George Markowsky, Robert Endre Tarjan
1976	A*	`conf`	Space Bounds for a Game of Graphs STOC Wolfgang J. Paul, Robert Endre Tarjan, James R. Celoni
1976	J	`jnl`	The Planar Hamiltonian Circuit Problem is NP-Complete. SIAM J. Comput. M. R. Garey, David S. Johnson, Robert Endre Tarjan
1976	J	`jnl`	b-Matchings in Trees. SIAM J. Comput. Seymour E. Goodman, Stephen T. Hedetniemi, Robert Endre Tarjan
1975	A*	`conf`	Algorithmic Aspects of Vertex Elimination STOC Donald J. Rose, Robert Endre Tarjan
1975	J	`jnl`	Efficiency of a Good But Not Linear Set Union Algorithm. J. ACM Robert Endre Tarjan
1975	J	`jnl`	Network Flow and Testing Graph Connectivity. SIAM J. Comput. Shimon Even, Robert Endre Tarjan
1975	J	`jnl`	Optimal Chain Partitions of Trees. Inf. Process. Lett. Jayadev Misra, Robert Endre Tarjan
1975	A*	`conf`	a Combinatorial Problem which is Complete in Polynomial Space STOC Shimon Even, Robert Endre Tarjan
1974	J	`jnl`	A Good Algorithm for Edge-Disjoint Branching. Inf. Process. Lett. Robert Endre Tarjan
1974	J	`jnl`	A New Algorithm for Finding Weak Components. Inf. Process. Lett. Robert Endre Tarjan
1974	J	`jnl`	A Note on Finding the Bridges of a Graph. Inf. Process. Lett. Robert Endre Tarjan
1974	J	`jnl`	Efficient Planarity Testing. J. ACM John E. Hopcroft, Robert Endre Tarjan
1974	J	`jnl`	Finding Dominators in Directed Graphs. SIAM J. Comput. Robert Endre Tarjan
1974	J	`jnl`	Testing Flow Graph Reducibility. J. Comput. Syst. Sci. Robert Endre Tarjan
1974	A*	`conf`	Testing Graph Connectivity STOC Robert Endre Tarjan
1973	J	`jnl`	A V log V Algorithm for Isomorphism of Triconnected Planar Graphs. J. Comput. Syst. Sci. John E. Hopcroft, Robert Endre Tarjan
1973	J	`jnl`	Dividing a Graph into Triconnected Components. SIAM J. Comput. John E. Hopcroft, Robert Endre Tarjan
1973	J	`jnl`	Efficient Algorithms for Graph Manipulation [H] (Algorithm 447). Commun. ACM John E. Hopcroft, Robert Endre Tarjan
1973	J	`jnl`	Enumeration of the Elementary Circuits of a Directed Graph. SIAM J. Comput. Robert Endre Tarjan
1973	A*	`conf`	Testing Flow Graph Reducibility STOC Robert Endre Tarjan
1973	J	`jnl`	Time Bounds for Selection. J. Comput. Syst. Sci. Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan
1972	J	`jnl`	Depth-First Search and Linear Graph Algorithms. SIAM J. Comput. Robert Endre Tarjan
1972	J	`jnl`	Determining Whether a Groupoid is a Group. Inf. Process. Lett. Robert Endre Tarjan
1972	—	`conf`	Isomorphism of Planar Graphs. Complexity of Computer Computations John E. Hopcroft, Robert Endre Tarjan
1972	A*	`conf`	Linear Time Bounds for Median Computations STOC Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan
1972	J	`jnl`	Sorting Using Networks of Queues and Stacks. J. ACM Robert Endre Tarjan
1971	J	`jnl`	A V² Algorithm for Determining Isomorphism of Planar Graphs. Inf. Process. Lett. John E. Hopcroft, Robert Endre Tarjan
1971	—	`conf`	Depth-First Search and Linear Graph Algorithms (Working Paper) SWAT Robert Endre Tarjan
1971	—	`conf`	Planarity Testing in IFIP Congress (1) John E. Hopcroft, Robert Endre Tarjan