On the public citation graph

Resolute control: Forbidding candidates from winning an election is hard

https://doi.org/10.1016/j.tcs.2022.02.031
0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.200810020openalex-snapshot
Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-1-4939-2864-4openalex-snapshot
Encyclopedia of Algorithms
inferredcites →https://doi.org/10.1007/978-3-319-21275-3openalex-snapshot
Parameterized Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-30891-8openalex-snapshot
The Multivariate Algorithmic Revolution and Beyond: essays dedicated to Michael R. Fellows on the occasion of His 60th birthday
inferredcites →https://doi.org/10.1007/bf00295861openalex-snapshot
The computational difficulty of manipulating an election
inferredcites →https://doi.org/10.1007/s00453-012-9695-6openalex-snapshot
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion
inferredcites →https://doi.org/10.1007/s10472-013-9359-5openalex-snapshot
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
inferredcites →https://doi.org/10.1016/0895-7177(92)90085-yopenalex-snapshot
How hard is it to control an election?
inferredcites →https://doi.org/10.1016/j.artint.2007.01.005openalex-snapshot
Anyone but him: The complexity of precluding an alternative
inferredcites →https://doi.org/10.1016/j.ipl.2010.03.006openalex-snapshot
Parameterized complexity of control problems in Maximin election
inferredcites →https://doi.org/10.1016/j.tcs.2009.04.004openalex-snapshot
Parameterized computational complexity of control problems in voting systems
inferredcites →https://doi.org/10.1016/j.tcs.2009.05.029openalex-snapshot
Parameterized complexity of candidate control in elections and related digraph problems
inferredcites →https://doi.org/10.1016/j.tcs.2015.04.023openalex-snapshot
Combinatorial voter control in elections
inferredcites →https://doi.org/10.1016/j.tcs.2015.12.023openalex-snapshot
Kernelization complexity of possible winner and coalitional manipulation problems in voting
inferredcites →https://doi.org/10.1017/cbo9781107446984.008openalex-snapshot
Control and Bribery in Voting
inferredcites →https://doi.org/10.1109/tst.2014.6867518openalex-snapshot
Parameterized algorithmics for computational social choice: Nine research challenges
inferredcites →https://doi.org/10.1145/1236457.1236461openalex-snapshot
When are elections with few candidates hard to manipulate?
inferredcites →https://doi.org/10.1145/1839676.1839696openalex-snapshot
Using complexity to protect elections
inferredcites →https://doi.org/10.1613/jair.2566openalex-snapshot
Complexity of Strategic Behavior in Multi-Winner Elections
inferredcites →https://doi.org/10.1613/jair.3136openalex-snapshot
Multimode Control Attacks on Elections
inferredcites →https://doi.org/10.1613/jair.4285openalex-snapshot
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
inferredcites →https://doi.org/10.1613/jair.4927openalex-snapshot
Large-Scale Election Campaigns: Combinatorial Shift Bribery
inferredcites →https://doi.org/10.1613/jair.5515openalex-snapshot
Elections with Few Voters: Candidate Control Can Be Easy

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4640092openalex-extracted
On the Complexity of Winner Determination and Strategic Control in Conditional Approval Voting
inferred← citeshttps://doi.org/10.1007/978-3-031-93930-3_13openalex-snapshot
Search Versus Search for Collapsing Electoral Control Types
inferred← citeshttps://doi.org/10.1016/j.ins.2023.119327openalex-snapshot
A group decision-making and optimization method based on relative inverse number
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115396openalex-snapshot
On the complexity of winner determination and strategic control in conditional approval voting
inferred← citeshttps://doi.org/10.24963/ijcai.2020/43openalex-snapshot
Computational Aspects of Conditional Minisum Approval Voting in Elections with Interdependent Issues
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.