Presentations

• Budgeted Unique Coverage and Color-Coding At CSR 2009. LaTeX file.
  
• A Polynomial Kernel for the Dominating Set Problem in K_{i,k}-Free Graphs. LaTeX File.
  
• Koenig Vertex Deletion and the Above Guarantee Vertex Cover Problem. At ISAAC 2008, Gold Coast, Australia. LaTeX file.
  
• Koenig-Egervary Subgraphs and the Above Guarantee Vertex Cover Problem. The Indian Algorithms Workshop, Khandala, 2008. LaTeX file.
  
• The Parameterized Complexity of the Unique Coverage Problem. LaTeX file.
  
• The Complexity of Finding Konig-Egervary Subgraphs. LaTeX File.
  
• Designing Exact Algorithms by Enumerating Maximal Independent Sets.
  
• Parameterizing MAX SNP Problems Above Guaranteed Values, The 2nd International Workshop on Parameterized and Exact Computation (IWPEC), ETH Zuerich, 2006. LaTeX file.
  
• Parameterized Complexity of the Induced Subgraph Problem. LaTeX file.
  
• A presentation on `Parameterized Complexity and Exact Algorithms' that I gave at the University of Pisa and Siena in 2005.

Back to homepage.