Discrete Optimization

Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover AAAI 2024 Two-Sided Facility Location Games IJCAI 2024 UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems NeurIPS 2024 Using Clustering to Strengthen Decision Diagram Bounds for Discrete Optimization AAAI 2024 Warm-starting Push-Relabel NeurIPS 2024 Weighted Envy-Freeness for Submodular Valuations AAAI 2024 Analyzing and Improving the Use of the FastMap Embedding in Pathfinding Tasks AAAI 2023 Approximately Optimal Core Shapes for Tensor Decompositions ICML 2023 Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Bandits ICML 2023 Block Subsampled Randomized Hadamard Transform for Nyström Approximation on Distributed Architectures ICML 2023 Boosting Learning for LDPC Codes to Improve the Error-Floor Performance NeurIPS 2023 Circuit Minimization with QBF-Based Exact Synthesis AAAI 2023 Conjugate Product Graphs for Globally Optimal 2D-3D Shape Matching CVPR 2023 Counting Knot Mosaics with ALLSAT (Student Abstract) AAAI 2023 D-CIPHER: Discovery of Closed-form Partial Differential Equations NeurIPS 2023 Decentralized Riemannian Algorithm for Nonconvex Minimax Problems AAAI 2023 Efficient Map Sparsification Based on 2D and 3D Discretized Grids CVPR 2023 Exact Optimality of Communication-Privacy-Utility Tradeoffs in Distributed Mean Estimation NeurIPS 2023 Fair Short Paths in Vertex-Colored Graphs AAAI 2023 Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers AAAI 2023 Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization ICML 2023 Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case NeurIPS 2023 Fast Fluid Simulation via Dynamic Multi-Scale Gridding AAAI 2023 Formally Verified SAT-Based AI Planning AAAI 2023 Fully Computer-Assisted Proofs in Extremal Combinatorics AAAI 2023