Slim

Weighted Model Counting with Twin-Width
PDF Cite Project Project Project Project DOI
Finding the Hardest Formulas for Resolution
Cite Project Project DOI
Finding the Hardest Formulas for Resolution (Extended Abstract)
Cite Project Project DOI
Learning fast-inference Bayesian networks
PDF Cite Project Project
Parameterized Complexity of Small Decision Tree Learning
PDF Cite Project Project
SAT Modulo Symmetries for Graph Generation
Cite Project Project DOI
The Parameterized Complexity of Clustering Incomplete Data
PDF Cite Project Project Project Project
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
PDF Cite Project Project
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
PDF Cite Project Project Project
A Time Leap Challenge for SAT-Solving
Cite Project Project