fixed-parameter tractability

Algorithms for Structured Elections Under Thiele Voting Rules AAAI 2026 Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms AAAI 2026 Concept Sketching for Description Logics UAI 2026 Exact Algorithms for Distance to Unique Vertex Cover AAAI 2026 Fixed-Parameter Tractability of Private Synthetic Data Generation COLT 2026 Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity AAAI 2026 Adaptive Manipulation for Coalitions in Knockout Tournaments AAAI 2025 Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size AAAI 2025 Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants AAAI 2025 More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules IJCAI 2025 On Tractability of Learning Bayesian Networks with Ancestral Constraints AISTATS 2025 Optimal Decision Tree Pruning Revisited: Algorithms and Complexity ICML 2025 The Computational Complexity of Circuit Discovery for Inner Interpretability ICLR 2025 The Computational Complexity of Positive Non-Clashing Teaching in Graphs ICLR 2025 A General Theoretical Framework for Learning Smallest Interpretable Models AAAI 2024 Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology AAAI 2024 Learning Small Decision Trees for Data of Low Rank-Width AAAI 2024 Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants AAAI 2024 Preferred Reasoning in ABA by Cycle-Breaking IJCAI 2024 The Complexity of Fair Division of Indivisible Items with Externalities AAAI 2024 Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover AAAI 2024 Counting Background Knowledge Consistent Markov Equivalent Directed Acyclic Graphs UAI 2023 Fair Short Paths in Vertex-Colored Graphs AAAI 2023 Learning Small Decision Trees with Large Domain IJCAI 2023 Minimizing Reachability Times on Temporal Graphs via Shifting Labels IJCAI 2023