Browsing Theses by Subject "Parameterized complexity"
Now showing items 1-1 of 1
-
Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations
(University of Waterloo, 2013-08-30)In this thesis, we consider approaches to enumeration problems in the parameterized complexity setting. We obtain competitive parameterized algorithms to enumerate all, as well as several of, the solutions for two related ...