Slim

The Computational Complexity of Concise Hypersphere Classification
PDF Cite Project Project Project
The Parameterized Complexity of Finding Concise Local Explanations
PDF Cite Project Project DOI
A SAT Approach to Twin-Width
Cite Project Project DOI
A SAT Attack on Rota’s Basis Conjecture
PDF Cite Project Project DOI
Finding a Cluster in Incomplete Data
PDF Cite Project Project Project DOI
Learning Large Bayesian Networks with Expert Constraints
Cite Project Project
PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT
PDF Cite Project Project DOI
SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)
PDF Cite Project Project DOI
Threshold Treewidth and Hypertree Width
PDF Cite Project Project Project DOI
Tractable Abstract Argumentation via Backdoor-Treewidth
PDF Cite Project Project