Dani{\"e}l Paulusma

Recent Publications

Model Counting for CNF Formulas of Bounded Modular Treewidth
Dani{\"e}l Paulusma, Friedrich Slivovsky, Stefan Szeider
Algorithmica, volume 76, number 1, pages 168-194, 2016.
PDF bib DOI
Model Counting for CNF Formulas of Bounded Modular Treewidth
Dani{\"e}l Paulusma, Friedrich Slivovsky, Stefan Szeider
30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier and Thomas Wilke), volume 20 of LIPIcs, pages 55-66, 2013, Leibniz-Zentrum fuer Informatik.
bib DOI
Satisfiability of acyclic and almost acyclic CNF formulas
Sebastian Ordyniak, Dani{\"e}l Paulusma, Stefan Szeider
Theoretical Computer Science, volume 481, pages 85-99, 2013.
bib DOI
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
Sebastian Ordyniak, Dani{\"e}l Paulusma, Stefan Szeider
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India (Kamal Lodaya and Meena Mahajan), volume 8 of LIPIcs, pages 84-95, 2010, Leibniz-Zentrum fuer Informatik.
bib