A parameterized view of Matching
and Packing problems
Farah Chanchary
Carleton University

I will present the results from the journal article titled 'Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems' by Fellows et al. (Algorithmica, 2008). This work shows a general framework to obtain algorithms for problems such as $r$-dimensional matching and $r$-set packing when the size $k$ of the solution is considered as a parameter. The framework includes a problem kernelization followed by color-coding technique for fixed-parameter algorithms.