( en | de | ru )

 

Disambiguation of "Riesenfeld, Samantha"

Author of the publication

copydeleteadd this publication to your clipboard
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.

, , , and . Algorithmica, 55 (1): 157-189 (2009)

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.

Samantha Alaimo

Samantha West

Samantha Gamboa

Hermine Riesenfeld

Samantha Antonini

 

Other publications of authors with the same name

Sorting and Selection in Posets., , , , and . SIAM J. Comput., 40 (3): 597-622 (2011)What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs., , , and . Algorithmica, 55 (1): 157-189 (2009)A Push-Relabel Algorithm for Approximating Degree Bounded MSTs., , , and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 191-201. Springer, (2006)Sorting and Selection in Posets, , , , and . CoRR, (2007)Sorting and selection in posets., , , , and . SODA, page 392-401. SIAM, (2009)Power-aware base station positioning for sensor networks., , and . INFOCOM, IEEE, (2004)A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids., , , and . Theor. Comput. Sci., 410 (44): 4489-4503 (2009)PhylOTU: A High-Throughput Procedure Quantifies Microbial Community Diversity and Resolves Novel Taxa from Metagenomic Data., , , , , , , and . PLoS Comput. Biol., (2011)What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs., , , and . APPROX-RANDOM, volume 3624 of Lecture Notes in Computer Science, page 26-39. Springer, (2005)