Yongjie Yang

Frontiers Comput. Sci., June, 2024

On the Complexity of Minimizing Energy Consumption of Partitioning DAG Tasks.

[BibT_eX]

[DOI]

Wei Liu

Jian-Jia Chen

CoRR, 2024

An FPT Algorithm for Directed Co-Graph Edge Deletion.

[BibT_eX]

[DOI]

Algorithms, 2024

How Hard Is It to Impact the Impact of Your Paper?

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

On the Complexity of Candidates-Embedded Multiwinner Voting under the Hausdorff Function.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability.

[BibT_eX]

[DOI]

Jian-xin Wang

Auton. Agents Multi Agent Syst., October, 2023

On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs.

[BibT_eX]

[DOI]

Frontiers Comput. Sci., August, 2023

Group control for consent rules with consecutive qualifications.

[BibT_eX]

[DOI]

Math. Soc. Sci., January, 2023

On the Parameterized Complexity of Controlling Approval-Based Multiwinner Voting: Destructive Model & Sequential Rules.

[BibT_eX]

[DOI]

CoRR, 2023

A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs.

[BibT_eX]

[DOI]

Guozhen Rong

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Mask R-CNN assisted diagnosis of spinal tuberculosis.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Systems and Informatics, 2023

On the Complexity of the Two-Stage Majority Rule.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations.

[BibT_eX]

[DOI]

Huan Peng

Theor. Comput. Sci., 2022

An improved branching algorithm for the proper interval edge deletion problem.

[BibT_eX]

[DOI]

Xiaojing Tang

Frontiers Comput. Sci., 2022

Erratum to: Incremental algorithms for the maximum internal spanning tree problem.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2022

A Refined Branching Algorithm for the Maximum Satisfiability Problem.

[BibT_eX]

[DOI]

Algorithmica, 2022

On the Complexity of Calculating Approval-Based Winners in Candidates-Embedded Metrics.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

On the Complexity of Controlling Amendment and Successive Winners.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Reconstruction and verification of chordal graphs with a distance oracle.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

A (2 + ϵ)k-vertex kernel for the dual coloring problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Cycle Extendability of Hamiltonian Strongly Chordal Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Incremental algorithms for the maximum internal spanning tree problem.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2021

Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2021

The Nonmanipulative Vote-Deficits of Voting Rules.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

A Model of Winners Allocation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Complexity and Algorithms for Superposed Data Uploading Problem in Networks With Smart Devices.

[BibT_eX]

[DOI]

IEEE Internet Things J., 2020

Parameterized algorithms of fundamental NP-hard problems: a survey.

[BibT_eX]

[DOI]

Hum. centric Comput. Inf. Sci., 2020

A Refined Study of the Complexity of Binary Networked Public Goods Games.

[BibT_eX]

[DOI]

CoRR, 2020

The complexity of bribery and control in group identification.

[BibT_eX]

[DOI]

Christian Reger

Auton. Agents Multi Agent Syst., 2020

On the Complexity of Constructive Control Under Nearly Single-Peaked Preferences.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Microbribery in Group Identification.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

On the complexity of bribery with distance restrictions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

An improved linear kernel for complementary maximal strip recovery: Simpler and smaller.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications.

[BibT_eX]

[DOI]

Wenkai Dai

J. Comb. Optim., 2019

Fairness in Algorithmic Decision-Making: Applications in Multi-Winner Voting, Machine Learning, and Recommender Systems.

[BibT_eX]

[DOI]

Algorithms, 2019

On the Tree Representations of Dichotomous Preferences.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Resolution and Domination: An Improved Exact MaxSAT Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes.

[BibT_eX]

[DOI]

Aizhong Zhou

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Complexity of Additive Committee Selection with Outliers.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Towards Completing the Puzzle: Solving Open Problems for Control in Elections.

[BibT_eX]

[DOI]

Christian Reger

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

On the kernelization of split graph problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Parameterized Complexity of Voter Control in Multi-Peaked Elections.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Gender consistent resolving rules in marriage problems.

[BibT_eX]

[DOI]

Laura Kasper

Discret. Appl. Math., 2018

How hard is it to control a group?

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2018

Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Complexity of Controlling Nearly Single-Peaked Elections Revisited.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

The control complexity of r-Approval: From the single-peaked case to the general case.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Possible winner problems on partial tournaments: a parameterized study.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Recognizing Linked Domain in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2017

Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations.

[BibT_eX]

[DOI]

CoRR, 2017

A 42k Kernel for the Complementary Maximal Strip Recovery Problem.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

Anyone But Them: The Complexity Challenge for A Resolute Election Controller.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Approval Voting with Intransitive Preferences.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

On the Complexity of Borda Control in Single-Peaked Elections.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

The Complexity of Control and Bribery in Majority Judgment.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Complexity of Group Identification with Partial Information.

[BibT_eX]

[DOI]

Christian Reger

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016

Exact algorithms for weighted and unweighted Borda manipulation problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

The Complexity of Shelflisting.

[BibT_eX]

[DOI]

CoRR, 2016

A Further Step Towards an Understanding of the Tournament Equilibrium Set.

[BibT_eX]

[DOI]

CoRR, 2016

Kernelization of Two Path Searching Problems on Split Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

How Hard Is Bribery with Distance Restrictions?

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

A deep exploration of the complexity border of strategic voting problems.

[BibT_eX]

[DOI]

PhD thesis, 2015

When Does Schwartz Conjecture Hold?

[BibT_eX]

[DOI]

Matthias Mnich

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

How Hard is Bribery in Party Based Elections?

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

How Hard is Control in Multi-Peaked Elections: A Parameterized Study.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Manipulation with Bounded Single-Peaked Width: A Parameterized Study.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

How Credible is the Prediction of a Party-Based Election?

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Towards optimal kernel for edge-disjoint triangle packing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Election Attacks with Few Candidates.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Controlling elections with bounded single-peaked width.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Planar graph vertex partition for linear problem kernels.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Complexity of Sincere-Strategy Preference-Based Approval Control in k-Peaked Elections

[BibT_eX]

[DOI]