Your search returned the following 5 documents:

5. A proof of the Boyd-Carr conjecture
   Frans Schalekamp, David P. Williamson, and Anke van Zuylen
   In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 1477-1486
   
4. Compression via matroids: a randomized polynomial kernel for odd cycle transversal
   Stefan Kratsch and Magnus Wahlström
   In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 94-103
   
3. Rumor spreading and vertex expansion
   George Giakkoupis and Thomas Sauerwald
   In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 1623-1641
   
2. Ultra-fast rumor spreading in social networks
   Nikolaos Fountoulakis, Konstantinos Panagiotou, and Thomas Sauerwald
   In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 1642-1660
   
1. Weak compositions and their applications to polynomial lower bounds for kernelization
   Danny Hermelin and Xi Wu
   In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Tokyo, Japan, 2012, 104-113