research
∙
07/21/2023
Complexity of Conformant Election Manipulation
It is important to study how strategic agents can affect the outcome of ...
share
research
∙
07/20/2023
The Complexity of (P_k, P_ℓ)-Arrowing
For fixed nonnegative integers k and ℓ, the (P_k, P_ℓ)-Arrowing problem ...
research
∙
05/26/2023
Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery
Determining the complexity of election attack problems is a major resear...
research
∙
04/27/2022
Insight into Voting Problem Complexity Using Randomized Classes
The first step in classifying the complexity of an NP problem is typical...
research
∙
05/18/2021
Kemeny Consensus Complexity
The computational study of election problems generally focuses on questi...
research
∙
12/02/2020
Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence
Computing theory analyzes abstract computational models to rigorously st...
research
∙
10/01/2019
Complexity of Stability
Graph parameters such as the clique number, the chromatic number, and th...
research
∙
07/22/2019
The Complexity of Online Bribery in Sequential Elections (Extended Abstract)
Prior work on the complexity of bribery assumes that the bribery happens...
research
∙
06/24/2019
Finding Optimal Solutions With Neighborly Help
Can we efficiently compute optimal solutions to instances of a hard prob...
research
∙
06/19/2019
The Complexity of Online Bribery in Sequential Elections
Prior work on the complexity of bribery assumes that the bribery happens...
research
∙
11/13/2018
Very Hard Electoral Control Problems
It is important to understand how the outcome of an election can be modi...
research
∙
06/22/2018
Election Score Can Be Harder Than Winner
Election systems based on scores generally determine the winner by compu...
research
∙
11/03/2017
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction
We show that the counting class LWPP [FFK94] remains unchanged even if o...
research
∙
11/01/2017