Your search returned the following 5 documents:

5. Hitting forbidden minors: Approximation and Kernelization
   Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, and Saket Saurabh
   In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, Dortmund, Germany, 2011, 189-200
   [PDF: Download: forbidden_minors_stacs.pdf]
   
4. Measuring Learning Complexity with Criteria Epitomizers
   John Case and Timo Kötzing
   In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), Dortmund, Germany, 2011, 320-331
   
3. Scheduling for weighted flow time and energy with rejection penalty
   Sze-Hang Chan, Tak-Wah Lam, and Lap-Kei Lee
   In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), Dortmund, Germany, 2011, 392-403
   
2. Continuous monitoring of distributed data streams over a time-based sliding window
   Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, and Hing-Fung Ting
   In: 27th International Symposium on Theoretical Aspects of Computer Science STACS 2010, Nancy, France, 2010, 179-190
   
1. Improved approximation guarantees for weighted matching in the semi-streaming model
   Leah Epstein, Asaf Levin, Julian Mestre, and Danny Segev
   In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Nancy, France, 2010, 347-358