Studies in computational aspects of voting: A parameterized complexity perspective

Nadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

46 Scopus citations

Abstract

We review NP-hard voting problems together with their status in terms of parameterized complexity results. In addition, we survey standard techniques for achieving fixed-parameter (in)tractability results in voting.

Original languageEnglish
Title of host publicationThe Multivariate Algorithmic Revolution and Beyond
Subtitle of host publicationEssays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday
EditorsBodlaender Hans, Downey Rod, Fomin Fedor, Marx Daniel
Pages318-363
Number of pages46
DOIs
StatePublished - 27 Jul 2012
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7370
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Studies in computational aspects of voting: A parameterized complexity perspective'. Together they form a unique fingerprint.

Cite this