Group Control for Procedural Rules: Parameterized Complexity and Consecutive Domains
Joint work with Dinko Dimitrov
Group Control for Consent Rules with Consecutive Qualifications
Mathematical Social Sciences (2023)
Joint work with Dinko Dimitrov
On the Complexity of the Two-Stage Majority Rule
AAMAS 2023
On the Complexity of Calculating Approval-Based Winners in Candidates-Embedded Metrics
IJCAI 2022 (long presentation)
On the Complexity of Controlling Amendment and Successive Winners
AAMAS 2022 (extended abstract) poster
Towards Completing the Puzzle: Complexity of Control by Replacing, Adding, and Deleting Candidates or Voters
Autonomous Agents and Multi-Agent Systems
Joint work with Gabor Erdelyi, Marc Neveling, Christian Reger, Jörg Rothe, and Roman Zorn
The Nonmanipulative Vote-Deficits of Defending Your Winners
A Model of Winners Allocation
On the Complexity of Destructive Bribery in Approval-Based Multiwinner Voting
Microbribery in Group Identification
Joint work with Gabor Erdelyi
On the Complexity of Constructive Control under Nearly Single-Peaked Preferences
The Complexity of Bribery and Control in Group Identification
Autonomous Agents and Multiagent Systems
Conference version appeared in AAMAS 2017 BibTex
Joint work with Gabor Erdelyi and Christian Reger
On the Tree Representations of Dichotomous Preferences
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting
Towards Completing the Puzzle: Solving Open Problems for Control in Elections
Joint work with Gabor Erderlyi and Christian Reger
Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous
Joint work with Aizhong Zhou and Jiong Guo
The Complexity of Additive Committee Selection with Outliers
Joint work with Jianxin Wang
The Complexity of Shelflisting
Joint work with Dinko Dimitrov
On the Complexity of Bribery with Distance Restrictions
Theoretical Computer Science (2019)
Conference version appeared in ECAI 2016 BibTeX
Joint work with Yash Raj Shrestha and Jiong Guo
Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness
Joint work with Jianxin Wang
Complexity of Controlling Nearly Single-Peaked Elections Revisited (extended abstract)
Parameterized Complexity of Multiwinner Determination: More Effort Towards Fixed-Parameter Tractability
Joint work with Jianxin Wang
How Hard Is It to Control A Group?
Autonomous Agents and Multi-Agent Systems
A 3-page extended abstract appeared in AAMAS 2019 (journal track)
Joint work with Dinko Dimitrov
Parameterized Complexity of Voter Control in Multi-Peaked Elections
Theory of Computing Systems (2018)
Conference version appeared in AAMAS 2015 BibTeX
Joint work with Jiong Guo
Anyone But Them: The Complexity Challenge for A Resolute Election Controller
Joint work with Jianxin Wang
On the Complexity of Borda Control in Single-Peaked Elections
Approval Voting with Intransitive Preferences
The Complexity of Control and Bribery in Majority Judgement
Complexity of Group Identification With Partial Information
Joint work with Gabor Erdelyi and Christian Reger
The Control Complexity of r-Approval: from the Single-Peaked Case to the General Case
Journal of Computer and System Sciences (2017) BibTeX
Joint work with Jiong Guo
Possible Winner Problems on Partial Tournaments: A parameterized Study
Journal of Combinatorial Optimization (2017) BibTeX
Conference version appeared in ADT 2013 Poster PDF BibTex
Joint work with Jiong Guo
Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems
Theoretical Computer Science BibTeX
Conference version appeared in AAMAS 2013 Poster APEX2013 Slides CoRR BibTex
Joint work with Jiong Guo
How Credible is the Prediction of a Party-Based Election?
Joint work with Jiong Guo and Yash Raj Shrestha
How Hard is Bribery in Party Based Elections?
Joint work with Jiong Guo and Yash Raj Shrestha
Manipulation with Bounded Single-Peaked Width: A Parameterized Study
The Control Complexity of r-Approval: from the Single-Peaked Case to the General Case
Joint work with Jiong Guo
Controlling Elections with Bounded Single-Peaked Width
Joint work with Jiong Guo
Election Attacks with Few Candidates.
EXPLORE 2014 ECAI 2014 Slides Poster BibTeX
Weak Transitivity and Agenda Control for Extended Stepladder Tournaments.
Economic Theory Bulletin (2021)
Joint work with Dinko Dimitrov
Gender Consistent Resolving Rules in Marriage Problems
Discrete Applied Mathematics (2018) PDF
Joint work with Dinko Dimitrov and Laura Kasper
On the Parameterized Complexity of Minimum/Maximum Degree Vertex Deletion on Several Special Graphs
Frontiers of Computer Science (2022)
Joint work with Jia Li, Wenjun Li, Xueying Yang
Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations
Theoretical Computer Science (2022)
Joint work with Wenjun Li and Huan Peng
A $(2+\epsilon) k$-Vertex Kernel for the Dual Coloring Problem.
Theoretical Computer Science (2021)
Joint work with Wenjun Li, Yang Ding, and Guozhen Rong
On the Kernelization of Split Graph Problems
Theoretical Computer Science (2018)
Conference version appeared in FAW 2016 BibTeX
Joint work with Yash Raj Shrestha, Wenjun Li, and Jiong Guo
An Improved Linear Kernel for Complementary Maximal Strip Recovery: Simpler and Smaller
Theoretical Computer Science (2019)
Conference version appeared in FAW 2017 BibTeX
Joint work with Wenjun Li, Haiyan Liu, Jianxin Wang and Lingyun Xiang
Towards Optimal Kernel for Edge-Disjoint Triangle Packing
Information Processing Letters (2014) BibTex
Planar Graph Vertex Partition for Linear Problem Kernels
Journal of Computer and System Sciences (2013) PDF BibTex
Conference version appeared in MFCS 2011 Slides PDF BibTex
An Improved Branching Algorithm for the Proper Interval Edge Deletion Problem
Joint work with Wenjun Li and Xiaojin Tang
A Refined Branching Algorithm for the Maximum Satisfiability Problem
Joint work with Wenjun Li, Chao Xu, Jianxin Wang, and Jianer Chen
Resolution and Domination: An Improved Exact MaxSAT Algorithm
Joint work with Chao Xu, Wenjun Li, Jianer Chen , and Jianxin Wang
An Improved Algorithm for the $(n, 3)$-MaxSAT Problem: Asking Branchings to Satisfy the Clauses.
Journal of Combinatorial Optimization
Conference version appeared in COCOA 2017
Joint work with Chao Xu, Wenjun Li, and Jianxin Wang
Divide-and-Conquer Approach for Reconstruction of ${C_5}$-free Graphs via Betweenness Queries
Theoretical Computer Science
Joint work with Guozhen Rong, Wenjun Li, and Jianxin Wang
Reconstruction of Chordal Graphs with a Distance Oracle.
Joint work with Guozhen Rong, Wenjun Li, and Jianxin Wang
Reoptimization of Minimum Latency Problem Revisited: Don't Panic When Asked to Revisit the Route After Local Modifications
Journal of Combinatorial Optimization (2019)
Joint work with Wenkai Dai
Incremental Algorithms for the Maximum Internal Spanning Tree Problem
Science China: Information Sciences (2021)
Joint work with Xianbin Zhu, Wenjun Li, and Jianxin Wang
Complexity and Algorithms for Superposed Data Uploading Problem in Networks with Smart Devices
IEEE Internet of Things Journal (2020)
Joint work with m Wenjun Li, Huayi Xu, Huixi Li, Pradip Kumar Sharma, Jin Wang, and Saurabh Singh
Cycle Extendability of Hamiltonian Strongly Chordal Graphs
to appear in SIAM Journal on Discrete Mathematics
Joint work with Guozhen Rong, Wenjun Li, and Jianxin Wang
When does Schwartz’ Conjecture Hold?
Joint work with Matthias Mnich and Yash Raj Shrestha
Parameterized Algorithms of Fundamental {NP-hard} Problems: A Survey
Human-centric Computing and Information Sciences (2020)
Joint work with Wenjun Li, Yang Ding, R. Simon Sherratt, Jong Hyuk Park, and Jin Wang.
Fairness in Algorithmic Decision-Making: Applications in Multi-winner Voting, Machine Learning, and Recommender
Joint work with Yash Raj Shrestha