Counting Satisfying Assignments in 2-SAT and 3-SAT. - Vilhelm Dahllöf; Peter Jonsson; Magnus Wahlström (COCOON, 2002)

Finite Domain Constraint Satisfaction Using Quantum Computation. - Ola Angelsmark; Vilhelm Dahllöf; Peter Jonsson (MFCS, 2002)

An algorithm for counting maximum weighted independent sets and its applications. - Vilhelm Dahllöf; Peter Jonsson (SODA, 2002)

Applications of General Exact Satisfiability in Propositional Logic Modelling. - Vilhelm Dahllöf (LPAR, 2004)

Algorithms for four variants of the exact satisfiability problem. - Vilhelm Dahllöf; Peter Jonsson; Richard Beigel (Theor. Comput. Sci., 2004)

Algorithms for Max Hamming Exact Satisfiability. - Vilhelm Dahllöf (ISAAC, 2005)

Counting models for 2SAT and 3SAT formulae. - Vilhelm Dahllöf; Peter Jonsson; Magnus Wahlström (Theor. Comput. Sci., 2005)

Exact Algorithms for Exact Satisfiability Problems. - Vilhelm Dahllöf (2006)