Talks

I try as much as possible to make all my slides avaible in this space. If you cannot find something, send me email.

The title of each talk links to the slides; you are welcome to use them. In an attempt to make as many slides available as possible, I also included a few presentations I've given on behalf of others. Presentations based on papers that I'm not a co-author are marked with (*). Enjoy!


  1. Universal Scheduling Google Sydney, Australia, 2011
  2. Tree-Constrained Matching Combinatorial Optimization & Graph Algorithms group, TU Berlin Berlin, Germany, 2011
  3. Universal Scheduling on a single machine National ICT Australia Sdyney, Australia, 2011
  4. Improved Bounds for Stochastic Matching 34th Australasian Conference on Combinatorial Mathematics & Combinatorial Computing Canberra, Australia, 2010
  5. The Checkpoint Problem 13th Internation Workshop on Approximation Algorithms for Combinatorial Optimization Problems Barcelona, Spain, 2010.
  6. Robust Scheduling 10th Max-Planck Advanced Course on the Foundations of Computer Science. Saarbrücken, Germany, 2009.
  7. Matching Problems Senior Research Series, Max-Planck-Institut für Informatik. Saarbrücken, Germany, 2009.
  8. News from ICALP 2009 (*) Noon seminar, Max-Planck-Institut für Informatik. Saarbrücken, Germany, 2009.
  9. Popular Mixed Matchings 36th International Colloquium on Automata, Languages and Programming Rhodes, Greece, 2009.
  10. Popular Matchings Microsoft Research Bangalore. Bangalore, India, 2009.
  11. An Optimal Incremental Algorithm for Minimizing Lateness with Rejection 12th Annual European Symposium of Algorithms. Karlsruhe, Germany, 2008
  12. The Interval Constrained Coloring Problem AG3 Group Meeting. Saarbrücken, Germany, 2008.
  13. Popular Matchings 9th Max-Planck Advanced Course on the Foundations of Computer Science. Saarbrücken, Germany, 2008.
  14. Approximating the Interval Constrained Coloring Problem 11th Scandinavian Workshop on Algorithm Theory. Göteborg, Sweden, 2008.
  15. Lagrangian Relaxation and Partial Cover 25th Annual Symposium on Theoretical Aspects of Computer Science. Bordeaux, France, 2008.
  16. SODA Report (*) Noon seminar, Max-Planck-Institut für Informatik. Saarbrücken, Germany, 2008.
  17. Adaptive Local Ratio 19th Symposium on Discrete Algorithms. San Francisco, USA, 2008.
  18. Improved Algorithmic Versions of the Lovasz Local Lemma (*) 19th Symposium on Discrete Algorithms. San Francisco, USA, 2008.
  19. Adaptive Local Ratio Noon seminar, Max-Planck-Institut für Informatik. Saarbrücken, Germany, 2007.
  20. The Gas Station Problem 11th Annual European Symposium of Algorithms. Eilat, Israel, 2007.
  21. A Look at the Optimization Landscape of the Maximum Independent Set Problem (*) Capital Areas Theory Seminar, University of Maryland. College Park, USA, 2007.
  22. Adaptive Local Ratio NDSSL Seminar, Virginia Tech. Blacksburg, USA, 2007.
  23. Combinatorial Algorithms for Data Migration Computer Science Colloquium, Technion. Haifa, Israel, 2006.
  24. Greedy in Approximation Algorithms 10th Annual European Symposium of Algorithms. Zurich, Switzerland, 2006.
  25. The Gas Station Problem Noon Seminar, Max-Planck-Institut für Informatik. Saarbrücken, Germany, 2006.
  26. Combinatorial Algorithms for Data Migration 9th Internation Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Barcelona, Spain, 2006.
  27. Improved Algorithms for Data Migration (*) 9th Internation Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Barcelona, Spain, 2006.
  28. Weighted Popular Matchings 33rd International Colloquium on Automata, Languages and Programming. Venice, Italy, 2006.
  29. Combinatorial Algorithms for Data Migration Capital Area Theory Seminar, University of Maryland. College Park, USA, 2006.
  30. Weighted Popular Matchings University of Pennsylvania. Philadelphia, USA, 2005.
  31. A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses 8th Internation Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Berkeley, USA, 2005.
  32. Weighted Popular Matchings Capital Area Theory Seminar, University of Maryland. College Park, USA, 2005.
  33. Saving an Epsilon: a 2-approximation for the k-MST problem in graphs (*) 37th Annual ACM Symposium on Theory of Computing. Baltimore, USA, 2005.
  34. A Primal-Dual Approximation Algorithm for Partial Vertex Cover Capital Area Theory Seminar, University of Maryland. College Park, USA, 2005.
  35. Linear time approximation algorithms for the maximum weight matching problem. (*) Capital Area Theory Seminar, University of Maryland College Park, USA, 2004.
  36. New sparseness results on graph spanners. (*) Capital Area Theory Seminar, University of Maryland. College Park, USA, 2004.