Daniël Paulusma

Recent Publications

Model Counting for CNF Formulas of Bounded Modular Treewidth
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.
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)
Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings (Karem A. Sakallah and Laurent Simon), volume 6695 of Lecture Notes in Computer Science, pages 47-60, 2011, Springer Verlag.