default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYongjie Yang 0001
Person information
- affiliation: Central South University, School of Information Science and Engineering, Changsha, China
- affiliation: Saarland University, Chair of Economic Theory, Saarbrücken, Germany
Other persons with the same name
- Yongjie Yang 0002
![[0000-0001-5604-5505]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-5604-5505")
— Nantong University, Nantong, China - Yongjie Yang 0003 — Jiangsu University, School of Automotive and Traffic Engineering, Zhenjiang, China
- Yongjie Yang 0004 — Guangxi University, China (and 1 more)
- Yongjie Yang 0005 — China National Rice Research Institute, Hangzhou, China
- Yongjie Yang 0006 — Beijing Jiaotong University, Beijing, China
- Yongjie Yang 0007 — Beijing University of Technology, Faculty of Information Technology, China
- Yongjie Yang 0008 — University of Pittsburgh, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j32]Wenjun Li, Xueying Yang, Chao Xu, Yongjie Yang:
An FPT Algorithm for Directed Co-Graph Edge Deletion. Algorithms 17(2): 69 (2024)- [j31]Yongjie Yang, Dinko Dimitrov:
Group control for procedural rules: parameterized complexity and consecutive domains. Frontiers Comput. Sci. 18(3): 183402 (2024) - [c43]Yongjie Yang:
On the Complexity of Candidates-Embedded Multiwinner Voting under the Hausdorff Function. AAMAS 2024: 2567-2569 - [c42]Yongjie Yang:
How Hard Is It to Impact the Impact of Your Paper? IJCAI 2024: 3023-3031 - [i21]Wei Liu, Jian-Jia Chen, Yongjie Yang:
On the Complexity of Minimizing Energy Consumption of Partitioning DAG Tasks. CoRR abs/2404.01022 (2024) - 2023
- [j30]Yongjie Yang, Jian-xin Wang:
Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability. Auton. Agents Multi Agent Syst. 37(2): 28 (2023) - [j29]Jia Li, Wenjun Li, Yongjie Yang, Xueying Yang:
On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs. Frontiers Comput. Sci. 17(4): 174405 (2023) - [j28]Yongjie Yang, Dinko Dimitrov:
Group control for consent rules with consecutive qualifications. Math. Soc. Sci. 121: 1-7 (2023) - [c41]Yongjie Yang:
On the Complexity of the Two-Stage Majority Rule. AAMAS 2023: 2022-2030 - [c40]Wenjun Li, Yanfan Li, Huan Peng, Yongjie Yang, Weijun Liang:
Mask R-CNN assisted diagnosis of spinal tuberculosis. ICSAI 2023: 1-6 - [c39]Guozhen Rong, Yongjie Yang, Wenjun Li:
A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs. MFCS 2023: 77:1-77:15 - [i20]Yongjie Yang:
On the Complexity of the Two-Stage Majority Rule. CoRR abs/2301.04009 (2023) - [i19]Yongjie Yang:
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting. CoRR abs/2302.11291 (2023) - [i18]Yongjie Yang:
On the Parameterized Complexity of Controlling Approval-Based Multiwinner Voting: Destructive Model & Sequential Rules. CoRR abs/2304.11927 (2023) - 2022
- [j27]Wenjun Li, Chao Xu, Yongjie Yang, Jianer Chen, Jianxin Wang:
A Refined Branching Algorithm for the Maximum Satisfiability Problem. Algorithmica 84(4): 982-1006 (2022) - [j26]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) - [j25]Wenjun Li, Xiaojing Tang, Yongjie Yang:
An improved branching algorithm for the proper interval edge deletion problem. Frontiers Comput. Sci. 16(2): 162401 (2022) - [j24]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: 83-93 (2022) - [j23]Guozhen Rong, Yongjie Yang, Wenjun Li, Jianxin Wang:
A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries. Theor. Comput. Sci. 917: 1-11 (2022) - [c38]Yongjie Yang:
On the Complexity of Controlling Amendment and Successive Winners. AAMAS 2022: 1768-1770 - [c37]Yongjie Yang:
On the Complexity of Calculating Approval-Based Winners in Candidates-Embedded Metrics. IJCAI 2022: 585-591 - [i17]Yongjie Yang, Dinko Dimitrov:
Group Control for Procedural Rules: Parameterized Complexity and Consecutive Domains. CoRR abs/2203.16872 (2022) - [i16]Guozhen Rong, Yongjie Yang, Wenjun Li:
A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs. CoRR abs/2212.04880 (2022) - 2021
- [j22]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): 41 (2021) - [j21]Xianbin Zhu, Wenjun Li, Yongjie Yang, Jianxin Wang:
Incremental algorithms for the maximum internal spanning tree problem. Sci. China Inf. Sci. 64(5) (2021) - [j20]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): 524-542 (2021) - [j19]Guozhen Rong, Wenjun Li, Jianxin Wang, Yongjie Yang:
Cycle Extendability of Hamiltonian Strongly Chordal Graphs. SIAM J. Discret. Math. 35(3): 2115-2128 (2021) - [j18]Guozhen Rong, Wenjun Li, Yongjie Yang, Jianxin Wang:
Reconstruction and verification of chordal graphs with a distance oracle. Theor. Comput. Sci. 859: 48-56 (2021) - [j17]Wenjun Li, Yang Ding, Yongjie Yang, Guozhen Rong:
A (2 + ϵ)k-vertex kernel for the dual coloring problem. Theor. Comput. Sci. 868: 6-11 (2021) - [c36]Yongjie Yang:
A Model of Winners Allocation. AAAI 2021: 5760-5767 - [c35]Yongjie Yang:
The Nonmanipulative Vote-Deficits of Voting Rules. ADT 2021: 224-240 - [i15]Yongjie Yang, Jianxin Wang:
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability. CoRR abs/2107.04685 (2021) - 2020
- [j16]Gábor Erdélyi, Christian Reger, Yongjie Yang:
The complexity of bribery and control in group identification. Auton. Agents Multi Agent Syst. 34(1): 8 (2020) - [j15]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: 29 (2020) - [j14]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): 5882-5891 (2020) - [c34]Yongjie Yang:
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting. AAMAS 2020: 1584-1592 - [c33]Gábor Erdélyi, Yongjie Yang:
Microbribery in Group Identification. AAMAS 2020: 1840-1842 - [c32]Yongjie Yang:
On the Complexity of Constructive Control Under Nearly Single-Peaked Preferences. ECAI 2020: 243-250 - [i14]Yongjie Yang:
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting. CoRR abs/2002.00836 (2020) - [i13]Yongjie Yang:
On the Complexity of Constructive Control under Nearly Single-Peaked Preferences. CoRR abs/2002.03539 (2020) - [i12]Guozhen Rong, Wenjun Li, Jianxin Wang, Yongjie Yang:
Cycle Extendability of Hamiltonian Strongly Chordal Graphs. CoRR abs/2007.04698 (2020) - [i11]Yongjie Yang, Jianxin Wang:
A Refined Study of the Complexity of Binary Networked Public Goods Games. CoRR abs/2012.02916 (2020)
2010 – 2019
- 2019
- [j13]Yash Raj Shrestha, Yongjie Yang:
Fairness in Algorithmic Decision-Making: Applications in Multi-Winner Voting, Machine Learning, and Recommender Systems. Algorithms 12(9): 199 (2019) - [j12]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): 601-619 (2019) - [j11]Yongjie Yang, Yash Raj Shrestha, Jiong Guo:
On the complexity of bribery with distance restrictions. Theor. Comput. Sci. 760: 55-71 (2019) - [j10]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: 55-66 (2019) - [c31]Aizhong Zhou, Yongjie Yang, Jiong Guo:
Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes. AAMAS 2019: 503-510 - [c30]Gábor Erdélyi, Christian Reger, Yongjie Yang:
Towards Completing the Puzzle: Solving Open Problems for Control in Elections. AAMAS 2019: 846-854 - [c29]Yongjie Yang, Dinko Dimitrov:
How Hard Is It to Control a Group? AAMAS 2019: 1440-1442 - [c28]Yongjie Yang, Jianxin Wang:
Complexity of Additive Committee Selection with Outliers. AAMAS 2019: 2291-2293 - [c27]Yongjie Yang:
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting. IJCAI 2019: 637-643 - [c26]Yongjie Yang:
On the Tree Representations of Dichotomous Preferences. IJCAI 2019: 644-650 - [c25]Chao Xu, Wenjun Li, Yongjie Yang, Jianer Chen, Jianxin Wang:
Resolution and Domination: An Improved Exact MaxSAT Algorithm. IJCAI 2019: 1191-1197 - 2018
- [j9]Yongjie Yang, Dinko Dimitrov:
How hard is it to control a group? Auton. Agents Multi Agent Syst. 32(5): 672-692 (2018) - [j8]Dinko Dimitrov, Laura Kasper, Yongjie Yang:
Gender consistent resolving rules in marriage problems. Discret. Appl. Math. 247: 147-151 (2018) - [j7]Yongjie Yang, Jiong Guo:
Parameterized Complexity of Voter Control in Multi-Peaked Elections. Theory Comput. Syst. 62(8): 1798-1825 (2018) - [j6]Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo:
On the kernelization of split graph problems. Theor. Comput. Sci. 734: 72-82 (2018) - [c24]Yongjie Yang:
Complexity of Controlling Nearly Single-Peaked Elections Revisited. AAMAS 2018: 2139-2141 - [c23]Yongjie Yang, Jianxin Wang:
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability. AAMAS 2018: 2142-2144 - [c22]Yongjie Yang, Jianxin Wang:
Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness. IJCAI 2018: 576-582 - 2017
- [j5]Yongjie Yang, Jiong Guo:
Possible winner problems on partial tournaments: a parameterized study. J. Comb. Optim. 33(3): 882-896 (2017) - [j4]Yongjie Yang, Jiong Guo:
The control complexity of r-Approval: From the single-peaked case to the general case. J. Comput. Syst. Sci. 89: 432-449 (2017) - [c21]Gábor Erdélyi, Christian Reger, Yongjie Yang:
Complexity of Group Identification with Partial Information. ADT 2017: 182-196 - [c20]Yongjie Yang, Jianxin Wang:
Anyone But Them: The Complexity Challenge for A Resolute Election Controller. AAMAS 2017: 1133-1141 - [c19]Gábor Erdélyi, Christian Reger, Yongjie Yang:
The Complexity of Bribery and Control in Group Identification. AAMAS 2017: 1142-1150 - [c18]Yongjie Yang:
The Complexity of Control and Bribery in Majority Judgment. AAMAS 2017: 1169-1177 - [c17]Yongjie Yang:
On the Complexity of Borda Control in Single-Peaked Elections. AAMAS 2017: 1178-1186 - [c16]Yongjie Yang:
Approval Voting with Intransitive Preferences. AAMAS 2017: 1769-1771 - [c15]Wenjun Li, Chao Xu, Jianxin Wang, Yongjie Yang:
An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations. COCOA (2) 2017: 94-108 - [c14]Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang, Yongjie Yang:
A 42k Kernel for the Complementary Maximal Strip Recovery Problem. FAW 2017: 175-186 - [i10]Yongjie Yang:
Approval Voting with Intransitive Preferences. CoRR abs/1702.07902 (2017) - [i9]Wenjun Li, Jianxin Wang, Yongjie Yang:
Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations. CoRR abs/1707.06779 (2017) - [i8]Yongjie Yang:
Recognizing Linked Domain in Polynomial Time. CoRR abs/1712.04918 (2017) - 2016
- [j3]Yongjie Yang, Jiong Guo:
Exact algorithms for weighted and unweighted Borda manipulation problems. Theor. Comput. Sci. 622: 79-89 (2016) - [c13]Yongjie Yang, Yash Raj Shrestha, Jiong Guo:
How Hard Is Bribery with Distance Restrictions? ECAI 2016: 363-371 - [c12]Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo:
Kernelization of Two Path Searching Problems on Split Graphs. FAW 2016: 238-249 - [i7]Yongjie Yang, Dinko Dimitrov:
How Hard Is It to Control A Group? CoRR abs/1606.03366 (2016) - [i6]Yongjie Yang:
A Further Step Towards an Understanding of the Tournament Equilibrium Set. CoRR abs/1611.03991 (2016) - [i5]Yongjie Yang, Dinko Dimitrov:
The Complexity of Shelflisting. CoRR abs/1611.03995 (2016) - 2015
- [b1]Yongjie Yang:
A deep exploration of the complexity border of strategic voting problems. Saarland University, 2015 - [c11]Yongjie Yang:
Manipulation with Bounded Single-Peaked Width: A Parameterized Study. AAMAS 2015: 77-85 - [c10]Jiong Guo, Yash Raj Shrestha, Yongjie Yang:
How Credible is the Prediction of a Party-Based Election? AAMAS 2015: 1431-1439 - [c9]Yongjie Yang, Yash Raj Shrestha, Jiong Guo:
How Hard is Bribery in Party Based Elections? AAMAS 2015: 1725-1726 - [c8]Yongjie Yang, Jiong Guo:
How Hard is Control in Multi-Peaked Elections: A Parameterized Study. AAMAS 2015: 1729-1730 - [c7]Matthias Mnich, Yash Raj Shrestha, Yongjie Yang:
When Does Schwartz Conjecture Hold? IJCAI 2015: 603-609 - 2014
- [j2]Yongjie Yang:
Towards optimal kernel for edge-disjoint triangle packing. Inf. Process. Lett. 114(7): 344-348 (2014) - [c6]Yongjie Yang, Jiong Guo:
The control complexity of r-approval: from the single-peaked case to the general case. AAMAS 2014: 621-628 - [c5]Yongjie Yang, Jiong Guo:
Controlling elections with bounded single-peaked width. AAMAS 2014: 629-636 - [c4]Yongjie Yang:
Election Attacks with Few Candidates. ECAI 2014: 1131-1132 - [i4]Jiong Guo, Yash Raj Shrestha, Yongjie Yang:
How Credible is the Prediction of a Party-Based Election? CoRR abs/1404.2464 (2014) - [i3]Yongjie Yang:
Election Attacks with Few Candidates. CoRR abs/1405.6562 (2014) - 2013
- [j1]Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen:
Planar graph vertex partition for linear problem kernels. J. Comput. Syst. Sci. 79(5): 609-621 (2013) - [c3]Yongjie Yang, Jiong Guo:
Possible Winner Problems on Partial Tournaments: A Parameterized Study. ADT 2013: 425-439 - [c2]Yongjie Yang, Jiong Guo:
Exact algorithms for weighted and unweighted borda manipulation problems. AAMAS 2013: 1327-1328 - [i2]Yongjie Yang, Jiong Guo:
Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems. CoRR abs/1304.3145 (2013) - [i1]Yongjie Yang, Jiong Guo:
Complexity of Sincere-Strategy Preference-Based Approval Control in k-Peaked Elections. CoRR abs/1304.4471 (2013) - 2011
- [c1]Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen:
Linear Problem Kernels for Planar Graph Problems with Small Distance Property. MFCS 2011: 592-603
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
