fixed-parameter tractability

Participatory Budgeting with Multiple Degrees of Projects and Ranged Approval Votes IJCAI 2023 Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems NeurIPS 2023 Ties in Multiwinner Approval Voting IJCAI 2023 Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT AAAI 2023 Training Neural Networks is NP-Hard in Fixed Dimension NeurIPS 2023 Disentangling the Computational Complexity of Network Untangling IJCAI 2022 Tractable Abstract Argumentation via Backdoor-Treewidth AAAI 2022 Backdoor DNFs IJCAI 2021 Disjunctive Temporal Problems under Structural Restrictions AAAI 2021 Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules IJCAI 2021 Finding Diverse Trees, Paths, and More AAAI 2021 Multi-Party Campaigning AAAI 2021 Adapting Stable Matchings to Evolving Preferences AAAI 2020 Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory IJCAI 2020 Parameterized Algorithms for Finding a Collective Set of Items AAAI 2020 Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems IJCAI 2020 Threshold Treewidth and Hypertree Width IJCAI 2020 Complexity of Abstract Argumentation under a Claim-Centric View AAAI 2019 Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm AAAI 2019 The Parameterized Complexity of Cascading Portfolio Scheduling NeurIPS 2019 Found Graph Data and Planted Vertex Covers NeurIPS 2018 Parameterized Algorithms for the Matrix Completion Problem ICML 2018 Reasoning about NP-complete Constraints IJCAI 2018 The Parameterized Complexity of Approximate Inference in Bayesian Networks PGM 2016