Pages that link to "Item:Q1040585"
From MaRDI portal
The following pages link to Parameterized complexity of candidate control in elections and related digraph problems (Q1040585):
Displaying 27 items.
- Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems (Q391210) (← links)
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
- Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Optimal defense against election control by deleting voter groups (Q1647508) (← links)
- Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Resolute control: forbidding candidates from winning an election is hard (Q2143123) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← links)
- Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis (Q2330543) (← links)
- Combinatorial voter control in elections (Q2346381) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
- Multivariate Complexity Analysis of Swap Bribery (Q3058696) (← links)
- On Making a Distinguished Vertex Minimum Degree by Vertex Deletion (Q3075510) (← links)
