Algorithms

Selecting Voting Locations for Fun and Profit IJCAI 2020 Select to Better Learn: Fast and Accurate Deep Learning Using Data Selection From Nonlinear Manifolds CVPR 2020 Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems IJCAI 2020 Simple and sharp analysis of k-means|| ICML 2020 Sliding Window Algorithms for k-Clustering Problems NeurIPS 2020 Smart Voting IJCAI 2020 Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions IJCAI 2020 Solving Set Cover and Dominating Set via Maximum Satisfiability AAAI 2020 Solving Sum-of-Costs Multi-Agent Pathfinding with Answer-Set Programming AAAI 2020 Span-based discontinuous constituency parsing: a family of exact chart-based algorithms with time complexities from O(nˆ6) down to O(nˆ3) EMNLP 2020 Speeding Up Incomplete GDL-based Algorithms for Multi-agent Optimization with Dense Local Utilities IJCAI 2020 Speeding up Very Fast Decision Tree with Low Computational Cost IJCAI 2020 Stochastically Robust Personalized Ranking for LSH Recommendation Retrieval AAAI 2020 Sub-linear Memory Sketches for Near Neighbor Search on Streaming Data ICML 2020 Taming Discrete Integration via the Boon of Dimensionality NeurIPS 2020 Task and Motion Planning Is PSPACE-Complete AAAI 2020 TellTail: Fast Scoring and Detection of Dense Subgraphs AAAI 2020 Testing Database Engines via Pivoted Query Synthesis OSDI 2020 The Complexity Landscape of Resource-Constrained Scheduling IJCAI 2020 The Computational Complexity of Angry Birds (Extended Abstract) IJCAI 2020 The Gradient Complexity of Linear Regression COLT 2020 The Impact of Selfishness in Hypergraph Hedonic Games AAAI 2020 Tight Approximation for Proportional Approval Voting IJCAI 2020 Tiramisu: Fast Multilayer Network Verification NSDI 2020 Two-goal Local Search and Inference Rules for Minimum Dominating Set IJCAI 2020