Back to the home page....
Publications
* In computer science, conference publications are often
more influential than journal publications. Full papers are submitted
to conferences for peer review. If accepted, they appear in printed
or electronic proceedings and are presented in conference talks.
Authors may submit refined versions to journals.
† The order of authors has no
significance. Alphabetical order is typical in theoretical computer
science.
- Riesenfeld SJ, Orecchia L, Pollard KS. Optimal design
of oligomer libraries using pseudo-de-Bruijn sets. In
preparation.
- Riesenfeld SJ, Sharpton TJ, Kembel SW, Pollard KS.
MetaFam: A gene family metagenomic simulation pipeline. In
preparation.
- Sharpton TJ, Riesenfeld SJ, Kembel SW, Ladau J, O'Dwyer J, Green
JL, Eisen JA, Pollard KS. PHYLOTU: A high-throughput procedure
quanitifies microbial community diversity and resolves novel taxa from
metagenomic data. In preparation.
- Capra JA, Carbone L, Riesenfeld SJ, Wall JD (2010). Genomics through the lens of
next-generation sequencing. Genome Biology, 11:306.
- *†Daskalakis C, Karp RM, Mossel E, Riesenfeld
S, Verbin E (2009). Sorting and
selection in posets. Proc. Nineteenth Annual ACM-SIAM Symp. on
Discrete Algorithms, 392-401. Journal version submitted.
- †Chaudhuri K, Rao S, Riesenfeld S, Talwar
K (2009). A push-relabel algorithm for
approximating the minimum-degree MST problem and its generalization to
matroids. Theoretical Computer Science, 410(44):4489-4503.
(Invited submission.)
- †Chaudhuri K, Rao S, Riesenfeld S, Talwar
K (2009). What would Edmonds do?
Augmenting paths and witnesses for degree-bounded MSTs.
Algorithmica, 55(1):157-189. (Invited submission.) *Earlier version appears in Proc. 8th
Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems (APPROX), 2005; 3624/2005:26-39.
- Riesenfeld, S (2008). Optimization and reconstruction over
graphs. Ph.D. Thesis, Electrical Engineering and Computer
Sciences Dept, U.C. Berkeley, CA. Technical Report
No. UCB/EECS-2008-6.
- *†Chaudhuri, K, Rao S, Riesenfeld S,
Talwar K (2006). A push-relabel
algorithm for approximating degree bounded MSTs. Proc. 33rd
Intl. Colloq. on Automata, Languages, and Programming (ICALP),
4051/2006:191-201.
- *†Bogdanov A, Maneva E, Riesenfeld S
(2004). Power-aware base station
positioning for sensor networks. Proc. INFOCOM Twenty-third
Annual Joint Conf. of the IEEE Computer and Communications Societies;
1:575-585.
Invited Talks and Conference Presentations
- Building phylogenies with metagenomic sequence reads.
Conference presentation. Biology of Genomes Meeting, Cold Spring
Harbor Laboratory, Cold Spring Harbor, NY, 2010.
- Sorting and ranking in partially
ordered sets. Invited talk, Bay Area Theory Symposium (BATS), IBM
Almaden Research Center, CA, 2006.
- *A push-relabel algorithm for
approximating degree-bounded minimum spanning trees. Conference
presentation, ICALP, Venice, Italy, 2006.
- Inferring reticulate
evolution networks from consensus gene trees. Invited talk,
Cyberinfrastructure for Phylogenetic Research (CIPRES) Annual
All-Hands meeting, San Diego, CA, 2005. †Based on
manuscript by Karp RM, Riesenfeld S, 2004.
- *Sensor networks with base stations. Conference
presentation, INFOCOM, Hong Kong, 2004.
- A probabilistic look at the Schur and van der Waerden
numbers. Conference presentation (with Jager A) at MAA/AMS Joint
Winter Meetings, Baltimore, MD, 1998. †Based on
manuscript by Godbole A, Jager A, Riesenfeld S, 1997.