Seguir
Yongjie Yang
Título
Citado por
Citado por
Año
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
552020
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
312019
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
302017
Fairness in algorithmic decision-making: Applications in multi-winner voting, machine learning, and recommender systems
YR Shrestha, Y Yang
Algorithms 12 (9), 199, 2019
282019
Controlling Elections with Bounded Single-Peaked Width
Y Yang, J Guo
AAMAS 2014, 629-636, 2014
28*2014
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
27*2013
Manipulation with Bounded Single-Peaked Width: A Parameterized Study
Y Yang
AAMAS 2015, 77-85, 2015
262015
The Complexity of Bribery and Control in Group Identification
G Erdelyi, C Reger, Y Yang
AAMAS 2017, 1142-1150, 2017
222017
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), 1-24, 2020
212020
Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness.
Y Yang, J Wang
IJCAI 2018, 576-582, 2018
172018
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
142016
How Hard is Control in Multi-Peaked Elections: A Parameterized Study
Y Yang, J Guo
AAMAS 2015, 1729-1730, 2015
142015
Election Attacks with Few Candidates
Y Yang
ECAI 2014, 1131 - 1132, 2014
142014
How Hard Is It to Control A Group?
Y Yang, D Dimitrov
Autonomous Agents and Multi-Agent Systems 32 (5), 672--692, 2018
132018
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting
Y Yang
28th International Joint Conference on Artificial Intelligence (IJCAI 2019 …, 2019
122019
On the Complexity of Borda Control in Single-Peaked Elections
Y Yang
AAMAS 2017, 1178-1186, 2017
122017
On the Tree Representations of Dichotomous Preferences
Y Yang
28th International Joint Conference on Artificial Intelligence (IJCAI 2019 …, 2019
112019
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability
Y Yang, J Wang
AAMAS 2018, 2142-2144, 2018
112018
How Hard Is Bribery with Distance Restrictions?
Y Yang, YR Shrestha, J Guo
ECAI 2016 285, 363-371, 2016
112016
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20