Linear Problem Kernels for Planar Graph Problems with Small Distance Property. - Jianxin Wang 001; Yongjie Yang 001; Jiong Guo; Jianer Chen (MFCS, 2011)

Complexity of Sincere-Strategy Preference-Based Approval Control in k-Peaked Elections - Yongjie Yang 001; Jiong Guo (CoRR, 2013)

Planar graph vertex partition for linear problem kernels. - Jianxin Wang 001; Yongjie Yang 001; Jiong Guo; Jianer Chen (J. Comput. Syst. Sci., 2013)

Controlling elections with bounded single-peaked width. - Yongjie Yang 001; Jiong Guo (AAMAS, 2014)

Election Attacks with Few Candidates. - Yongjie Yang 001 (ECAI, 2014)

Towards optimal kernel for edge-disjoint triangle packing. - Yongjie Yang 001 (Inf. Process. Lett., 2014)

How Credible is the Prediction of a Party-Based Election? - Jiong Guo; Yash Raj Shrestha; Yongjie Yang 001 (AAMAS, 2015)

Manipulation with Bounded Single-Peaked Width: A Parameterized Study. - Yongjie Yang 001 (AAMAS, 2015)

How Hard is Control in Multi-Peaked Elections: A Parameterized Study. - Yongjie Yang 001; Jiong Guo (AAMAS, 2015)

How Hard is Bribery in Party Based Elections? - Yongjie Yang 001; Yash Raj Shrestha; Jiong Guo (AAMAS, 2015)

When Does Schwartz Conjecture Hold? - Matthias Mnich; Yash Raj Shrestha; Yongjie Yang 001 (IJCAI, 2015)

A deep exploration of the complexity border of strategic voting problems. - Yongjie Yang 001 (2015)

How Hard Is Bribery with Distance Restrictions? - Yongjie Yang 001; Yash Raj Shrestha; Jiong Guo (ECAI, 2016)

Kernelization of Two Path Searching Problems on Split Graphs. - Yongjie Yang 001; Yash Raj Shrestha; Wenjun Li 001; Jiong Guo (FAW, 2016)

A Further Step Towards an Understanding of the Tournament Equilibrium Set. - Yongjie Yang 001 (CoRR, 2016)

The Complexity of Shelflisting. - Yongjie Yang 001; Dinko Dimitrov (CoRR, 2016)

Exact algorithms for weighted and unweighted Borda manipulation problems. - Yongjie Yang 001; Jiong Guo (Theor. Comput. Sci., 2016)

Complexity of Group Identification with Partial Information. - Gábor Erdélyi; Christian Reger; Yongjie Yang 001 (ADT, 2017)

The Complexity of Control and Bribery in Majority Judgment. - Yongjie Yang 001 (AAMAS, 2017)

On the Complexity of Borda Control in Single-Peaked Elections. - Yongjie Yang 001 (AAMAS, 2017)

Approval Voting with Intransitive Preferences. - Yongjie Yang 001 (AAMAS, 2017)

Anyone But Them: The Complexity Challenge for A Resolute Election Controller. - Yongjie Yang 001; Jianxin Wang 001 (AAMAS, 2017)

An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations. - Wenjun Li 001; Chao Xu 010; Jianxin Wang 001; Yongjie Yang 001 (COCOA (2), 2017)

A 42k Kernel for the Complementary Maximal Strip Recovery Problem. - Wenjun Li 001; Haiyan Liu; Jianxin Wang 001; Lingyun Xiang; Yongjie Yang 001 (FAW, 2017)

Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations. - Wenjun Li 001; Jianxin Wang 001; Yongjie Yang 001 (CoRR, 2017)

Recognizing Linked Domain in Polynomial Time. - Yongjie Yang 001 (CoRR, 2017)

Possible winner problems on partial tournaments: a parameterized study. - Yongjie Yang 001; Jiong Guo (J. Comb. Optim., 2017)

The control complexity of r-Approval: From the single-peaked case to the general case. - Yongjie Yang 001; Jiong Guo (J. Comput. Syst. Sci., 2017)

Complexity of Controlling Nearly Single-Peaked Elections Revisited. - Yongjie Yang 001 (AAMAS, 2018)

Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability. - Yongjie Yang 001; Jianxin Wang 001 (AAMAS, 2018)

Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness. - Yongjie Yang 001; Jianxin Wang 001 (IJCAI, 2018)

How hard is it to control a group? - Yongjie Yang 001; Dinko Dimitrov (Auton. Agents Multi Agent Syst., 2018)

Gender consistent resolving rules in marriage problems. - Dinko Dimitrov; Laura Kasper; Yongjie Yang 001 (Discret. Appl. Math., 2018)

Parameterized Complexity of Voter Control in Multi-Peaked Elections. - Yongjie Yang 001; Jiong Guo (Theory Comput. Syst., 2018)

On the kernelization of split graph problems. - Yongjie Yang 001; Yash Raj Shrestha; Wenjun Li 001; Jiong Guo (Theor. Comput. Sci., 2018)

Towards Completing the Puzzle: Solving Open Problems for Control in Elections. - Gábor Erdélyi; Christian Reger; Yongjie Yang 001 (AAMAS, 2019)

Complexity of Additive Committee Selection with Outliers. - Yongjie Yang 001; Jianxin Wang 001 (AAMAS, 2019)

Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes. - Aizhong Zhou; Yongjie Yang 001; Jiong Guo (AAMAS, 2019)

Resolution and Domination: An Improved Exact MaxSAT Algorithm. - Chao Xu 010; Wenjun Li 001; Yongjie Yang 001; Jianer Chen; Jianxin Wang 001 (IJCAI, 2019)

Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting. - Yongjie Yang 001 (IJCAI, 2019)

On the Tree Representations of Dichotomous Preferences. - Yongjie Yang 001 (IJCAI, 2019)

Fairness in Algorithmic Decision-Making: Applications in Multi-Winner Voting, Machine Learning, and Recommender Systems. - Yash Raj Shrestha; Yongjie Yang 001 (Algorithms, 2019)

Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications. - Wenkai Dai; Yongjie Yang 001 (J. Comb. Optim., 2019)

An improved linear kernel for complementary maximal strip recovery: Simpler and smaller. - Wenjun Li 001; Haiyan Liu; Jianxin Wang 001; Lingyun Xiang; Yongjie Yang 001 (Theor. Comput. Sci., 2019)

On the complexity of bribery with distance restrictions. - Yongjie Yang 001; Yash Raj Shrestha; Jiong Guo (Theor. Comput. Sci., 2019)

On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting. - Yongjie Yang 001 (AAMAS, 2020)

Microbribery in Group Identification. - Gábor Erdélyi; Yongjie Yang 001 (AAMAS, 2020)

On the Complexity of Constructive Control Under Nearly Single-Peaked Preferences. - Yongjie Yang 001 (ECAI, 2020)

The complexity of bribery and control in group identification. - Gábor Erdélyi; Christian Reger; Yongjie Yang 001 (Auton. Agents Multi Agent Syst., 2020)

A Refined Study of the Complexity of Binary Networked Public Goods Games. - Yongjie Yang 001; Jianxin Wang 001 (CoRR, 2020)

Parameterized algorithms of fundamental NP-hard problems: a survey. - Wenjun Li 001; Yang Ding; Yongjie Yang 001; R. Simon Sherratt; Jong Hyuk Park 001; Jin Wang 001 (Hum. centric Comput. Inf. Sci., 2020)

Complexity and Algorithms for Superposed Data Uploading Problem in Networks With Smart Devices. - Wenjun Li 001; Huayi Xu; Huixi Li; Yongjie Yang 001; Pradip Kumar Sharma; Jin Wang 001; Saurabh Singh 006 (IEEE Internet Things J., 2020)

A Model of Winners Allocation. - Yongjie Yang 001 (AAAI, 2021)

The Nonmanipulative Vote-Deficits of Voting Rules. - Yongjie Yang 001 (ADT, 2021)

Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. - Gábor Erdélyi; Marc Neveling; Christian Reger; Jörg Rothe; Yongjie Yang 001; Roman Zorn (Auton. Agents Multi Agent Syst., 2021)

Incremental algorithms for the maximum internal spanning tree problem. - Xianbin Zhu 003; Wenjun Li 001; Yongjie Yang 001; Jianxin Wang 001 (Sci. China Inf. Sci., 2021)

An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses. - Chao Xu 010; Wenjun Li 001; Jianxin Wang 001; Yongjie Yang 001 (J. Comb. Optim., 2021)

Cycle Extendability of Hamiltonian Strongly Chordal Graphs. - Guozhen Rong; Wenjun Li 001; Jianxin Wang 001; Yongjie Yang 001 (SIAM J. Discret. Math., 2021)

A (2 + ϵ)k-vertex kernel for the dual coloring problem. - Wenjun Li 001; Yang Ding; Yongjie Yang 001; Guozhen Rong (Theor. Comput. Sci., 2021)

Reconstruction and verification of chordal graphs with a distance oracle. - Guozhen Rong; Wenjun Li 001; Yongjie Yang 001; Jianxin Wang 001 (Theor. Comput. Sci., 2021)

On the Complexity of Controlling Amendment and Successive Winners. - Yongjie Yang 001 (AAMAS, 2022)

On the Complexity of Calculating Approval-Based Winners in Candidates-Embedded Metrics. - Yongjie Yang 001 (IJCAI, 2022)

A Refined Branching Algorithm for the Maximum Satisfiability Problem. - Wenjun Li 001; Chao Xu 010; Yongjie Yang 001; Jianer Chen; Jianxin Wang 001 (Algorithmica, 2022)

Erratum to: Incremental algorithms for the maximum internal spanning tree problem. - Xianbin Zhu 003; Wenjun Li 001; Yongjie Yang 001; Jian-Xin Wang 001 (Sci. China Inf. Sci., 2022)

An improved branching algorithm for the proper interval edge deletion problem. - Wenjun Li 001; Xiaojing Tang; Yongjie Yang 001 (Frontiers Comput. Sci., 2022)

Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations. - Wenjun Li 001; Huan Peng; Yongjie Yang 001 (Theor. Comput. Sci., 2022)

A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries. - Guozhen Rong; Yongjie Yang 001; Wenjun Li 001; Jianxin Wang 001 (Theor. Comput. Sci., 2022)

On the Complexity of the Two-Stage Majority Rule. - Yongjie Yang 001 (AAMAS, 2023)

Mask R-CNN assisted diagnosis of spinal tuberculosis. - Wenjun Li 001; Yanfan Li; Huan Peng; Yongjie Yang 001; Weijun Liang (ICSAI, 2023)

A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs. - Guozhen Rong; Yongjie Yang 001; Wenjun Li 001 (MFCS, 2023)

On the Parameterized Complexity of Controlling Approval-Based Multiwinner Voting: Destructive Model & Sequential Rules. - Yongjie Yang 001 (CoRR, 2023)

Group control for consent rules with consecutive qualifications. - Yongjie Yang 001; Dinko Dimitrov (Math. Soc. Sci., 2023)

On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs. - Jia Li; Wenjun Li 001; Yongjie Yang 001; Xueying Yang (Frontiers Comput. Sci., 2023)

Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability. - Yongjie Yang 001; Jian-xin Wang 001 (Auton. Agents Multi Agent Syst., 2023)

On the Complexity of Candidates-Embedded Multiwinner Voting under the Hausdorff Function. - Yongjie Yang 001 (AAMAS, 2024)

How Hard Is It to Impact the Impact of Your Paper? - Yongjie Yang 001 (IJCAI, 2024)

Schedulability Analysis and Performance Optimization for Constrained-Deadline Elastic Tasks. - Wei Liu 022; Jian-Jia Chen; Yongjie Yang 001 (RTNS, 2024)

An FPT Algorithm for Directed Co-Graph Edge Deletion. - Wenjun Li 001; Xueying Yang; Chao Xu 010; Yongjie Yang 001 (Algorithms, 2024)

Group control for procedural rules: parameterized complexity and consecutive domains. - Yongjie Yang 001; Dinko Dimitrov (Frontiers Comput. Sci., 2024)

On Online Approximation Algorithms for Two-Stage Bins. - Guangwei Wu; Hongyun He; Guozhen Rong; Feng Shi 003; Yongjie Yang 001 (COCOON (1), 2025)

On the complexity of minimizing energy consumption of partitioning DAG tasks. - Wei Liu 022; Jian-Jia Chen; Yongjie Yang 001 (Theor. Comput. Sci., 2025)

On the Parameterized Complexity of Controlling Amendment and Successive Winners. - Yongjie Yang 001 (Algorithmica, 2025)