parameterized algorithm

Exact Algorithms for Distance to Unique Vertex Cover AAAI 2026 Finding Diverse Solutions Parameterized by Cliquewidth AAAI 2026 How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite? AAAI 2026 Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity AAAI 2026 Structural Approach to Guiding a Present-Biased Agent AAAI 2026 Efficient Algorithms for Electing Successive Committees IJCAI 2025 A Fast Algorithm for MaxSAT above Half Number of Clauses IJCAI 2024 Determining Winners in Elections with Absent Votes IJCAI 2024 Maximizing Nash Social Welfare under Two-Sided Preferences AAAI 2024 Multi-Winner Reconfiguration NeurIPS 2024 Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph AAAI 2024 Parameterized Analysis of Bribery in Challenge the Champ Tournaments IJCAI 2024 Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants AAAI 2024 A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap IJCAI 2023 Parameterized Algorithms for Colored Clustering AAAI 2023 Parameterized Local Search for Max c-Cut IJCAI 2023 Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT AAAI 2023 Faster Algorithms for Weak Backdoors AAAI 2022 Parameterized Algorithms for Kidney Exchange IJCAI 2022 Parameterized Approximation Algorithms for K-center Clustering and Variants AAAI 2022 Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets AAAI 2022 New Length Dependent Algorithm for Maximum Satisfiability Problem AAAI 2021 Parameterized Algorithms for MILPs with Small Treedepth AAAI 2021 The Smoothed Complexity of Computing Kemeny and Slater Rankings AAAI 2021 Adapting Stable Matchings to Evolving Preferences AAAI 2020