A Parameterized Perspective on Attacking and Defending Elections

DOI10.1007/978-3-030-48966-3_21OpenAlexW3028657625MaRDI QIDQ5041198

Neeldhara Misra, Vraj Patel, Kishen N. Gowda

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.03176

zbMATH Keywords

electionsparameterized complexityW-hardness

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Protecting elections by recounting ballots

Cites Work

• On the parameterized complexity of multiple-interval graph problems
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
• A parameterized perspective on protecting elections
• Protecting elections by recounting ballots
• Barriers to Manipulation in Voting
• Control and Bribery in Voting
• Parameterized Algorithms
• Unnamed Item

This page was built for publication: A Parameterized Perspective on Attacking and Defending Elections