conftrace_
← Foundations
Computer Science › Foundations ›

Algorithms

1,298 papers

Papers per year

1
6
27
149
97
'05
'10
'15
'20
'25

Papers

Black-Box Methods for Restoring Monotonicity ICML 2020
Fair k-Centers via Maximum Matching ICML 2020
Graph-based Nearest Neighbor Search: From Practice to Theory ICML 2020
Simple and sharp analysis of k-means|| ICML 2020
Incremental Sampling Without Replacement for Sequence Models ICML 2020
An Algorithm for Multi-Attribute Diverse Matching IJCAI 2020
Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions IJCAI 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
Flow-Based Network Creation Games IJCAI 2020
Selecting Voting Locations for Fun and Profit IJCAI 2020
Tight Approximation for Proportional Approval Voting IJCAI 2020
Computational Aspects of Conditional Minisum Approval Voting in Elections with Interdependent Issues IJCAI 2020
Keeping Your Friends Close: Land Allocation with Friends IJCAI 2020
Budgeted Facility Location Games with Strategic Facilities IJCAI 2020
Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints IJCAI 2020
NLocalSAT: Boosting Local Search with Solution Prediction IJCAI 2020
Bipartite Encoding: A New Binary Encoding for Solving Non-Binary CSPs IJCAI 2020
Speeding up Very Fast Decision Tree with Low Computational Cost IJCAI 2020
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem IJCAI 2020
Two-goal Local Search and Inference Rules for Minimum Dominating Set IJCAI 2020
NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set IJCAI 2020
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems IJCAI 2020
Smart Voting IJCAI 2020
The Complexity Landscape of Resource-Constrained Scheduling IJCAI 2020