parameterized complexity

From Width-Based Model Checking to Width-Based Automated Theorem Proving AAAI 2023 In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI 2023 Learning Small Decision Trees with Large Domain IJCAI 2023 Minimizing Reachability Times on Temporal Graphs via Shifting Labels IJCAI 2023 The Computational Complexity of Concise Hypersphere Classification ICML 2023 The Parameterized Complexity of Finding Concise Local Explanations IJCAI 2023 The Parameterized Complexity of Network Microaggregation AAAI 2023 Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT AAAI 2023 Training Neural Networks is NP-Hard in Fixed Dimension NeurIPS 2023 Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract) AAAI 2022 Disentangling the Computational Complexity of Network Untangling IJCAI 2022 Faster Algorithms for Weak Backdoors AAAI 2022 Fine-grained Complexity of Partial Minimum Satisfiability IJCAI 2022 Hedonic Diversity Games: A Complexity Picture with More than Two Colors AAAI 2022 Insight into Voting Problem Complexity Using Randomized Classes IJCAI 2022 On the Complexity of Calculating Approval-Based Winners in Candidates-Embedded Metrics IJCAI 2022 Parameterized Completeness Results for Bayesian Inference PGM 2022 Parameterized Complexity of Hotelling-Downs with Party Nominees IJCAI 2022 Refined Lower Bounds for Nearest Neighbor Condensation ALT 2022 Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach AAAI 2022 The Complexity of k-Means Clustering when Little is Known ICML 2022 When Votes Change and Committees Should (Not) IJCAI 2022 A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem AAAI 2021 Diversity in Kemeny Rank Aggregation: A Parameterized Approach IJCAI 2021 Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings AAAI 2021