parameterized complexity

FPT Approximation Algorithms for TSP on Non-Metric Graphs AAAI 2026 Identifying Imperfect Clones in Elections AAAI 2026 Structure-Aware Encodings of Argumentation Properties for Clique-width AAAI 2026 When Can We Learn from Noisy Logical Data? Parameterized Complexity of Approximate Concept Fitting in Description Logics UAI 2026 A Structural Complexity Analysis of Hierarchical Task Network Planning IJCAI 2025 Balanced and Fair Partitioning of Friends AAAI 2025 Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures AAAI 2025 How to Resolve Envy by Adding Goods IJCAI 2025 More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules IJCAI 2025 Multi-Organizational Scheduling: Individual Rationality, Optimality, and Complexity IJCAI 2025 Parameterized Complexity of Caching in Networks AAAI 2025 Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs AAAI 2025 Solving Multiagent Path Finding on Highly Centralized Networks AAAI 2025 The Computational Complexity of Positive Non-Clashing Teaching in Graphs ICLR 2025 Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology AAAI 2024 How Hard Is It to Impact the Impact of Your Paper? IJCAI 2024 Learning Small Decision Trees with Few Outliers: A Parameterized Perspective AAAI 2024 On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? AAAI 2024 Parameterized Complexity of Kidney Exchange Revisited IJCAI 2024 The Complexity of Optimizing Atomic Congestion AAAI 2024 Algorithmics of Egalitarian versus Equitable Sequences of Committees IJCAI 2023 A Parameterized Theory of PAC Learning AAAI 2023 A Structural Complexity Analysis of Synchronous Dynamical Systems AAAI 2023 Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth? AAAI 2023 Fair Short Paths in Vertex-Colored Graphs AAAI 2023