Fixed-Parameter Tractability and Parameterized Complexity Applied to Problems From Computational Social Choice

Claudia Lindner, Jörg Rothe · Research Explorer (The University of Manchester) · 2008

This supplement provides a brief introduction to the field of fixed-parameter tractability and parameterized complexity. Some basic notions are explained and some related results are presented, with a focus on problems arising in the field of computational social choice.

Read the paper · More papers on PaperTik