Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems (Q5505642): Difference between revisions

@@ Property / cites work @@
+How hard is it to control an election?
@@ Property / cites work: How hard is it to control an election? / rank @@
+Normal rank
@@ Property / cites work @@
+On complexity of lobbying in multiple referenda
@@ Property / cites work: On complexity of lobbying in multiple referenda / rank @@
+Normal rank
@@ Property / cites work @@
+When are elections with few candidates hard to manipulate?
+Normal rank
@@ Property / cites work @@
+Threshold dominating sets and an improved characterization of \(W[2]\)
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
+Normal rank
@@ Property / cites work @@
+Copeland Voting Fully Resists Constructive Control
+Normal rank
@@ Property / cites work @@
+Anyone but him: the complexity of precluding an alternative
+Normal rank