On the Complexity of Destructive Bribery in Approval-Based Multiwinner Voting
ACM Transactions on Computation Theory
On the Parameterized Complexity of Controlling Amendment and Successive Winners
Algorithmica
On the Complexity of Minimizing Energy Consumption of Partitioning DAG Tasks
Theoretical Computer Science
Joint work with Wei Liu and Jian-jia Chen
On Online Approximation Algorithms for Two-Stage Bins
COCOON 2025
Joint work with Guangwei Wu, Hongyun He, Guozhen Rong, Feng Shi
How Hard Is It to Impact the Impact of Your Paper
IJCAI 2024 pdf
Schedulability Analysis and Performance Optimization for Constrained-Deadline Elastic Tasks
RTNS 2024 PDF
Joint work with Wei Liu and Jian-jia Chen
Group Control for Procedural Rules: Parameterized Complexity and Consecutive Domains
Joint work with Dinko Dimitrov
On the Complexity of Candidates-Embedded Multiwinner Voting under the Hausdorff Function
An FPT Algorithm for Directed Co-Graph Edge Deletion
Joint work with Wenjun Li, Xueying Yang, Chao Xu
Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability
Autonomous Agents and Multiagent Systems
Joing work with Jianxin Wang
A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs
MFCS 2023
Joint work with Guozhen Rong and Wenjun Li
Group Control for Consent Rules with Consecutive Qualifications
Mathematical Social Sciences
Joint work with Dinko Dimitrov
On the Parameterized Complexity of Minimum/Maximum Degree Vertex Deletion on Several Special Graphs
Frontiers of Computer Science
Joint work with Jia Li, Wenjun Li, Xueying Yang
On the Complexity of the Two-Stage Majority Rule
AAMAS 2023
Mask R-CNN Assisted Diagnosis of Spinal Tuberculosis.
Joint work with Wenjun Li, Yanfan Li, Huan Peng, Weijun Liang
Divide-and-Conquer Approach for Reconstruction of ${C_5}$-free Graphs via Betweenness Queries
Joint work with Guozhen Rong, Wenjun Li, and Jianxin Wang
Theoretical Computer Science
A Refined Branching Algorithm for the Maximum Satisfiability Problem
Joint work with Wenjun Li, Chao Xu, Jianxin Wang, and Jianer Chen
Improved Kernel and Algorithm for Claw and Diamond Free Edge Deletion Based on Refined Observations
Joint work with Wenjun Li and Huan Peng
An Improved Branching Algorithm for the Proper Interval Edge Deletion Problem
Joint work with Wenjun Li and Xiaojin Tang
On the Complexity of Calculating Approval-Based Winners in Candidates-Embedded Metrics
IJCAI 2022 (long presentation) PDF (IJCAI)
On the Complexity of Controlling Amendment and Successive Winners
A Model of Winners Allocation
The Nonmanipulative Vote-Deficits of Defending Your Winners
An Improved Algorithm for the $(n, 3)$-MaxSAT Problem: Asking Branchings to Satisfy the Clauses.
Journal of Combinatorial Optimization
Joint work with Chao Xu, Wenjun Li, and Jianxin Wang
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
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
Weak Transitivity and Agenda Control for Extended Stepladder Tournaments.
Joint work with Dinko Dimitrov
A $(2+\epsilon) k$-Vertex Kernel for the Dual Coloring Problem.
Theoretical Computer Science Bib
Joint work with Wenjun Li, Yang Ding, and Guozhen Rong
Reconstruction of Chordal Graphs with a Distance Oracle.
Theoretical Computer Science Bib
Joint work with Guozhen Rong, Wenjun Li, and Jianxin Wang
Incremental Algorithms for the Maximum Internal Spanning Tree Problem
Science China: Information Sciences
Joint work with Xianbin Zhu, Wenjun Li, and Jianxin Wang
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 Bib
Joint work with Gabor Erdelyi and Christian Reger
Parameterized Algorithms of Fundamental NP-hard Problems: A Survey
Human-centric Computing and Information Sciences Bib
Joint work with Wenjun Li, Yang Ding, R. Simon Sherratt, Jong Hyuk Park, and Jin Wang.
Complexity and Algorithms for Superposed Data Uploading Problem in Networks with Smart Devices
IEEE Internet of Things Journal Bib
Joint work with m Wenjun Li, Huayi Xu, Huixi Li, Pradip Kumar Sharma, Jin Wang, and Saurabh Singh
On the Tree Representations of Dichotomous Preferences
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting
Resolution and Domination: An Improved Exact MaxSAT Algorithm
Joint work with Chao Xu, Wenjun Li, Jianer Chen , and Jianxin Wang
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
How Hard Is It to Control A Group?
Joint work with Dinko Dimitrov
The Complexity of Shelflisting
Joint work with Dinko Dimitrov
An Improved Linear Kernel for Complementary Maximal Strip Recovery: Simpler and Smaller
Theoretical Computer Science Bib
Joint work with Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang
On the Complexity of Bribery with Distance Restrictions
Theoretical Computer Science Bib
Joint work with Yash Raj Shrestha and Jiong Guo
Reoptimization of Minimum Latency Problem Revisited: Don't Panic When Asked to Revisit the Route After Local Modifications
Journal of Combinatorial Optimization Bib
Joint work with Wenkai Dai
Fairness in Algorithmic Decision-Making: Applications in Multi-winner Voting, Machine Learning, and Recommender
Joint work with Yash Raj Shrestha
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
Joint work with Dinko Dimitrov
Parameterized Complexity of Voter Control in Multi-Peaked Elections
Joint work with Jiong Guo
On the Kernelization of Split Graph Problems
Joint work with Yash Raj Shrestha, Wenjun Li, and Jiong Guo
Gender Consistent Resolving Rules in Marriage Problems
Discrete Applied Mathematics PDF
Joint work with Dinko Dimitrov and Laura Kasper
Anyone But Them: The Complexity Challenge for A Resolute Election Controller
Joint work with Jianxin Wang
The Complexity of Bribery and Control in Group Identification
Joint work with Gábor Erdélyi and Christian Reger
On the Complexity of Borda Control in Single-Peaked Elections
Approval Voting with Intransitive Preferences
AAMAS 2017 (extended abstract) BibTeX
The Complexity of Control and Bribery in Majority Judgement
Complexity of Group Identification With Partial Information
Joint work with Gabor Erdelyi and Christian Reger
Improved Branching Algorithm for $(n,3)$-{\sc{MaxSAT}} Based on Refined Observations
Joint work with Wenjun Li, Jianxin Wang and Chao Xu
The Complexity of Shelflisting
Joint work with Dinko Dimitrov
A 42k Kernel for the Maximal Strip Recovery Problem
Joint work with Wenjun Li, Haiyan Liu, Jianxin Wang and Lingyun Xiang
The Control Complexity of r-Approval: from the Single-Peaked Case to the General Case
Journal of Computer and System Sciences (JCSS) BibTeX
Joint work with Jiong Guo
Possible Winner Problems on Partial Tournaments: A parameterized Study
Journal of Combinatorial Optimization BibTeX
Joint work with Jiong Guo
How Hard Is Bribery with Distance Restrictions?
Joint work with Yash Raj Shrestha and Jiong Guo
Kernelization of Two Path Searching Problems on Split Graphs
Joint work with Yash Raj Shrestha, Wenjun Li and Jiong Guo
Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems
Theoretical Computer Science BibTeX
Joint work with Jiong Guo
When does Schwartz’ Conjecture Hold?
Joint work with Matthias Mnich and Yash Raj Shrestha
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
How Hard is Control in Multi-Peaked Elections: A Parameterized Study
Joint work with Jiong Guo
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
Towards Optimal Kernel for Edge-Disjoint Triangle Packing
Information Processing Letters BibTex
Election Attacks with Few Candidates.
Planar Graph Vertex Partition for Linear Problem Kernels
Journal of Computer and System Sciences PDF BibTex
Joint work with Jiong Guo, Jianxin Wang and Jianer Chen
Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems
AAMAS 2013 Poster APEX2013 Slides CoRR BibTex
Joint work with Jiong Guo
Complexity of Sincere-Strategy Preference-Based Approval Control in k-Peaked Elections.
Joint work with Jiong Guo
Possible Winner Problems on Partial Tournaments: A Parameterized Study
ADT 2013 (acceptance rate: 33/60=55%) Poster PDF BibTex
Joint work with Jiong Guo