np-hard problem

Ordered Objectives in Maximum Satisfiability AAAI 2026 A Knapsack by Any Other Name: Presentation impacts LLM performance on NP-hard problems EMNLP 2025 Witty: An Efficient Solver for Computing Minimum-Size Decision Trees AAAI 2025 A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem AAAI 2024 An Exercise in Tournament Design: When Some Matches Must Be Scheduled AAAI 2024 Anytime-Constrained Reinforcement Learning AISTATS 2024 Delegation-Relegation for Boolean Matrix Factorization AAAI 2024 Equivariant Deep Weight Space Alignment ICML 2024 KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem AAAI 2024 Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems NeurIPS 2024 Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem AAAI 2024 Towards Fairness in Online Service with K Servers and Its Application on Fair Food Delivery AAAI 2024 An Exact Algorithm for the Minimum Dominating Set Problem IJCAI 2023 Learning Small Decision Trees with Large Domain IJCAI 2023 New Bounds and Constraint Programming Models for the Weighted Vertex Coloring Problem IJCAI 2023 Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem? NeurIPS 2022 Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract) AAAI 2022 Modification-Fair Cluster Editing AAAI 2022 Recursive autonomy identification-based learning of augmented naive Bayes classifiers PGM 2022 Refined Lower Bounds for Nearest Neighbor Condensation ALT 2022 Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach AAAI 2022 What’s Wrong with Deep Learning in Tree Search for Combinatorial Optimization ICLR 2022 A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem AAAI 2021 Computing Quantal Stackelberg Equilibrium in Extensive-Form Games AAAI 2021 Ensembling Graph Predictions for AMR Parsing NeurIPS 2021