关注
Yongjie Yang
Yongjie Yang
在 mmci.uni-saarland.de 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Parameterized algorithms of fundamental NP-hard problems: A survey
W Li, Y Ding, Y Yang, RS Sherratt, JH Park, J Wang
Human-centric Computing and Information Sciences 10, 1-24, 2020
802020
Complexity and Algorithms for Superposed Data Uploading Problem in Networks with Smart Devices
W Li, X Huayi, H Li, Y Yang, PK Sharma, J Wang, S Singh
IEEE Internet of Things, 2020
722020
Fairness in algorithmic decision-making: Applications in multi-winner voting, machine learning, and recommender systems
YR Shrestha, Y Yang
Algorithms 12 (9), 199, 2019
572019
An improved linear kernel for complementary maximal strip recovery: Simpler and smaller
W Li, H Liu, J Wang, L Xiang, Y Yang
Theoretical Computer Science 786, 55-66, 2019
382019
The Control Complexity of r-Approval: from the Single-Peaked Case to the General Case
Y Yang, J Guo
Journal of Computer and System Sciences (JCSS) 89, 432-449, 2017
352017
Controlling Elections with Bounded Single-Peaked Width
Y Yang, J Guo
13th International Conference on Autonomous Agents and Multiagent Systems …, 2014
32*2014
The Complexity of Bribery and Control in Group Identification
G Erdelyi, C Reger, Y Yang
16th International Conference on Autonomous Agents and Multiagent Systems …, 2017
312017
Manipulation with Bounded Single-Peaked Width: A Parameterized Study
Y Yang
14th International Conference on Autonomous Agents and Multiagent Systems …, 2015
282015
Planar Graph Vertex Partition for Linear Problem Kernels
J Wang, Y Yang, J Guo, J Chen
Journal of Computer and System Sciences (JCSS) 79 (5), 609-621, 2013
28*2013
Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness.
Y Yang, J Wang
27th International Joint Conference on Artificial Intelligence (IJCAI 2018 …, 2018
252018
On the Complexity of Borda Control in Single-Peaked Elections
Y Yang
16th International Conference on Autonomous Agents and Multiagent Systems …, 2017
192017
How Hard Is It to Control A Group?
Y Yang, D Dimitrov
Autonomous Agents and Multi-Agent Systems 32 (5), 672--692, 2018
182018
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting
Y Yang
28th International Joint Conference on Artificial Intelligence (IJCAI 2019 …, 2019
17*2019
Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters
G Erdélyi, M Neveling, C Reger, J Rothe, Y Yang, R Zorn
Autonomous Agents and Multi-Agent Systems 35, 1-48, 2021
162021
On the Tree Representations of Dichotomous Preferences
Y Yang
28th International Joint Conference on Artificial Intelligence (IJCAI 2019 …, 2019
162019
Possible Winner Problems on Partial Tournaments: A Parameterized Study
Y Yang, J Guo
Journal of Combinatorial Optimization 33 (3), 882–896, 2017
162017
Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems
Y Yang, J Guo
Theoretical Computer Science 622, 79-89, 2016
162016
How Hard is Control in Multi-Peaked Elections: A Parameterized Study
Y Yang, J Guo
14th International Conference on Autonomous Agents and Multiagent Systems …, 2015
162015
Election Attacks with Few Candidates
Y Yang
21st European Conference on Artificial Intelligence (ECAI 2014), 1131 - 1132, 2014
162014
On the complexity of destructive bribery in approval-based multi-winner voting
Y Yang
arXiv preprint arXiv:2002.00836, 2020
152020
系统目前无法执行此操作,请稍后再试。
文章 1–20