Combinatorial Optimization

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges ICML 2025 EF1 and EFX Orientations IJCAI 2025 EF2X Exists for Four Agents AAAI 2025 Efficient Algorithms for Electing Successive Committees IJCAI 2025 Efficient and Robust Neural Combinatorial Optimization via Wasserstein-Based Coresets ICLR 2025 Efficient Graph Bandit Learning with Side-Observations and Switching Constraints AAAI 2025 Efficient Sparse PCA via Block-Diagonalization ICLR 2025 EFX Feasible Scheduling for Time-dependent Resources IJCAI 2025 Eliminating Majority Illusion Is Easy AAAI 2025 Enumerating Optimal Cost-Constrained Adjustment Sets UAI 2025 Evolutionary Classifier Chain for Multi-Dimensional Classification AAAI 2025 Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size AAAI 2025 Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem IJCAI 2025 Exact discovery is polynomial for certain sparse causal Bayesian networks CLeaR 2025 Expanding Connected Components from Alternative Terminals: Global Optimization for Freshwater Fishes Under the UN's 30x30 Conservation Goal IJCAI 2025 Exploiting Symmetries in MUS Computation AAAI 2025 Facility Location Games with Optional Preferences: A Revisit AAAI 2025 Fair and Efficient Completion of Indivisible Goods AAAI 2025 Fair Submodular Maximization over a Knapsack Constraint IJCAI 2025 Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity ICML 2025 Federated Assemblies AAAI 2025 FIND: A Framework for Discovering Formulas in Data AAAI 2025 From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms (Journal Track) AAAI 2025 Fully-Scalable Massively Parallel Algorithm for k-center with Outliers AAAI 2025 Generalizing Constraint Models in Constraint Acquisition AAAI 2025