Algorithms

Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives AAAI 2020 Fair k-Centers via Maximum Matching ICML 2020 Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NeurIPS 2020 Fast and Accurate Non-Projective Dependency Tree Linearization ACL 2020 Fast and Efficient Boolean Matrix Factorization by Geometric Segmentation AAAI 2020 Fast Differentiable Sorting and Ranking ICML 2020 Fast MSER CVPR 2020 Fast semantic parsing with well-typedness guarantees EMNLP 2020 Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space AAAI 2020 Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining AAAI 2020 Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes AAAI 2020 Flow-Based Network Creation Games IJCAI 2020 FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints AAAI 2020 From tree matching to sparse graph alignment COLT 2020 gDLS*: Generalized Pose-and-Scale Estimation Given Scale and Gravity Priors CVPR 2020 Generating Interactive Worlds with Text AAAI 2020 Global Greedy Dependency Parsing AAAI 2020 Graph-based Nearest Neighbor Search: From Practice to Theory ICML 2020 G-TAD: Sub-Graph Localization for Temporal Action Detection CVPR 2020 Guiding CDCL SAT Search via Random Exploration amid Conflict Depression AAAI 2020 Hard Examples for Common Variable Decision Heuristics AAAI 2020 Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics NeurIPS 2020 Impossibility Results for Grammar-Compressed Linear Algebra NeurIPS 2020 Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD) AAAI 2020 Incremental Sampling Without Replacement for Sequence Models ICML 2020