| Year |
Citation |
Score |
| 2015 |
Georgiadis L, Tarjan RE. Dominator tree certification and divergent spanning trees Acm Transactions On Algorithms. 12. DOI: 10.1145/2764913 |
0.681 |
|
| 2015 |
Haeupler B, Sen S, Tarjan RE. Rank-balanced trees Acm Transactions On Algorithms. 11. DOI: 10.1145/2689412 |
0.312 |
|
| 2015 |
Goldberg AV, Hed S, Kaplan H, Kohli P, Tarjan RE, Werneck RF. 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. DOI: 10.1007/978-3-662-48350-3_52 |
0.596 |
|
| 2015 |
Dueholm T, Kaplan H, Tarjan RE, Zwick U. Hollow heaps Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9134: 689-700. DOI: 10.1007/978-3-662-47672-7_56 |
0.304 |
|
| 2014 |
Goldberg AV, Tarjan RE. Efficient maximum flow algorithms Communications of the Acm. 57: 82-89. DOI: 10.1145/2628036 |
0.368 |
|
| 2014 |
Larkin DH, Tarjan RE. Nested set union Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8737: 618-629. DOI: 10.1007/978-3-662-44777-2_51 |
0.313 |
|
| 2014 |
Georgiadis L, Laura L, Parotsidis N, Tarjan RE. 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. DOI: 10.1007/978-3-319-07959-2_15 |
0.725 |
|
| 2014 |
Chechik S, Larkin DH, Roditty L, Schoenebeck G, Tarjan RE, Williams VV. Better approximation algorithms for the graph diameter Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1041-1052. |
0.471 |
|
| 2013 |
Kaplan H, Tarjan RE, Zwick U. Soft heaps simplified Siam Journal On Computing. 42: 1660-1673. DOI: 10.1137/120880185 |
0.32 |
|
| 2013 |
Fraczak W, Georgiadis L, Miller A, Tarjan RE. Finding dominators via disjoint set union Journal of Discrete Algorithms. 23: 2-20. DOI: 10.1016/J.Jda.2013.10.003 |
0.691 |
|
| 2013 |
Georgiadis L, Laura L, Parotsidis N, Tarjan RE. Dominator certification and independent spanning trees: An experimental study Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7933: 284-295. DOI: 10.1007/978-3-642-38527-8_26 |
0.711 |
|
| 2012 |
Haeupler B, Kavitha T, Mathew R, Sen S, Tarjan RE. Incremental cycle detection, topological ordering, and strong component maintenance Acm Transactions On Algorithms. 8. DOI: 10.1145/2071379.2071382 |
0.466 |
|
| 2012 |
Ramshaw L, Tarjan RE. A weight-scaling algorithm for min-cost imperfect matchings in bipartite graphs Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 581-590. DOI: 10.1109/FOCS.2012.9 |
0.335 |
|
| 2012 |
Georgiadis L, Tarjan RE. Dominators, directed bipolar orders, and independent spanning trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7391: 375-386. DOI: 10.1007/978-3-642-31594-7_32 |
0.65 |
|
| 2011 |
Georgiadis L, Kaplan H, Shafrir N, Tarjan RE, Werneck RF. Data structures for mergeable trees Acm Transactions On Algorithms. 7. DOI: 10.1145/1921659.1921660 |
0.74 |
|
| 2011 |
Goldberg AV, Hed S, Kaplan H, Tarjan RE, Werneck RF. Maximum flows by incremental breadth-First search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6942: 457-468. DOI: 10.1007/978-3-642-23719-5_39 |
0.702 |
|
| 2009 |
Tarjan RE, Werneck RF. Dynamic trees in practice Journal of Experimental Algorithmics. 14. DOI: 10.1145/1498698.1594231 |
0.68 |
|
| 2009 |
Byde A, Kelly T, Zhou Y, Tarjan R. Efficiently generating k-best solutions to procurement auctions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5564: 68-84. DOI: 10.1007/978-3-642-02158-9_8 |
0.32 |
|
| 2009 |
Georgiadis L, Goldberg AV, Tarjan RE, Werneck RF. An experimental study of minimum mean cycle algorithms 2009 Proceedings of the 11th Workshop On Algorithm Engineering and Experiments, Alenex 2009. 1-13. |
0.767 |
|
| 2008 |
Cherkassky BV, Georgiadis L, Goldberg AV, Tarjan RE, Werneck RF. Shortest path feasibility algorithms: An experimental evaluation Proceedings of the 10th Workshop On Algorithm Engineering and Experiments and the 5th Workshop On Analytic Algorithmics and Combinatorics. 118-132. DOI: 10.1145/1498698.1537602 |
0.779 |
|
| 2008 |
Kaplan H, Tarjan RE. Thin heaps, thick heaps Acm Transactions On Algorithms. 4. DOI: 10.1145/1328911.1328914 |
0.314 |
|
| 2008 |
Haeupler B, Tarjan RE. Planarity Algorithms via PQ-Trees (Extended Abstract) Electronic Notes in Discrete Mathematics. 31: 143-149. DOI: 10.1016/j.endm.2008.06.029 |
0.507 |
|
| 2008 |
Haeupler B, Kavitha T, Mathew R, Sen S, Tarjan RE. Faster algorithms for incremental topological ordering Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5125: 421-433. DOI: 10.1007/978-3-540-70575-8_35 |
0.467 |
|
| 2007 |
Chaudhuri K, Kothari A, Pendavingh R, Swaminathan R, Tarjan R, Zhou Y. Server allocation algorithms for tiered systems Algorithmica (New York). 48: 129-146. DOI: 10.1007/S00453-007-0052-0 |
0.452 |
|
| 2007 |
Babenko M, Derryberry J, Goldberg A, Tarjan R, Zhou Y. Experimental evaluation of parametric max-flow algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4525: 256-269. |
0.422 |
|
| 2006 |
Georgiadis L, Tarjan RE, Werneck RF. Finding dominators in practice Journal of Graph Algorithms and Applications. 10: 69-94. DOI: 10.7155/Jgaa.00119 |
0.779 |
|
| 2006 |
Mendelson R, Tarjan RE, Thorup M, Zwick U. Melding priority queues Acm Transactions On Algorithms. 2: 535-556. DOI: 10.1145/1198513.1198517 |
0.329 |
|
| 2006 |
Georgiadis L, Tarjan RE, Werneck RF. Design of data structures for mergeable trees Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 394-403. DOI: 10.1145/1109557.1109602 |
0.763 |
|
| 2006 |
Tarjan RE. Results and problems on self-adjusting search trees and related data structures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4059: 2. DOI: 10.1007/11785293_2 |
0.344 |
|
| 2006 |
Tarjan R, Ward J, Zhang B, Zhou Y, Mao J. Balancing applied to maximum network flow problems (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4168: 612-623. |
0.394 |
|
| 2005 |
Tarjan RE. Problems in data structures and algorithms Operations Research/ Computer Science Interfaces Series. 34: 17-39. |
0.397 |
|
| 2005 |
Anderson E, Beyer D, Chaudhuri K, Kelly T, Salazar N, Santos C, Swaminathan R, Tarjan R, Wiener J, Zhou Y. Value-maximizing deadline scheduling and its application to animation rendering Annual Acm Symposium On Parallelism in Algorithms and Architectures. 299-308. |
0.337 |
|
| 2005 |
Georgiadis L, Tarjan RE. Dominator tree verification and vertex-disjoint paths Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 433-442. |
0.647 |
|
| 2005 |
Tarjan RE, Werneck RF. Self-adjusting top trees Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 813-822. |
0.709 |
|
| 2004 |
Flake GW, Tarjan RE, Tsioutsiouliklis K. Graph clustering and minimum cut trees Internet Mathematics. 1: 385-408. DOI: 10.1080/15427951.2004.10129093 |
0.735 |
|
| 2004 |
Georgiadis L, Werneck RF, Tarjan RE, Triantafyllis S, August DI. Finding dominators in practice Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3221: 677-688. |
0.779 |
|
| 2004 |
Georgiadis L, Tarjan RE. Finding Dominators Revisited Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 862-871. |
0.496 |
|
| 2001 |
Gabow HN, Kaplan H, Tarjan RE. Unique Maximum Matching Algorithms Journal of Algorithms. 40: 159-183. DOI: 10.1006/Jagm.2001.1167 |
0.497 |
|
| 2001 |
Kaplan H, Tarjan RE, Tsioutsiouliklis K. Faster kinetic heaps and their use in broadcast scheduling Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 836-844. |
0.72 |
|
| 2000 |
Kaplan H, Shamir R, Tarjan RE. A faster and simpler algorithm for sorting signed permutations by reversals Siam Journal On Computing. 29: 880-892. |
0.451 |
|
| 1999 |
Ghosh B, Leighton FT, Maggs BM, Muthukrishnan S, Plaxton CG, Rajaraman R, Richa AW, Tarjan RE, Zuckerman D. Tight analyses of two local load balancing algorithms Siam Journal On Computing. 29: 29-64. |
0.302 |
|
| 1999 |
Kaplan H, Shamir R, Tarjan RE. Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs Siam Journal On Computing. 28: 1906-1922. |
0.378 |
|
| 1997 |
Tarjan RE. Dynamic trees as search trees via euler tours, applied to the network simplex algorithm Mathematical Programming. 78: 169-177. DOI: 10.1007/BF02614369 |
0.479 |
|
| 1997 |
Dixon B, Tarjan RE. Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time Algorithmica (New York). 17: 11-18. |
0.498 |
|
| 1996 |
Matheson LR, Tarjan RE. Analysis of multigrid algorithms on massively parallel computers: Architectural implications Journal of Parallel and Distributed Computing. 33: 33-43. DOI: 10.1006/jpdc.1996.0022 |
0.397 |
|
| 1995 |
Han X, Kelsen P, Ramachandran V, Tarjan R. Computing Minimal Spanning Subgraphs in Linear Time Siam Journal On Computing. 24: 1332-1358. DOI: 10.1137/S0097539791224509 |
0.574 |
|
| 1994 |
King V, Rao S, Tarjan R. A Faster Deterministic Maximum Flow Algorithm Journal of Algorithms. 17: 447-474. DOI: 10.1006/jagm.1994.1044 |
0.433 |
|
| 1992 |
Cai J, Paige R, Tarjan R. More efficient bottom-up multi-pattern matching in trees Theoretical Computer Science. 106: 21-60. DOI: 10.1016/0304-3975(92)90277-M |
0.41 |
|
| 1992 |
Eppstein D, Italiano GF, Tamassia R, Tarjan RE, Westbrook J, Yung M. Maintenance of a minimum spanning forest in a dynamic plane graph Journal of Algorithms. 13: 33-54. DOI: 10.1016/0196-6774(92)90004-V |
0.5 |
|
| 1992 |
Kirkpatrick DG, Klawe MM, Tarjan RE. Polygon triangulation in O(n log log n) time with simple data structures Discrete & Computational Geometry. 7: 329-346. DOI: 10.1007/BF02187846 |
0.395 |
|
| 1992 |
Mishra B, Tarjan RE. A linear-time algorithm for finding an ambitus Algorithmica. 7: 521-554. DOI: 10.1007/BF01758776 |
0.438 |
|
| 1992 |
Westbrook J, Tarjan RE. Maintaining bridge-connected and biconnected components on-line Algorithmica. 7: 433-464. DOI: 10.1007/BF01758773 |
0.472 |
|
| 1992 |
Ahuja RK, Goldberg AV, Orlin JB, Tarjan RE. Finding minimum-cost flows by double scaling Mathematical Programming. 53: 243-266. DOI: 10.1007/BF01585705 |
0.32 |
|
| 1991 |
Gabow HN, Tarjan RE. Faster scaling algorithms for general graph-matching problems Journal of the Acm. 38: 815-853. DOI: 10.1145/115234.115366 |
0.486 |
|
| 1991 |
Gibbons P, Karp R, Ramachandran V, Soroker D, Tarjan R. Transitive compaction in parallel via branchings Journal of Algorithms. 12: 110-125. DOI: 10.1016/0196-6774(91)90026-U |
0.528 |
|
| 1991 |
Goldberg AV, Grigoriadis MD, Tarjan RE. Use of dynamic trees in a network simplex algorithm for the maximum flow problem Mathematical Programming. 50: 277-290. DOI: 10.1007/BF01594940 |
0.447 |
|
| 1989 |
Ginat D, Sleator DD, Tarjan RE. A tight amortized bound for path reversal Information Processing Letters. 31: 3-5. DOI: 10.1016/0020-0190(89)90101-4 |
0.404 |
|
| 1989 |
Goldberg AV, Tarjan RE. A parallel algorithm for finding a blocking flow in an acyclic network Information Processing Letters. 31: 265-271. DOI: 10.1016/0020-0190(89)90084-7 |
0.364 |
|
| 1989 |
Clarkson KL, Tarjan RE, Van Wyk CJ. A fast las vegas algorithm for triangulating a simple polygon Discrete & Computational Geometry. 4: 423-432. DOI: 10.1007/BF02187741 |
0.43 |
|
| 1988 |
Gabow HN, Tarjan RE. Almost-optimum speed-ups of algorithms for dipartite matching and relatod problems Proceedings of the Annual Acm Symposium On Theory of Computing. 514-527. DOI: 10.1145/62212.62263 |
0.43 |
|
| 1988 |
Goldberg AV, Tarjan RE. Finding minimum-cost circulations by canceling negative cycles Proceedings of the Annual Acm Symposium On Theory of Computing. 388-397. DOI: 10.1145/62212.62250 |
0.41 |
|
| 1988 |
Gabow HN, Tarjan RE. Algorithms for two bottleneck optimization problems Journal of Algorithms. 9: 411-417. DOI: 10.1016/0196-6774(88)90031-4 |
0.393 |
|
| 1988 |
Gabow HN, Tarjan RE. A linear-time algorithm for finding a minimum spanning pseudoforest Information Processing Letters. 27: 259-263. DOI: 10.1016/0020-0190(88)90089-0 |
0.371 |
|
| 1987 |
Guibas L, Hershberger J, Leven D, Sharir M, Tarjan RE. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons Algorithmica. 2: 209-233. DOI: 10.1007/BF01840360 |
0.623 |
|
| 1986 |
Gabow HN, Galil Z, Spencer T, Tarjan RE. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs Combinatorica. 6: 109-122. DOI: 10.1007/Bf02579168 |
0.358 |
|
| 1986 |
Rosenstiehl P, Tarjan RE. Rectilinear planar layouts and bipolar orientations of planar graphs Discrete & Computational Geometry. 1: 343-353. DOI: 10.1007/BF02187706 |
0.412 |
|
| 1986 |
Gilbert JR, Tarjan RE. The analysis of a nested dissection algorithm Numerische Mathematik. 50: 377-404. DOI: 10.1007/BF01396660 |
0.575 |
|
| 1985 |
Paige R, Tarjan RE, Bonic R. A linear time solution to the single function coarsest partition problem Theoretical Computer Science. 40: 67-84. DOI: 10.1016/0304-3975(85)90159-8 |
0.382 |
|
| 1985 |
Gabow HN, Tarjan RE. A linear-time algorithm for a special case of disjoint set union Journal of Computer and System Sciences. 30: 209-221. DOI: 10.1016/0022-0000(85)90014-5 |
0.515 |
|
| 1985 |
Tarjan RE. Decomposition by clique separators Discrete Mathematics. 55: 221-232. DOI: 10.1016/0012-365X(85)90051-2 |
0.422 |
|
| 1985 |
Tarjan RE. Sequential access in splay trees takes linear time Combinatorica. 5: 367-378. DOI: 10.1007/BF02579253 |
0.335 |
|
| 1984 |
Tarjan RE. Input-Output Decomposition of Dynamic Systems is NP-Complete Ieee Transactions On Automatic Control. 29: 863-864. DOI: 10.1109/Tac.1984.1103657 |
0.439 |
|
| 1984 |
Gabow HN, Tarjan RE. Efficient algorithms for a family of matroid intersection problems Journal of Algorithms. 5: 80-131. DOI: 10.1016/0196-6774(84)90042-7 |
0.506 |
|
| 1984 |
Gilbert JR, Hutchinson JP, Tarjan RE. A separator theorem for graphs of bounded genus Journal of Algorithms. 5: 391-407. DOI: 10.1016/0196-6774(84)90019-1 |
0.531 |
|
| 1984 |
Rosenstiehl P, Tarjan RE. Gauss codes, planar hamiltonian graphs, and stack-sortable permutations Journal of Algorithms. 5: 375-390. DOI: 10.1016/0196-6774(84)90018-X |
0.389 |
|
| 1984 |
Tarjan RE. A simple version of Karzanov's blocking flow algorithm Operations Research Letters. 2: 265-268. DOI: 10.1016/0167-6377(84)90076-2 |
0.435 |
|
| 1984 |
Suurballe JW, Tarjan RE. QUICK METHOD FOR FINDING SHORTEST PAIRS OF DISJOINT PATHS Networks. 14: 325-336. |
0.344 |
|
| 1983 |
Tarjan RE. An improved algorithm for hierarchical clustering using strong components Information Processing Letters. 17: 37-41. DOI: 10.1016/0020-0190(83)90088-1 |
0.423 |
|
| 1983 |
Feigenbaum J, Tarjan RE. Two New Kinds of Biased Search Trees Bell System Technical Journal. 62: 3139-3158. DOI: 10.1002/J.1538-7305.1983.Tb03469.X |
0.342 |
|
| 1982 |
Tarjan RE. A hierarchical clustering algorithm using strong components Information Processing Letters. 14: 26-29. DOI: 10.1016/0020-0190(82)90136-3 |
0.303 |
|
| 1982 |
Aspvall B, Plass MF, Tarjan RE. A linear-time algorithm for testing the truth of certain quantified Boolean formulas Information Processing Letters. 14: 195. DOI: 10.1016/0020-0190(79)90002-4 |
0.38 |
|
| 1980 |
Karp RM, Tarjan RE. Linear expected-time algorithms for connectivity problems Proceedings of the Annual Acm Symposium On Theory of Computing. 1980: 368-377. DOI: 10.1145/800141.804686 |
0.499 |
|
| 1979 |
Tarjan RE. A class of algorithms which require nonlinear time to maintain disjoint sets Journal of Computer and System Sciences. 18: 110-127. DOI: 10.1016/0022-0000(79)90042-4 |
0.417 |
|
| 1978 |
Garey MR, Tarjan RE. A linear-time algorithm for finding all feedback vertices Information Processing Letters. 7: 274-276. DOI: 10.1016/0020-0190(78)90015-7 |
0.402 |
|
| 1977 |
Tarjan RE. Reference machines require non-linear time to maintain disjoint sets Proceedings of the Annual Acm Symposium On Theory of Computing. 2: 18-29. DOI: 10.1145/800105.803392 |
0.316 |
|
| 1977 |
Tarjan RE. FINDING OPTIMUM BRANCHINGS Networks. 7: 25-35. |
0.413 |
|
| 1976 |
Even S, Tarjan RE. Computing an st-numbering Theoretical Computer Science. 2: 339-344. DOI: 10.1016/0304-3975(76)90086-4 |
0.428 |
|
| 1976 |
Paul WJ, Tarjan RE, Celoni JR. Space bounds for a game on graphs Mathematical Systems Theory. 10: 239-251. DOI: 10.1007/BF01683275 |
0.31 |
|
| 1976 |
Tarjan RE. Edge-disjoint spanning trees and depth-first search Acta Informatica. 6: 171-185. DOI: 10.1007/BF00268499 |
0.403 |
|
| 1975 |
Read RC, Tarjan RE. BOUNDS ON BACKTRACK ALGORITHMS FOR LISTING CYCLES, PATHS, AND SPANNING TREES Networks. 5: 237-252. |
0.473 |
|
| 1974 |
Hopcroft J, Tarjan R. Efficient Planarity Testing Journal of the Acm (Jacm). 21: 549-568. DOI: 10.1145/321850.321852 |
0.551 |
|
| 1974 |
Tarjan RE. Testing flow graph reducibility Journal of Computer and System Sciences. 9: 355-365. DOI: 10.1016/S0022-0000(74)80049-8 |
0.438 |
|
| 1974 |
Tarjan RE. A new algorithm for finding weak components Information Processing Letters. 3: 13-15. DOI: 10.1016/0020-0190(74)90040-4 |
0.362 |
|
| 1974 |
Tarjan RE. A good algorithm for edge-disjoint branching Information Processing Letters. 3: 51-53. DOI: 10.1016/0020-0190(74)90024-6 |
0.447 |
|
| 1973 |
Hopcroft J, Tarjan R. Algorithm 447: Efficient algorithms for graph manipulation Communications of the Acm. 16: 372-378. DOI: 10.1145/362248.362272 |
0.562 |
|
| 1973 |
Blum M, Floyd RW, Pratt V, Rivest RL, Tarjan RE. Time bounds for selection Journal of Computer and System Sciences. 7: 448-461. DOI: 10.1016/S0022-0000(73)80033-9 |
0.568 |
|
| 1973 |
Hopcroft JE, Tarjan RE. A V log V algorithm for isomorphism of triconnected planar graphs Journal of Computer and System Sciences. 7: 323-331. DOI: 10.1016/S0022-0000(73)80013-3 |
0.41 |
|
| 1971 |
Tarjan RE, Miller CR. An analytical positive manifold algorithm for use with latent class analysis Multivariate Behavioral Research. 6: 363-371. DOI: 10.1207/s15327906mbr0603_6 |
0.375 |
|
| 1971 |
Hopcroft J, Tarjan R. A V2 algorithm for determining isomorphism of planar graphs Information Processing Letters. 1: 32-34. DOI: 10.1016/0020-0190(71)90019-6 |
0.423 |
|
| Show low-probability matches. |