| How Hard is Safe Bribery? | 0 | 0.34 | 2022 |
| Priced Gerrymandering. | 0 | 0.34 | 2022 |
| Distance restricted manipulation in voting | 0 | 0.34 | 2021 |
| Network Robustness via Global k-cores | 0 | 0.34 | 2021 |
| Predicting winner and estimating margin of victory in elections using sampling | 0 | 0.34 | 2021 |
| Local Distance Constrained Bribery In Voting | 0 | 0.34 | 2021 |
| Fair Partitioning of Public Resources: Redrawing District Boundary to Minimize Spatial Inequality in School Funding | 0 | 0.34 | 2021 |
| On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules | 0 | 0.34 | 2020 |
| Manipulating Node Similarity Measures in Network | 0 | 0.34 | 2020 |
| A Parameterized Perspective On Protecting Elections | 0 | 0.34 | 2019 |
| The Social Network Effect on Surprise in Elections. | 1 | 0.35 | 2019 |
| Local Distance Restricted Bribery in Voting. | 0 | 0.34 | 2019 |
| Testing Preferential Domains Using Sampling. | 0 | 0.34 | 2019 |
| Covert Networks: How Hard is It to Hide? | 0 | 0.34 | 2019 |
| Surprise in Elections. | 0 | 0.34 | 2018 |
| Manipulative elicitation – A new attack on elections with incomplete preferences | 0 | 0.34 | 2018 |
| Query Complexity of Tournament Solutions. | 0 | 0.34 | 2017 |
| On the Exact Amount of Missing Information that makes Finding Possible Winners Hard. | 3 | 0.39 | 2017 |
| Proportional Representation in Vote Streams. | 2 | 0.37 | 2017 |
| Resolving the Complexity of Some Fundamental Problems in Computational Social Choice. | 0 | 0.34 | 2017 |
| Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers. | 3 | 0.39 | 2017 |
| Recognizing and Eliciting Weakly Single Crossing Profiles on Trees. | 0 | 0.34 | 2016 |
| Preference Elicitation For Single Crossing Domain. | 4 | 0.42 | 2016 |
| Kernelization complexity of Possible Winner and Coalitional Manipulation problems in voting | 4 | 0.51 | 2016 |
| Complexity of Manipulation with Partial Information in Voting. | 2 | 0.38 | 2016 |
| Elicitation for Preferences Single Peaked on Trees. | 2 | 0.37 | 2016 |
| Fishing out Winners from Vote Streams | 1 | 0.36 | 2015 |
| Frugal Bribery in Voting. | 7 | 0.45 | 2015 |
| Estimating the Margin of Victory of an Election using Sampling | 3 | 0.38 | 2015 |
| On Choosing Committees Based on Approval Votes in the Presence of Outliers | 1 | 0.36 | 2015 |
| Manipulation is Harder with Incomplete Votes. | 0 | 0.34 | 2015 |
| UNO Gets Easier for a Single Player. | 0 | 0.34 | 2014 |
| Complexity of Kernelization in the Possible Winner Problem. | 0 | 0.34 | 2014 |
| Detecting Possible Manipulators in Elections. | 1 | 0.44 | 2014 |
| Asymptotic collusion-proofness of voting rules: the case of large number of candidates | 3 | 0.38 | 2014 |
| Asymptotic Collusion-proofness of Voting Rules when the Number of Candidates is Large | 0 | 0.34 | 2013 |
| Dynamic multipath bandwidth provisioning with jitter, throughput, SLA constraints in MPLS over WDM network | 1 | 0.37 | 2010 |
