( en | de | ru )

 

Disambiguation of "Rao, Satish"

Author of the publication

copydeleteadd this publication to your clipboard
On the tandem duplication-random loss model of genome rearrangement.

, , , and . SODA, page 564-570. ACM Press, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Satish Mishra

Satish Koria

Satish Sule

Satish Khurana

Satish Wakchaure

 

Other publications of authors with the same name

An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications., , , and . Combinatorica, 15 (2): 187-202 (1995)Edge Disjoint Paths in Moderately Connected Graphs., and . SIAM J. Comput., 39 (5): 1856-1887 (2010)A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts., and . IPCO, volume 3064 of Lecture Notes in Computer Science, page 325-337. Springer, (2004)New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning., , and . SODA, page 643-652. ACM/SIAM, (1999)Shallow Excluded Minors and Improved Graph Decompositions., , and . SODA, page 462-470. ACM/SIAM, (1994)Fast phylogeny reconstruction through learning of ancestral sequences, , and . CoRR, (2008)Eigenvalue bounds, spectral partitioning, and metrical deformations via flows., , and . J. ACM, 57 (3): 13:1-13:23 (2010)Distributed algorithms for multicommodity flow problems via approximate steepest descent framework., , and . ACM Trans. Algorithms, 9 (1): 3:1-3:14 (2012)What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs., , , and . Algorithmica, 55 (1): 157-189 (2009)l22 spreading metrics for vertex ordering problems., , , and . SODA, page 1018-1027. ACM Press, (2006)