Combinatorial Optimization

Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits NeurIPS 2021 Regularized Submodular Maximization at Scale ICML 2021 Representative Proxy Voting AAAI 2021 Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information AAAI 2021 Robust Allocations with Diversity Constraints NeurIPS 2021 Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond NeurIPS 2021 Searching for More Efficient Dynamic Programs EMNLP 2021 Simple induction of (deterministic) probabilistic finite-state automata for phonotactics by stochastic gradient descent ACL 2021 Solving Graph-based Public Goods Games with Tree Search and Imitation Learning NeurIPS 2021 Solving Infinite-Domain CSPs Using the Patchwork Property AAAI 2021 Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs COLT 2021 Spectral vertex sparsifiers and pair-wise spanners over distributed graphs ICML 2021 Streaming and Distributed Algorithms for Robust Column Subset Selection ICML 2021 Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity ICML 2021 Submodular Span, with Applications to Conditional Data Summarization AAAI 2021 Surprisingly Popular Voting Recovers Rankings, Surprisingly! IJCAI 2021 Symmetric Component Caching for Model Counting on Combinatorial Instances AAAI 2021 Synthetic Design: An Optimization Approach to Experimental Design with Synthetic Controls NeurIPS 2021 The Maximin Support Method: An Extension of the D’Hondt Method to Approval-Based Multiwinner Elections AAAI 2021 The Parameterized Complexity of Connected Fair Division IJCAI 2021 The Power of Adaptivity for Stochastic Submodular Cover ICML 2021 The Price of Connectivity in Fair Division AAAI 2021 The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound IJCAI 2021 Toward Determining NFA Equivalence via QBFs (Student Abstract) AAAI 2021 Tracking Regret Bounds for Online Submodular Optimization AISTATS 2021