Yongjie Yang

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 74

Top Venues

Saarland University (PHD)

Education History

Saarland University

PHD

Publications

Yongjie Yang
On the Complexity of Candidates-Embedded Multiwinner Voting under the Hausdorff Function. AAMAS (2024)
Wenjun Li, Xueying Yang, Chao Xu, Yongjie Yang
An FPT Algorithm for Directed Co-Graph Edge Deletion. Algorithms 17 (2) (2024)
Yongjie Yang
On the Complexity of the Two-Stage Majority Rule. AAMAS (2023)
Yongjie Yang
On the Parameterized Complexity of Controlling Approval-Based Multiwinner Voting: Destructive Model & Sequential Rules. CoRR (2023)
Yongjie Yang, Dinko Dimitrov
Group control for consent rules with consecutive qualifications. Math. Soc. Sci. 121 (2023)
Guozhen Rong, Yongjie Yang, Wenjun Li
A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs. MFCS (2023)
Yongjie Yang
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting. CoRR (2023)
Yongjie Yang, Jian-xin Wang
Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability. Auton. Agents Multi Agent Syst. 37 (2) (2023)
Yongjie Yang
On the Complexity of the Two-Stage Majority Rule. CoRR (2023)
Wenjun Li, Huan Peng, Yongjie Yang
Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations. Theor. Comput. Sci. 906 (2022)
Guozhen Rong, Yongjie Yang, Wenjun Li
A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs. CoRR (2022)
Guozhen Rong, Yongjie Yang, Wenjun Li, Jianxin Wang
}-free graphs via betweenness queries. Theor. Comput. Sci. 917 (2022)
Yongjie Yang
On the Complexity of Calculating Approval-Based Winners in Candidates-Embedded Metrics. IJCAI (2022)
Xianbin Zhu, Wenjun Li, Yongjie Yang, Jian-Xin Wang
Erratum to: Incremental algorithms for the maximum internal spanning tree problem. Sci. China Inf. Sci. 65 (10) (2022)
Yongjie Yang
On the Complexity of Controlling Amendment and Successive Winners. AAMAS (2022)
Wenjun Li, Chao Xu, Yongjie Yang, Jianer Chen, Jianxin Wang
A Refined Branching Algorithm for the Maximum Satisfiability Problem. Algorithmica 84 (4) (2022)
Yongjie Yang, Dinko Dimitrov
Group Control for Procedural Rules: Parameterized Complexity and Consecutive Domains. CoRR (2022)
Wenjun Li, Xiaojing Tang, Yongjie Yang
An improved branching algorithm for the proper interval edge deletion problem. Frontiers Comput. Sci. 16 (2) (2022)
Yongjie Yang
A Model of Winners Allocation. AAAI (2021)
Chao Xu, Wenjun Li, Jianxin Wang, Yongjie Yang
An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses. J. Comb. Optim. 42 (3) (2021)
Yongjie Yang
The Nonmanipulative Vote-Deficits of Voting Rules. ADT (2021)
Yongjie Yang, Jianxin Wang
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability. CoRR (2021)
Wenjun Li, Yang Ding, Yongjie Yang, Guozhen Rong
-vertex kernel for the dual coloring problem. Theor. Comput. Sci. 868 (2021)
Gábor Erdélyi, Marc Neveling, Christian Reger, Jörg Rothe, Yongjie Yang, Roman Zorn
Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. Auton. Agents Multi Agent Syst. 35 (2) (2021)
Xianbin Zhu, Wenjun Li, Yongjie Yang, Jianxin Wang
Incremental algorithms for the maximum internal spanning tree problem. Sci. China Inf. Sci. 64 (5) (2021)
Guozhen Rong, Wenjun Li, Yongjie Yang, Jianxin Wang
Reconstruction and verification of chordal graphs with a distance oracle. Theor. Comput. Sci. 859 (2021)
Guozhen Rong, Wenjun Li, Jianxin Wang, Yongjie Yang
Cycle Extendability of Hamiltonian Strongly Chordal Graphs. SIAM J. Discret. Math. 35 (3) (2021)
Gábor Erdélyi, Christian Reger, Yongjie Yang
The complexity of bribery and control in group identification. Auton. Agents Multi Agent Syst. 34 (1) (2020)
Wenjun Li, Yang Ding, Yongjie Yang, R. Simon Sherratt, Jong Hyuk Park, Jin Wang
Parameterized algorithms of fundamental NP-hard problems: a survey. Hum. centric Comput. Inf. Sci. 10 (2020)
Yongjie Yang
On the Complexity of Constructive Control under Nearly Single-Peaked Preferences. CoRR (2020)
Yongjie Yang
On the Complexity of Constructive Control Under Nearly Single-Peaked Preferences. ECAI (2020)
Guozhen Rong, Wenjun Li, Jianxin Wang, Yongjie Yang
Cycle Extendability of Hamiltonian Strongly Chordal Graphs. CoRR (2020)
Yongjie Yang, Jianxin Wang
A Refined Study of the Complexity of Binary Networked Public Goods Games. CoRR (2020)
Yongjie Yang
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting. CoRR (2020)
Wenjun Li, Huayi Xu, Huixi Li, Yongjie Yang, Pradip Kumar Sharma, Jin Wang, Saurabh Singh
Complexity and Algorithms for Superposed Data Uploading Problem in Networks With Smart Devices. IEEE Internet Things J. 7 (7) (2020)
Yongjie Yang
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting. AAMAS (2020)
Gábor Erdélyi, Yongjie Yang
Microbribery in Group Identification. AAMAS (2020)
Wenkai Dai, Yongjie Yang
Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications. J. Comb. Optim. 37 (2) (2019)
Yash Raj Shrestha, Yongjie Yang
Fairness in Algorithmic Decision-Making: Applications in Multi-Winner Voting, Machine Learning, and Recommender Systems. Algorithms 12 (9) (2019)
Chao Xu, Wenjun Li, Yongjie Yang, Jianer Chen, Jianxin Wang
Resolution and Domination: An Improved Exact MaxSAT Algorithm. IJCAI (2019)
Yongjie Yang, Jianxin Wang
Complexity of Additive Committee Selection with Outliers. AAMAS (2019)
Aizhong Zhou, Yongjie Yang, Jiong Guo
Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes. AAMAS (2019)
Gábor Erdélyi, Christian Reger, Yongjie Yang
Towards Completing the Puzzle: Solving Open Problems for Control in Elections. AAMAS (2019)
Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang, Yongjie Yang
An improved linear kernel for complementary maximal strip recovery: Simpler and smaller. Theor. Comput. Sci. 786 (2019)
Yongjie Yang
On the Tree Representations of Dichotomous Preferences. IJCAI (2019)
Yongjie Yang
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting. IJCAI (2019)
Yongjie Yang, Dinko Dimitrov
How Hard Is It to Control a Group? AAMAS (2019)
Yongjie Yang, Yash Raj Shrestha, Jiong Guo
On the complexity of bribery with distance restrictions. Theor. Comput. Sci. 760 (2019)
Yongjie Yang, Dinko Dimitrov
How hard is it to control a group? Auton. Agents Multi Agent Syst. 32 (5) (2018)
Yongjie Yang, Jianxin Wang
Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness. IJCAI (2018)
Dinko Dimitrov, Laura Kasper, Yongjie Yang
Gender consistent resolving rules in marriage problems. Discret. Appl. Math. 247 (2018)
Yongjie Yang, Jianxin Wang
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability. AAMAS (2018)
Yongjie Yang, Jiong Guo
Parameterized Complexity of Voter Control in Multi-Peaked Elections. Theory Comput. Syst. 62 (8) (2018)
Yongjie Yang
Complexity of Controlling Nearly Single-Peaked Elections Revisited. AAMAS (2018)
Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo
On the kernelization of split graph problems. Theor. Comput. Sci. 734 (2018)
Yongjie Yang
Recognizing Linked Domain in Polynomial Time. CoRR (2017)
Wenjun Li, Jianxin Wang, Yongjie Yang
Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations. CoRR (2017)
Yongjie Yang, Jiong Guo
The control complexity of r-Approval: From the single-peaked case to the general case. J. Comput. Syst. Sci. 89 (2017)
Gábor Erdélyi, Christian Reger, Yongjie Yang
Complexity of Group Identification with Partial Information. ADT (2017)
Yongjie Yang
Approval Voting with Intransitive Preferences. CoRR (2017)
Gábor Erdélyi, Christian Reger, Yongjie Yang
The Complexity of Bribery and Control in Group Identification. AAMAS (2017)
Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang, Yongjie Yang
A 42k Kernel for the Complementary Maximal Strip Recovery Problem. FAW (2017)
Wenjun Li, Chao Xu, Jianxin Wang, Yongjie Yang
An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations. COCOA (2) (2017)
Yongjie Yang
The Complexity of Control and Bribery in Majority Judgment. AAMAS (2017)
Yongjie Yang, Jianxin Wang
Anyone But Them: The Complexity Challenge for A Resolute Election Controller. AAMAS (2017)
Yongjie Yang, Jiong Guo
Possible winner problems on partial tournaments: a parameterized study. J. Comb. Optim. 33 (3) (2017)
Yongjie Yang
On the Complexity of Borda Control in Single-Peaked Elections. AAMAS (2017)
Yongjie Yang
Approval Voting with Intransitive Preferences. AAMAS (2017)
Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo
Kernelization of Two Path Searching Problems on Split Graphs. FAW (2016)
Yongjie Yang
A Further Step Towards an Understanding of the Tournament Equilibrium Set. CoRR (2016)
Yongjie Yang, Dinko Dimitrov
The Complexity of Shelflisting. CoRR (2016)
Yongjie Yang, Dinko Dimitrov
How Hard Is It to Control A Group? CoRR (2016)
Yongjie Yang, Jiong Guo
Exact algorithms for weighted and unweighted Borda manipulation problems. Theor. Comput. Sci. 622 (2016)
Yongjie Yang, Yash Raj Shrestha, Jiong Guo
How Hard Is Bribery with Distance Restrictions? ECAI (2016)
Matthias Mnich, Yash Raj Shrestha, Yongjie Yang
When Does Schwartz Conjecture Hold? IJCAI (2015)
Yongjie Yang
Manipulation with Bounded Single-Peaked Width: A Parameterized Study. AAMAS (2015)
Yongjie Yang, Jiong Guo
How Hard is Control in Multi-Peaked Elections: A Parameterized Study. AAMAS (2015)
Jiong Guo, Yash Raj Shrestha, Yongjie Yang
How Credible is the Prediction of a Party-Based Election? AAMAS (2015)
Yongjie Yang, Yash Raj Shrestha, Jiong Guo
How Hard is Bribery in Party Based Elections? AAMAS (2015)
Yongjie Yang, Jiong Guo
Controlling elections with bounded single-peaked width. AAMAS (2014)
Jiong Guo, Yash Raj Shrestha, Yongjie Yang
How Credible is the Prediction of a Party-Based Election? CoRR (2014)
Yongjie Yang, Jiong Guo
The control complexity of r-approval: from the single-peaked case to the general case. AAMAS (2014)
Yongjie Yang
Election Attacks with Few Candidates. CoRR (2014)
Yongjie Yang
Towards optimal kernel for edge-disjoint triangle packing. Inf. Process. Lett. 114 (7) (2014)
Yongjie Yang
Election Attacks with Few Candidates. ECAI (2014)
Yongjie Yang, Jiong Guo
Possible Winner Problems on Partial Tournaments: A Parameterized Study. ADT (2013)
Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen
Planar graph vertex partition for linear problem kernels. J. Comput. Syst. Sci. 79 (5) (2013)
Yongjie Yang, Jiong Guo
Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems CoRR (2013)
Yongjie Yang, Jiong Guo
Complexity of Sincere-Strategy Preference-Based Approval Control in k-Peaked Elections CoRR (2013)
Yongjie Yang, Jiong Guo
Exact algorithms for weighted and unweighted borda manipulation problems. AAMAS (2013)
Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen
Linear Problem Kernels for Planar Graph Problems with Small Distance Property. MFCS (2011)

Yongjie Yang.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yongjie Yang