← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Flow-Based Network Creation Games IJCAI 2020
Selecting Voting Locations for Fun and Profit IJCAI 2020
Bipartite Encoding: A New Binary Encoding for Solving Non-Binary CSPs IJCAI 2020
Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD) AAAI 2020
Justifying All Differences Using Pseudo-Boolean Reasoning AAAI 2020
Solving Set Cover and Dominating Set via Maximum Satisfiability AAAI 2020
Hard Examples for Common Variable Decision Heuristics AAAI 2020
Adapting Stable Matchings to Evolving Preferences AAAI 2020
Defending with Shared Resources on a Network AAAI 2020
Lifting Preferences over Alternatives to Preferences over Sets of Alternatives: The Complexity of Recognizing Desirable Families of Sets AAAI 2020
A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search AAAI 2020
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems AAAI 2020
TellTail: Fast Scoring and Detection of Dense Subgraphs AAAI 2020
Robust Tensor Decomposition via Orientation Invariant Tubal Nuclear Norms AAAI 2020
Global Greedy Dependency Parsing AAAI 2020
Speeding up Very Fast Decision Tree with Low Computational Cost IJCAI 2020
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems IJCAI 2020
A Randomized Algorithm to Reduce the Support of Discrete Measures NIPS 2020
Sliding Window Algorithms for k-Clustering Problems NIPS 2020
Fair k-Centers via Maximum Matching ICML 2020
Lower Bounds and Faster Algorithms for Equality Constraints IJCAI 2020
Simple and sharp analysis of k-means|| ICML 2020
WOR and $p$'s: Sketches for $\ell_p$-Sampling Without Replacement NIPS 2020
Instead of Rewriting Foreign Code for Machine Learning, Automatically Synthesize Fast Gradients NIPS 2020
On Adaptive Distance Estimation NIPS 2020