Combinatorial Optimization

FACS: Fast Code-based Algorithm for Coalition Structure Generation (Student Abstract) AAAI 2021 Fair and Efficient Allocations under Lexicographic Preferences AAAI 2021 Fair and Efficient Allocations under Subadditive Valuations AAAI 2021 Fair and Efficient Resource Allocation with Partial Information IJCAI 2021 Fairness and Bias in Online Selection ICML 2021 Fairness in Influence Maximization through Randomization AAAI 2021 Fair Pairwise Exchange among Groups IJCAI 2021 Fair Scheduling for Time-dependent Resources NeurIPS 2021 Fair Stable Matchings Under Correlated Preferences (Student Abstract) AAAI 2021 Faster and Better Simple Temporal Problems AAAI 2021 Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions IJCAI 2021 Faster lifting for two-variable logic using cell graphs UAI 2021 Faster Matchings via Learned Duals NeurIPS 2021 Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints IJCAI 2021 Fast WordPiece Tokenization EMNLP 2021 Finding Bipartite Components in Hypergraphs NeurIPS 2021 Finding Diverse Trees, Paths, and More AAAI 2021 Fixed-Parameter and Approximation Algorithms for PCA with Outliers ICML 2021 Forming Better Stable Solutions in Group Formation Games Inspired by Internet Exchange Points (IXPs) AAAI 2021 Fractional Matchings under Preferences: Stability and Optimality IJCAI 2021 Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances AAAI 2021 Generalized parametric path problems UAI 2021 Generating An Optimal Interview Question Plan Using A Knowledge Graph And Integer Linear Programming NAACL 2021 GLSearch: Maximum Common Subgraph Detection via Learning to Search ICML 2021 Graph Cuts Always Find a Global Optimum for Potts Models (With a Catch) ICML 2021