Year |
Citation |
Score |
2020 |
Le T, Sy A, Molloy EK, Zhang Q, Rao S, Warnow T. Using Constrained-INC for Large-scale Gene Tree and Species Tree Estimation. Ieee/Acm Transactions On Computational Biology and Bioinformatics. PMID 32750844 DOI: 10.1109/Tcbb.2020.2990867 |
0.3 |
|
2020 |
Henzinger M, Rao S, Wang D. Local Flow Partitioning for Faster Edge Connectivity Siam Journal On Computing. 49: 1-36. DOI: 10.1137/18M1180335 |
0.462 |
|
2019 |
Zhang Q, Rao S, Warnow T. Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy. Algorithms For Molecular Biology : Amb. 14: 2. PMID 30839943 DOI: 10.1186/S13015-019-0136-9 |
0.327 |
|
2013 |
Mihaescu R, Hill C, Rao S. Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences Algorithmica. 66: 419-449. DOI: 10.1007/S00453-012-9644-4 |
0.362 |
|
2012 |
Snir S, Rao S. Quartet MaxCut: a fast algorithm for amalgamating quartet trees. Molecular Phylogenetics and Evolution. 62: 1-8. PMID 21762785 DOI: 10.1016/J.Ympev.2011.06.021 |
0.391 |
|
2012 |
Awerbuch B, Khandekar R, Rao S. Distributed algorithms for multicommodity flow problems via approximate steepest descent framework Acm Transactions On Algorithms. 9. DOI: 10.1145/2390176.2390179 |
0.444 |
|
2010 |
Snir S, Rao S. Quartets MaxCut: a divide and conquer quartets algorithm. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 7: 704-18. PMID 21030737 DOI: 10.1109/Tcbb.2008.133 |
0.468 |
|
2010 |
Biswal P, Lee JR, Rao S. Eigenvalue bounds, spectral partitioning, and metrical deformations via flows Journal of the Acm. 57: 13. DOI: 10.1145/1706591.1706593 |
0.4 |
|
2010 |
Rao S, Zhou S. Edge Disjoint Paths in Moderately Connected Graphs Siam Journal On Computing. 39: 1856-1887. DOI: 10.1137/080715093 |
0.442 |
|
2010 |
Charikar M, Hajiaghayi MT, Karloff H, Rao S. ℓ 2 2 spreading metrics for vertex ordering problems Algorithmica (New York). 56: 577-604. DOI: 10.1007/S00453-008-9191-1 |
0.44 |
|
2009 |
Khandekar R, Rao S, Vazirani U. Graph partitioning using single commodity flows Journal of the Acm. 56. DOI: 10.1145/1538902.1538903 |
0.421 |
|
2009 |
Arora S, Rao S, Vazirani U. Expander flows, geometric embeddings and graph partitioning Journal of the Acm. 56. DOI: 10.1145/1502793.1502794 |
0.448 |
|
2008 |
Snir S, Warnow T, Rao S. Short quartet puzzling: a new quartet-based phylogeny reconstruction algorithm. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 15: 91-103. PMID 18199023 DOI: 10.1089/Cmb.2007.0103 |
0.315 |
|
2008 |
Arora S, Rao S, Vazirani U. Geometry, flows, and graph-partitioning algorithms Communications of the Acm. 51: 96-105. DOI: 10.1145/1400181.1400204 |
0.415 |
|
2007 |
Fakcharoenphol J, Harrelson C, Rao S. The k-traveling repairmen problem Acm Transactions On Algorithms. 3. DOI: 10.1145/1290672.1290677 |
0.475 |
|
2007 |
Kolliopoulos SG, Rao S. A Nearly Linear-Time Approximation Scheme for the Euclidean $k$-Median Problem Siam Journal On Computing. 37: 757-782. DOI: 10.1137/S0097539702404055 |
0.419 |
|
2006 |
Snir S, Rao S. Using Max Cut to Enhance Rooted Trees Consistency Ieee/Acm Transactions On Computational Biology and Bioinformatics. 3: 323-333. PMID 17085842 DOI: 10.1109/Tcbb.2006.58 |
0.44 |
|
2006 |
Fakcharoenphol J, Rao S. Planar graphs, negative weight edges, shortest paths, and near linear time Journal of Computer and System Sciences. 72: 868-889. DOI: 10.1016/J.Jcss.2005.05.007 |
0.72 |
|
2005 |
Rao S, Richa AW. New approximation techniques for some linear ordering problems Siam Journal On Computing. 34: 388-404. DOI: 10.1137/S0097539702413197 |
0.505 |
|
2004 |
Fakcharoenphol J, Rao S, Talwar K. Approximating metrics by tree metrics Sigact News. 35: 60-70. DOI: 10.1145/992287.992300 |
0.701 |
|
2004 |
Fakcharoenphol J, Rao S, Talwar K. A tight bound on approximating arbitrary metrics by tree metrics Journal of Computer and System Sciences. 69: 485-497. DOI: 10.1016/J.Jcss.2004.04.011 |
0.741 |
|
2004 |
Hildrum K, Kubiatowicz JD, Rao S, Zhao BY. Distributed object location in a dynamic network Theory of Computing Systems. 37: 405-440. DOI: 10.1007/S00224-004-1146-6 |
0.324 |
|
2001 |
Leighton T, Lu C, Rao S, Srinivasan A. New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning Siam Journal On Computing. 31: 626-641. DOI: 10.1137/S0097539700379760 |
0.453 |
|
2000 |
Even G, Naor JS, Rao S, Schieber B. Divide-and-conquer approximation algorithms via spreading metrics Journal of the Acm. 47: 585-616. DOI: 10.1145/347476.347478 |
0.55 |
|
2000 |
Henzinger MR, Rao S, Gabow HN. Computing Vertex Connectivity: New Bounds from Old Techniques Journal of Algorithms. 34: 222-250. DOI: 10.1006/Jagm.1999.1055 |
0.427 |
|
1999 |
Leighton T, Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms Journal of the Acm. 46: 787-832. DOI: 10.1145/331524.331526 |
0.474 |
|
1999 |
Goldberg AV, Rao S. Flows in Undirected Unit Capacity Networks Siam Journal On Discrete Mathematics. 12: 1-5. DOI: 10.1137/S089548019733103X |
0.316 |
|
1998 |
Goldberg AV, Rao S. Beyond the flow decomposition barrier Journal of the Acm. 45: 783-797. DOI: 10.1145/290179.290181 |
0.403 |
|
1997 |
Goldberg LA, Jerrum M, Leighton T, Rao S. Doubly logarithmic communication algorithms for optical-communication parallel computers Siam Journal On Computing. 26: 1100-1119. DOI: 10.1137/S0097539793259483 |
0.336 |
|
1997 |
Kaklamanis C, Krizanc D, Rao S. New Graph Decompositions with Applications to Emulations Theory of Computing Systems \/ Mathematical Systems Theory. 30: 39-49. DOI: 10.1007/Bf02679452 |
0.346 |
|
1997 |
Klein PN, Plotkin SA, Rao S, Tardos É. Approximation Algorithms for Steiner and Directed Multicuts Journal of Algorithms. 22: 241-269. DOI: 10.1006/Jagm.1996.0833 |
0.516 |
|
1995 |
Klein P, Rao S, Agrawal A, Ravi R. An approximate max-flow min-cut relation for undirected multicommodity flow, with applications Combinatorica. 15: 187-202. DOI: 10.1007/Bf01200755 |
0.445 |
|
1994 |
Leighton FT, Maggs BM, Rao SB. Packet routing and job-shop scheduling in O(congestion+dilation) steps Combinatorica. 14: 167-186. DOI: 10.1007/Bf01215349 |
0.308 |
|
Show low-probability matches. |