conftrace_
← Foundations
Computer Science › Foundations ›

Algorithms

1,298 papers

Papers per year

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

Papers

Efficiently Learning Fourier Sparse Set Functions NIPS 2019
Subquadratic High-Dimensional Hierarchical Clustering NIPS 2019
G2SAT: Learning to Generate SAT Formulas NIPS 2019
Towards a Zero-One Law for Column Subset Selection NIPS 2019
Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length AAAI 2019
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation AAAI 2019
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples AAAI 2019
On Geometric Alignment in Low Doubling Dimension AAAI 2019
Solving Integer Quadratic Programming via Explicit and Structural Restrictions AAAI 2019
A Recursive Algorithm for Projected Model Counting AAAI 2019
Automatic Construction of Parallel Portfolios via Explicit Instance Grouping AAAI 2019
A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving AAAI 2019
BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting AAAI 2019
Generalized Distance Bribery AAAI 2019
On the Complexity of the Inverse Semivalue Problem for Weighted Voting Games AAAI 2019
Approximation and Hardness of Shift-Bribery AAAI 2019
Very Hard Electoral Control Problems AAAI 2019
Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking AAAI 2019
Random Walk Decay Centrality AAAI 2019
A Better Algorithm for Societal Tradeoffs AAAI 2019
A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem AAAI 2019
On the Optimal Efficiency of Cost-Algebraic A* AAAI 2019
Evolving Solutions to Community-Structured Satisfiability Formulas AAAI 2019
Enriching Non-Parametric Bidirectional Search Algorithms AAAI 2019
Enhancing Lazy Grounding with Lazy Normalization in Answer-Set Programming AAAI 2019