Skip to content
conftrace_

parameterized complexity

88 papers

Papers

Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules IJCAI 2021 Fixed-Parameter and Approximation Algorithms for PCA with Outliers ICML 2021 On the Parameterized Complexity of Polytree Learning IJCAI 2021 Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework AAAI 2021 Parameterized Complexity of Small Decision Tree Learning AAAI 2021 The Complexity of Bayesian Network Learning: Revisiting the Superstructure NeurIPS 2021 The Parameterized Complexity of Clustering Incomplete Data AAAI 2021 The Parameterized Complexity of Connected Fair Division IJCAI 2021 Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments IJCAI 2021 Adapting Stable Matchings to Evolving Preferences AAAI 2020 Fine-Grained View on Bribery for Group Identification IJCAI 2020 Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis IJCAI 2020 Manipulating Districts to Win Elections: Fine-Grained Complexity AAAI 2020 Model Interpretability through the lens of Computational Complexity NeurIPS 2020 On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank AAAI 2020 Parameterized Algorithms for Finding a Collective Set of Items AAAI 2020 Parameterized Complexity of Envy-Free Resource Allocation in Social Networks AAAI 2020 Well-Structured Committees IJCAI 2020 A Parameterized Perspective on Protecting Elections IJCAI 2019 Counting Complexity for Reasoning in Abstract Argumentation AAAI 2019 Fair Knapsack AAAI 2019 Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length AAAI 2019 Regularized Weighted Low Rank Approximation NeurIPS 2019 Solving Integer Quadratic Programming via Explicit and Structural Restrictions AAAI 2019 The Parameterized Complexity of Cascading Portfolio Scheduling NeurIPS 2019