← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Individual-Based Stability in Hedonic Diversity Games AAAI 2020
Electing Successive Committees: Complexity and Algorithms AAAI 2020
Refining Tournament Solutions via Margin of Victory AAAI 2020
Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space AAAI 2020
Manipulating Districts to Win Elections: Fine-Grained Complexity AAAI 2020
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms AAAI 2020
A Simple and Efficient Tensor Calculus AAAI 2020
A MaxSAT-Based Framework for Group Testing AAAI 2020
On the Problem of Covering a 3-D Terrain AAAI 2020
MAGSAC++, a Fast, Reliable and Accurate Robust Estimator CVPR 2020
Warping Residual Based Image Stitching for Large Parallax CVPR 2020
Can Facial Pose and Expression Be Separated With Weak Perspective Camera? CVPR 2020
Guiding CDCL SAT Search via Random Exploration amid Conflict Depression AAAI 2020
End-to-End Learning and Intervention in Games NIPS 2020
Fast and Accurate Non-Projective Dependency Tree Linearization ACL 2020
An Algorithm for Multi-Attribute Diverse Matching IJCAI 2020
Impossibility Results for Grammar-Compressed Linear Algebra NIPS 2020
Speeding Up Incomplete GDL-based Algorithms for Multi-agent Optimization with Dense Local Utilities IJCAI 2020
On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules IJCAI 2020
Tight Approximation for Proportional Approval Voting IJCAI 2020
Smart Voting IJCAI 2020
Variable Elimination in Binary CSPs (Extended Abstract) IJCAI 2020
The Computational Complexity of Angry Birds (Extended Abstract) IJCAI 2020
Learning Context-free Languages with Nondeterministic Stack RNNs CONLL 2020
Almost No News on the Complexity of MAP in Bayesian Networks PGM 2020