Introductory talks on Algorithms, Data Structures, and NP-Completeness

• An Introduction to Algorithms
• An Introduction to Data Structures
• Basic Graph Algorithms
• Data Structures for Search and Insertion
• Coping with NP-Completeness: Approximation and Fixed-Parameter Algorithms

Talks on research topics

• The Effect of Girth on the Kernelization Complexity of Connected Dominating Set
  • FSTTCS 2010, Chennai, December 2010
• Subexponential Parameterized Algorithms
  • IMPECS School on Parameterized and Exact Computation, Chennai, December 2010
• Connected Dominating Set in Graphs with (no) Small Cycles: Fixed Parameter Tractability, Kernelization Complexity
  • ALGCO(LIRMM) Montpellier, December 2010
• t-Vertex(Edge) Cover: Fixed Parameter Tractability, Kernelization Complexity
  • University of Bergen, November 2010
• Connected Dominating Set in Graphs with (no) Small Cycles: Fixed Parameter Tractability, Kernelization Complexity
  • Technical University of Berlin, November 2010
• Kernelization; Making Molehills Out of Mountains: A Brief Introduction
  • Institute Seminar Week 2010, IMSc Chennai, March 2010
• FPT Algorithms for Connected Feedback Vertex
  • WALCOM 2010, Dhaka, February 2010
• Polynomial Kernels for Dominating Set in Larger Classes of Graphs
  • WORKER 2009, Bergen, September 2009
• Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
  • ESA 2009, Copenhagen, September 2009